{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"DM4","name":"Rich vs anemic domain model","shortDescription":{"text":"Rich vs anemic domain model"},"helpUri":"https://codehealth.canine.dev/dimensions/DM4"},{"id":"DM5","name":"Encapsulated state","shortDescription":{"text":"Encapsulated state"},"helpUri":"https://codehealth.canine.dev/dimensions/DM5"},{"id":"ES1","name":"Fold determinism","shortDescription":{"text":"Fold determinism"},"helpUri":"https://codehealth.canine.dev/dimensions/ES1"},{"id":"ES2","name":"Immutable events","shortDescription":{"text":"Immutable events"},"helpUri":"https://codehealth.canine.dev/dimensions/ES2"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"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":"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":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"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":"biome_module_graph::db::type_inference::promise_classification::classify_expression (cyclomatic 183): biome_module_graph::db::type_inference::promise_classification::classify_expression has cyclomatic complexity 183 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/biome_module_graph/src/db/type_inference/promise_classification.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"1927bd0dd933012e2ec221e6c21ac916066b7e6aad5003412df4c0c22fe0e4b7"}},{"ruleId":"D1","level":"warning","message":{"text":"FormatHtmlElementList::fmt_children (cyclomatic 127): FormatHtmlElementList::fmt_children has cyclomatic complexity 127 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/biome_html_formatter/src/html/lists/element_list.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eb9e1ad6afe19e78334ae4dbb2a6755425da992ee90ffe0ff13e932acf31fcc"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_cli::execute::migrate::eslint_to_biome::migrate_eslint_rule (cyclomatic 118): biome_cli::execute::migrate::eslint_to_biome::migrate_eslint_rule has cyclomatic complexity 118 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/biome_cli/src/execute/migrate/eslint_to_biome.rs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa37dc48909810468e4fef104ef7a0062f5ba6973224449b65fb0661c6261d7b"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_service::file_handlers::html::parse_embedded_nodes::parse_embedded_nodes (cyclomatic 87): biome_service::file_handlers::html::parse_embedded_nodes::parse_embedded_nodes has cyclomatic complexity 87 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/html/parse_embedded_nodes.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"f23403e6abae27a968452e3ae9e346eca0bd41e0fffe7a79cdbbf1d7e9a764f4"}},{"ruleId":"D1","level":"warning","message":{"text":"Field::method_name (cyclomatic 86): Field::method_name has cyclomatic complexity 86 (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":"xtask/codegen/src/js_kinds_src.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"0508e21008adca653a4277d7c8db6ad0bbf48c383a5a382b665093563aad37ec"}},{"ruleId":"D1","level":"warning","message":{"text":"AriaRoles::get_implicit_role (cyclomatic 76): AriaRoles::get_implicit_role has cyclomatic complexity 76 (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/biome_aria/src/roles.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"b09006b424a0b5fdc2e4228a9818b6c7d23808976da5a4c85d5ecf65164d6af2"}},{"ruleId":"D1","level":"warning","message":{"text":"Rules::deserialize (cyclomatic 71): Rules::deserialize has cyclomatic complexity 71 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/execute/migrate/eslint_eslint.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a2ec9d4b051f8cee442d8d378d33abe933a68355e4b693a681795ea93f90be"}},{"ruleId":"D1","level":"warning","message":{"text":"DefaultBlockListFormatter::fmt (cyclomatic 67): DefaultBlockListFormatter::fmt has cyclomatic complexity 67 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/biome_markdown_formatter/src/markdown/lists/block_list.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebfa6a1d7fea8b0553e87692c58a87b3f4158af15eba1d7052ca27c607a82c5f"}},{"ruleId":"D1","level":"warning","message":{"text":"ControlFlowVisitor::visit (cyclomatic 66): ControlFlowVisitor::visit 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/biome_js_control_flow/src/visitor.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"a71520e6e422ae2c6dab45d583421b6d9385b1039ef3275ecaea1f2c8cb7d0b7"}},{"ruleId":"D1","level":"warning","message":{"text":"GritLexer::consume_name (cyclomatic 59): GritLexer::consume_name has cyclomatic complexity 59 (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/biome_grit_parser/src/lexer/mod.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d326d30fb31fb1940c38ac36e5864ce44ea22e7cc1d89b392cd7bbba0543e4"}},{"ruleId":"D1","level":"warning","message":{"text":"HtmlRenderer::enter (cyclomatic 58): HtmlRenderer::enter 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/biome_markdown_parser/src/to_html.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"b46a85639b21f8e731baa41db045582c0204da46182499779905ca6b6e0bc317"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_html_formatter::utils::children::html_split_children (cyclomatic 56): biome_html_formatter::utils::children::html_split_children has cyclomatic complexity 56 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_formatter/src/utils/children.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e3e21df7310d3869567d7926678f71a105c2c4b64d6f7f38ebe3fa650a49a4"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_markdown_parser::syntax::parse_any_block_with_indent_code_policy (cyclomatic 56): biome_markdown_parser::syntax::parse_any_block_with_indent_code_policy has cyclomatic complexity 56 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/mod.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d150cea9ecc907883f839390f500c679e0dab2e149ffd88b7c58a5959057ed8"}},{"ruleId":"D1","level":"warning","message":{"text":"JsExtent::run (cyclomatic 55): JsExtent::run has cyclomatic complexity 55 (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/biome_js_extent/src/lib.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b14b7a0a221c28f3b20425cecee4f6baac8bd3fbc3f14a1a9d82f4ead4cc66"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassMemberModifiers::check_class_member_modifier (cyclomatic 54): ClassMemberModifiers::check_class_member_modifier has cyclomatic complexity 54 (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/biome_js_parser/src/syntax/class.rs"},"region":{"startLine":2263}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7886554cd0ba253b491659083cc7978471fba04b2f99ba62bee99c8a4bad4a"}},{"ruleId":"D1","level":"warning","message":{"text":"xtask_codegen::formatter::get_node_concept (cyclomatic 54): xtask_codegen::formatter::get_node_concept has cyclomatic complexity 54 (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":"xtask/codegen/src/formatter.rs"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"bab9885a632f86200655054f74b087122ffd3e5be07f4bec125a7bb96c5ab08c"}},{"ruleId":"D1","level":"warning","message":{"text":"AssignabilityCheck::is_assignable (cyclomatic 53): AssignabilityCheck::is_assignable has cyclomatic complexity 53 (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/biome_js_type_info/src/type_relation.rs"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"593c64a154999e489b7012abeb5425fc96ad48c461fea4efeca210f02deab62f"}},{"ruleId":"D1","level":"warning","message":{"text":"Printer::print_element (cyclomatic 52): Printer::print_element 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/biome_formatter/src/printer/mod.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8fcbfac8405e552e94a1be269287df1877322b97048552ee88b7589888f3318"}},{"ruleId":"D1","level":"warning","message":{"text":"MarkdownLexer::consume_token_impl (cyclomatic 52): MarkdownLexer::consume_token_impl has cyclomatic complexity 52 (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/biome_markdown_parser/src/lexer/mod.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d26d52646e878e0ba80932db54560fe08b79c4f0448f6ae88bb335a7da6038"}},{"ruleId":"D1","level":"warning","message":{"text":"JsLexer::lex_token (cyclomatic 51): JsLexer::lex_token has cyclomatic complexity 51 (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: JsLexer::resolve_identifier (cyclomatic 86) 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/biome_js_parser/src/lexer/mod.rs"},"region":{"startLine":2065}}}],"partialFingerprints":{"codehealthFindingId/v1":"935e4fff8fa9fe19575c1e3bb37d42c5263dd96b463cd12d32546a7d4c4d413b"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_parser::syntax::stmt::parse_statement (cyclomatic 50): biome_js_parser::syntax::stmt::parse_statement has cyclomatic complexity 50 (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/biome_js_parser/src/syntax/stmt.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddcca89e08ec109fc0f64f1817b3e347c22a7482e7e708bd8b504fbd9da1bf52"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::lint::suspicious::no_useless_regex_backrefs::run (cyclomatic 49): biome_js_analyze::lint::suspicious::no_useless_regex_backrefs::run has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/no_useless_regex_backrefs.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a95beb8d739425a213654474c7af5af647e5380c6602810a81563bf2c2ba78"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_markdown_parser::syntax::list::parse_first_line_blocks (cyclomatic 49): biome_markdown_parser::syntax::list::parse_first_line_blocks has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":2208}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a6dff48c100f867ea87b4d1cebfd8a08f1552066e14a48c9cbe4d7741dcac5"}},{"ruleId":"D1","level":"warning","message":{"text":"FitsMeasurer::fits_element (cyclomatic 48): FitsMeasurer::fits_element has cyclomatic complexity 48 (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/biome_formatter/src/printer/mod.rs"},"region":{"startLine":1289}}}],"partialFingerprints":{"codehealthFindingId/v1":"96732cdc3452de4b767e438f86e58396ad44a8b8226fa21e7be370f853edee70"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeData::from_any_js_expression (cyclomatic 47): TypeData::from_any_js_expression has cyclomatic complexity 47 (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/biome_js_type_info/src/local_inference.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"e27a3f560d52104e6ddfecb87e6118d1f7652b6dc6d02f7db7939819c650d53d"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeData::from_any_ts_type (cyclomatic 47): TypeData::from_any_ts_type has cyclomatic complexity 47 (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/biome_js_type_info/src/local_inference.rs"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d4c216015fcc126ae1eb0a8ee9edf661f9e76895e924b1792e95a09704ba34"}},{"ruleId":"D1","level":"warning","message":{"text":"FormatTypeVariant::fmt (cyclomatic 46): FormatTypeVariant::fmt has cyclomatic complexity 46 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/ts/lists/union_type_variant_list.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"795311c241fc4f86656fe7d40b3b00fffc1ee2024dad030131ed9dbf3183ea98"}},{"ruleId":"D1","level":"warning","message":{"text":"InferredType::is_promise_instance_with (cyclomatic 46): InferredType::is_promise_instance_with 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/biome_js_type_info/src/inferred_type.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbad92c6a20e4863735e674908755ea346cb75d025569abf3ccd508f5e1e48b8"}},{"ruleId":"D1","level":"warning","message":{"text":"MarkdownLexer::consume_textual_impl (cyclomatic 46): MarkdownLexer::consume_textual_impl 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/biome_markdown_parser/src/lexer/mod.rs"},"region":{"startLine":1451}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c7bc5d554fa1a4c0daa47cfde3610d2e6b8a598c0d60a90c7a4c41ba211998"}},{"ruleId":"D1","level":"warning","message":{"text":"NoUnsafeOptionalChaining::run (cyclomatic 45): NoUnsafeOptionalChaining::run has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/no_unsafe_optional_chaining.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bdeb098876d1ac1c4389877bb18ab5217cd84d9de111831d856feb512b334cc"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::lint::style::use_unicode_regex::is_valid_unicode_pattern (cyclomatic 45): biome_js_analyze::lint::style::use_unicode_regex::is_valid_unicode_pattern has cyclomatic complexity 45 (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/biome_js_analyze/src/lint/style/use_unicode_regex.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a69bfd59d2efde7542b57f14385d19302d73b03696638af2f26916ec3bf31a"}},{"ruleId":"D1","level":"warning","message":{"text":"NoUselessFragments::run (cyclomatic 44): NoUselessFragments::run has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/complexity/no_useless_fragments.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f8abb70621278154c1689230bd9d3a75141766d5231d2a62667b1dfc5554cd1"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_lsp::handlers::analysis::code_actions (cyclomatic 44): biome_lsp::handlers::analysis::code_actions has cyclomatic complexity 44 (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/biome_lsp/src/handlers/analysis.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"22550e1b574f202f3bddb786af17272e2415cf1d320c8bc356d8d6da64adc3db"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_react_compiler::convert_ast::expressions::convert_expression (cyclomatic 44): biome_react_compiler::convert_ast::expressions::convert_expression has cyclomatic complexity 44 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_react_compiler/src/convert_ast/expressions.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"534897ba6e2d0e8bcded9caca2c8012834f1dfb74c7e8007351a243cadb90798"}},{"ruleId":"D1","level":"warning","message":{"text":"OrganizeImports::action (cyclomatic 43): OrganizeImports::action has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/assist/source/organize_imports.rs"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"003dc840078f2e09de7718a836c6104d754446831a6ad2bb4099cccd6d436fea"}},{"ruleId":"D1","level":"warning","message":{"text":"SortableHtmlAttribute::category (cyclomatic 43): SortableHtmlAttribute::category has cyclomatic complexity 43 (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/biome_html_analyze/src/assist/source/use_sorted_attributes.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e3dd0bfcc0b47cd4e0a49072885de9ca5ab62cd90ea989879530341b91166f4"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::use_consistent_boolean_name::expressions_state (cyclomatic 43): biome_js_analyze::lint::nursery::use_consistent_boolean_name::expressions_state has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_consistent_boolean_name.rs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3dd8b5e60ccf1ba7748b585fcdc0bec33f354fb0842098a9ac01fdeb0ce6b53"}},{"ruleId":"D1","level":"warning","message":{"text":"HtmlLexer::consume_identifier (cyclomatic 42): HtmlLexer::consume_identifier has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_parser/src/lexer/mod.rs"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"159a4fa8292ee3f8786a030f9b97b1568b217862e2cf14dd93a31e518c0a27f4"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::ast_utils::is_constant_condition (cyclomatic 42): biome_js_analyze::ast_utils::is_constant_condition has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/ast_utils.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac36d2252f1048877209eedce601a26c2a6bc07ec2f0fd3a4162b69d0fbbded"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_markdown_parser::syntax::thematic_break_block::is_thematic_break_pattern (cyclomatic 42): biome_markdown_parser::syntax::thematic_break_block::is_thematic_break_pattern has cyclomatic complexity 42 (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/biome_markdown_parser/src/syntax/thematic_break_block.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"e195f807d60a0802aad6d4c66ca0174f3fbab7b0f7725e6f310c6350fa254b23"}},{"ruleId":"D1","level":"warning","message":{"text":"VueSemanticModel::fmt (cyclomatic 42): VueSemanticModel::fmt has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_vue_semantic/src/format_semantic_model.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"b36a1130b08b20cf3803be7ae437c2c1be8e98da6f2cd851dee4f223b2cf210d"}},{"ruleId":"D1","level":"warning","message":{"text":"UseImportType::run (cyclomatic 41): UseImportType::run has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_import_type.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"77ca6b3994490bc28838707b3fddb96f1edd25f904e3a0e7d56caafc1237565f"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_service::file_handlers::html::parse_embedded_nodes::parse_svelte_blocks (cyclomatic 41): biome_service::file_handlers::html::parse_embedded_nodes::parse_svelte_blocks has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/html/parse_embedded_nodes.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ec947c9663e5c574b5e80562bf106ebc559f207ce953f8bfa70dfb784b8743"}},{"ruleId":"D1","level":"warning","message":{"text":"UseExplicitType::run (cyclomatic 40): UseExplicitType::run 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/biome_js_analyze/src/lint/nursery/use_explicit_type.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d1d8fdd79434ac01798a7ab365cd340089708375390fce5814485b5665481e"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_diagnostics::display::frame::print_frame (cyclomatic 39): biome_diagnostics::display::frame::print_frame 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/biome_diagnostics/src/display/frame.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"24605b4d6e8db1f6d40c44830087badfc4733826dffa21a2050cfa79b76cde64"}},{"ruleId":"D1","level":"warning","message":{"text":"SemanticEventExtractor::enter_identifier_binding (cyclomatic 39): SemanticEventExtractor::enter_identifier_binding 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/biome_js_semantic/src/events.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"13629d9543ac9b59a7714aabf52a953275a353cbe78e551d3bd5017de5520d1d"}},{"ruleId":"D1","level":"warning","message":{"text":"DefaultCollector::run (cyclomatic 38): DefaultCollector::run has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/runner/impls/collectors/default.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee5ee89c3fe305d6cb06428ea690cc0569c44d1cb2284fabe4a362b23a81af8"}},{"ruleId":"D1","level":"warning","message":{"text":"ResolutionCtx::resolve_qualifier (cyclomatic 38): ResolutionCtx::resolve_qualifier has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/type_inference/qualifiers.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0e32939174d8273eb8bef9db981ce6deed6d22f2961bf940a74523ba9d81262"}},{"ruleId":"D1","level":"warning","message":{"text":"xtask_codegen::generate_nodes::generate_nodes (cyclomatic 38): xtask_codegen::generate_nodes::generate_nodes has cyclomatic complexity 38 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/generate_nodes.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"a030fea854e9821040895d40183d29fb0af830eecd03d8579756267013aa4cf2"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_cli::execute::migrate::migrate_file (cyclomatic 37): biome_cli::execute::migrate::migrate_file has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/execute/migrate.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"96a7d02e2107fbf6cc4299baab863e51491ee3544018cfdbc40845d448927f02"}},{"ruleId":"D1","level":"warning","message":{"text":"CssLexer::consume_token_with_fallback (cyclomatic 37): CssLexer::consume_token_with_fallback has cyclomatic complexity 37 (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: CssLexer::consume_identifier_with_slash (cyclomatic 242) 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/biome_css_parser/src/lexer/mod.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef406669508ecf59e175bfdfb2a59bc63bf9ff2bfd841acc87ae12304e9e8056"}},{"ruleId":"D1","level":"warning","message":{"text":"NoUselessEscapeInRegex::run (cyclomatic 37): NoUselessEscapeInRegex::run has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/complexity/no_useless_escape_in_regex.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"092564a1275b16729fb0808441660020a26cf4238ac0a5ec674c873806d438ba"}},{"ruleId":"D1","level":"warning","message":{"text":"UseReactFunctionComponentDefinition::action (cyclomatic 37): UseReactFunctionComponentDefinition::action has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_react_function_component_definition.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"8485a5ee2df217002a808bf665c466bb74984051e59e6a668505c19cff0a1438"}},{"ruleId":"D1","level":"warning","message":{"text":"BooleanCoercionVisitor::enter (cyclomatic 37): BooleanCoercionVisitor::enter has cyclomatic complexity 37 (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/biome_js_type_info/src/inferred_type/boolean_coercion.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"9207abdec9ee261094c85b0326485dba97dbc6aecc2ad5c5de608bbcb015b81c"}},{"ruleId":"D1","level":"warning","message":{"text":"ListBlockList::fmt (cyclomatic 37): ListBlockList::fmt has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_formatter/src/bullet_list.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb3831b0ab9e641039e0d0a2f53033f7b2aa781ff2baf80e09bb9cb06d440d0"}},{"ruleId":"D1","level":"warning","message":{"text":"ResolutionCtx::resolve_flow_expression (cyclomatic 37): ResolutionCtx::resolve_flow_expression has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/type_inference/flow_expressions.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"487028462687065a30c23d3bace150feaf9f23551375afc701fccebc71acdaf6"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_ruledoc_utils::analyzer::analyze_rule_code (cyclomatic 37): biome_ruledoc_utils::analyzer::analyze_rule_code has cyclomatic complexity 37 (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/biome_ruledoc_utils/src/analyzer.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d5d9bf0153ecc09d7dfc8d3f334870e2fe4f4d6ef435c7b7565af88e65350c"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_syntax::unescape::unescape_js_string (cyclomatic 36): biome_js_syntax::unescape::unescape_js_string has cyclomatic complexity 36 (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/biome_js_syntax/src/unescape.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fae53e450e95e7a21f12a1c83a31afd0ce5a47e0cda7bd6076778f7a8df1419"}},{"ruleId":"D1","level":"warning","message":{"text":"PendingSortKey::from_candidate (cyclomatic 36): PendingSortKey::from_candidate has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_tailwind_logic/src/use_tailwind_sorted_classes/sort_v4.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"b96ec5fc64087ffc0d4a17dd2872afa318f1db92c28752651b6172409805b2bc"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_tailwind_logic::syntax_service::inspect_string_literal (cyclomatic 36): biome_tailwind_logic::syntax_service::inspect_string_literal has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_tailwind_logic/src/syntax_service.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"63845c35deead053aff9ecbd2ba36bc0be673182c419bc3be5e812fde6575672"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_cli::commands::inspect::plugins::inspect_plugins (cyclomatic 35): biome_cli::commands::inspect::plugins::inspect_plugins 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/biome_cli/src/commands/inspect/plugins/mod.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"003b37421747594fee359357776ffc2acd1812fa75cb6bee170ef40976aeaf5e"}},{"ruleId":"D1","level":"warning","message":{"text":"ArgumentTypeCompatibility::action (cyclomatic 35): ArgumentTypeCompatibility::action 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/biome_module_graph/src/db/queries/type_inference/calls/implementation.rs"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"e10747cbbd53602adb2e24049173527fd9924f1c9c27edc1cc3d5074f8eff555"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkspaceServerWithDb::open_file_internal (cyclomatic 35): WorkspaceServerWithDb::open_file_internal 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/biome_service/src/workspace/server.rs"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8d54b546519821315eb5c1e5b1441ab353aa66e8d336eb64d6e7abe68879f7"}},{"ruleId":"D1","level":"warning","message":{"text":"NamingConventionSelection::selectors (cyclomatic 34): NamingConventionSelection::selectors has cyclomatic complexity 34 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/execute/migrate/eslint_typescript.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"84291351fc4aa80cd0dbd57566a71bd79349f558fc8f0e8995ea4ebf1f22cc8f"}},{"ruleId":"D1","level":"warning","message":{"text":"FormatJsxChildList::fmt_children (cyclomatic 34): FormatJsxChildList::fmt_children has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/jsx/lists/child_list.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa7b8ea2ab42a9cfef619c19bc46959fed5ad588d0e27ed6ae022ae10caf5845"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_markdown_parser::syntax::list::classify_blank_line_in_quote (cyclomatic 34): biome_markdown_parser::syntax::list::classify_blank_line_in_quote has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":3283}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a523e9d00cb97a09aa30bd6957ef0717a43098112cc617ac7fdd220a997bfa"}},{"ruleId":"D1","level":"warning","message":{"text":"ResolutionCtx::resolve_typeof_expression (cyclomatic 34): ResolutionCtx::resolve_typeof_expression has cyclomatic complexity 34 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"413ea9a2f2c88cfd9e5f134d3b0637ffc9960bd3bb9303ae785416e133fadde9"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_glob::editorconfig::convert_glob (cyclomatic 33): biome_glob::editorconfig::convert_glob has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_glob/src/editorconfig.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8dc9ae031986bf2ad8f3ce9b2df132ccb1dd814ff7b7836a8af1378d1d5c8a9"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_html_parser::syntax::parse_element_allowing_sfc_blocks (cyclomatic 33): biome_html_parser::syntax::parse_element_allowing_sfc_blocks has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_parser/src/syntax/mod.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b360ca64f72aa91ee90b66d97775bba66f564fe0d2fd7e1f4c86e0143319b74"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_type_info::return_type_relation::is_only_property_literal_widening (cyclomatic 33): biome_js_type_info::return_type_relation::is_only_property_literal_widening has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/return_type_relation.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b609493c0ecad2df0cbad5475a39dc509e1249a126b8ed8f3a2ffdd1a21f9b"}},{"ruleId":"D1","level":"warning","message":{"text":"HtmlRenderer::leave (cyclomatic 33): HtmlRenderer::leave has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/to_html.rs"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8bac2b0ae2ddae5ff01afaa3963edf2f1467e947a0a753e3282a185963c28a8"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_markdown_parser::syntax::inline::emphasis::parse_emphasis_from_context (cyclomatic 33): biome_markdown_parser::syntax::inline::emphasis::parse_emphasis_from_context has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/inline/emphasis.rs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"5991115f078882df55bbbad7f7000953289f12aea35f6feed850de0f35f78030"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_tailwind_logic::class_category::utility_category (cyclomatic 33): biome_tailwind_logic::class_category::utility_category has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_tailwind_logic/src/class_category.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5b3578b6f860342a40c041a8c8038fd49c1a3fde2558065d30d42340d7d260"}},{"ruleId":"D1","level":"warning","message":{"text":"JsLexer::read_regex (cyclomatic 32): JsLexer::read_regex 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. This is NOT this file\u0027s highest cyclomatic complexity: JsLexer::resolve_identifier (cyclomatic 86) 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/biome_js_parser/src/lexer/mod.rs"},"region":{"startLine":1674}}}],"partialFingerprints":{"codehealthFindingId/v1":"4717a11e0ce8113c6db178bb5110f8f75548a8414bf8ff83aca667da2d58c7c3"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_service::file_handlers::html::parse_embedded_nodes::parse_matched_embed (cyclomatic 32): biome_service::file_handlers::html::parse_embedded_nodes::parse_matched_embed 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/biome_service/src/file_handlers/html/parse_embedded_nodes.rs"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"668c74c70e0ae602db55013fae293872d138eaf76db4492b31b4041911a319a2"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_vue_semantic::semantic_model::snippets::expression_shape (cyclomatic 32): biome_vue_semantic::semantic_model::snippets::expression_shape has cyclomatic complexity 32 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_vue_semantic/src/semantic_model/snippets.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"342ac250edd74129c4f43f77477bc696da6955fe7751a4c3ed795dab3e1fce90"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_formatter::format_range (cyclomatic 31): biome_formatter::format_range has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_formatter/src/lib.rs"},"region":{"startLine":2021}}}],"partialFingerprints":{"codehealthFindingId/v1":"a10c149f9e79fdf9f17a4a1cc4c492498000d6532577fc41495afb84af4fdf7a"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::use_explicit_return_type::collect_return_statements (cyclomatic 31): biome_js_analyze::lint::nursery::use_explicit_return_type::collect_return_statements has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_explicit_return_type.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef889d711fc2192f7d7e23e36c28fd4d7b95777a26c1c7a228cf4da3346142b2"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::lint::suspicious::no_unnecessary_conditions::check_condition_necessity (cyclomatic 31): biome_js_analyze::lint::suspicious::no_unnecessary_conditions::check_condition_necessity has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/no_unnecessary_conditions.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a397352f33bb86a87d169a0532988558c0aba254c714399e685e167d220648"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_markup::markup (cyclomatic 31): biome_markup::markup has cyclomatic complexity 31 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markup/src/lib.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e9228f71e639c9d89aff81731560a70da816eb53ae310668e346002d7ad46f"}},{"ruleId":"D1","level":"warning","message":{"text":"PackageJsonVisitor::visit_map (cyclomatic 31): PackageJsonVisitor::visit_map has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_package/src/node_js_package/package_json.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d3e9293e75f0bc39fe2971c2ec540e74257fea27538e93de31a9d8a31b127a"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_syntax_codegen::generate_nodes::generate_nodes (cyclomatic 31): biome_syntax_codegen::generate_nodes::generate_nodes has cyclomatic complexity 31 (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/biome_syntax_codegen/src/generate_nodes.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd3a29c518f4ec32978ca4cbdf61a91c2dd981a115ab3de89af5b322ecb8037d"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_vue_semantic::semantic_model::references::usage_of (cyclomatic 30): biome_vue_semantic::semantic_model::references::usage_of has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_vue_semantic/src/semantic_model/references.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"22e37bdaa80bea2084cce702702d905640e0c6dd1ff757abbf1dea27a18a3caf"}},{"ruleId":"D1","level":"warning","message":{"text":"YamlLexer::consume_flow_collection (cyclomatic 30): YamlLexer::consume_flow_collection has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_yaml_parser/src/lexer/mod.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a0e82467c624386a56b589baf451171e5195431237d18700e7668c720b8a218"}},{"ruleId":"D1","level":"warning","message":{"text":"MigrationResults::advices (cyclomatic 29): MigrationResults::advices has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: RuleSource::try_from (cyclomatic 43) 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/biome_cli/src/execute/migrate/eslint_to_biome.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a3951fbbad1670927222112cf16481a1fc42b34ec0fbdf9ba256bcd17b3231"}},{"ruleId":"D1","level":"warning","message":{"text":"OverridePattern::apply_to_configuration (cyclomatic 29): OverridePattern::apply_to_configuration has cyclomatic complexity 29 (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/biome_configuration/src/overrides.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"efcd9a4cba80bb0da62d22836e70f53e16f638399fde04dd72693e17cd600196"}},{"ruleId":"D1","level":"warning","message":{"text":"SemanticEventExtractor::enter (cyclomatic 29): SemanticEventExtractor::enter 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/biome_css_semantic/src/events.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"b64527f5d0816e060380642e74fe564234c1a8edc66396c50f340ef0202f2971"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_parser::syntax::expr::parse_binary_or_logical_expression (cyclomatic 29): biome_js_parser::syntax::expr::parse_binary_or_logical_expression 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/biome_js_parser/src/syntax/expr.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"1578b02a904475f78b986abe238473e813aa6c0caa6bf8a8fde9308aeea00347"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_syntax::numbers::canonicalize_js_bigint_literal (cyclomatic 29): biome_js_syntax::numbers::canonicalize_js_bigint_literal 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/biome_js_syntax/src/numbers.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"750362e4dd7b2db8299ff757cd650d6b3dfddf25003e4e5818de37f4fa71e59e"}},{"ruleId":"D1","level":"warning","message":{"text":"MarkdownLexer::consume_thematic_break_or_emphasis (cyclomatic 29): MarkdownLexer::consume_thematic_break_or_emphasis has cyclomatic complexity 29 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/lexer/mod.rs"},"region":{"startLine":1090}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6434b07bdd417c36e0ae81d38b3cf11946fe765a51d4beb12d0c9002fd164f2"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_markdown_parser::syntax::inline::parse_any_inline (cyclomatic 29): biome_markdown_parser::syntax::inline::parse_any_inline 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/biome_markdown_parser/src/syntax/inline/mod.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f078fa3cae922ea84cc9e295cb8ebd56f02194c4d958850fc62125d5b03fe01"}},{"ruleId":"D1","level":"warning","message":{"text":"Case::identify (cyclomatic 29): Case::identify has cyclomatic complexity 29 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_string_case/src/lib.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d7134d816c1010b2f87e1fed92103beafa9b880029f39e760a8ab742fe7f52"}},{"ruleId":"D1","level":"warning","message":{"text":"HtmlLexer::consume_token_inside_tag_angular (cyclomatic 28): HtmlLexer::consume_token_inside_tag_angular 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/biome_html_parser/src/lexer/mod.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ca0c8a782433c9a4e851720d0a880271c327036f2930200b7b4f20dde01b28"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_html_parser::syntax::parse_attribute (cyclomatic 28): biome_html_parser::syntax::parse_attribute 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/biome_html_parser/src/syntax/mod.rs"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf808fb700f84fb3eded21cd8eded1a6059156d99c6eeb0ca80337b3ad580f05"}},{"ruleId":"D1","level":"warning","message":{"text":"UnreachableRanges::propagate_ranges (cyclomatic 28): UnreachableRanges::propagate_ranges has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/no_unreachable.rs"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad7b68e73ce23e5f675ff69673bfe31e47445f95a099489b4fdff82547a97ffe"}},{"ruleId":"D1","level":"warning","message":{"text":"NoNegationInEqualityCheck::action (cyclomatic 28): NoNegationInEqualityCheck::action has cyclomatic complexity 28 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_negation_in_equality_check.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"405fc936b028a813535a784dc0d43ce37fcb2fef4e24f0b3cf6f64ca60e4d05f"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::lint::correctness::no_unused_private_class_members::traverse_members_usage (cyclomatic 28): biome_js_analyze::lint::correctness::no_unused_private_class_members::traverse_members_usage has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/no_unused_private_class_members.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"e975552b4ac5a9003042af8d2ceecf4756a5454d1a335df37f5232939a07b28b"}},{"ruleId":"D1","level":"warning","message":{"text":"InferredType::object_spread_misuse (cyclomatic 28): InferredType::object_spread_misuse 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/biome_js_type_info/src/inferred_type/spread_misuse.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb5bd259ae95dcaa13b7c95191a816fcdf3d95108e5337b93a9469e01f4634a"}},{"ruleId":"D1","level":"warning","message":{"text":"MarkdownLexer::is_in_list_marker_whitespace (cyclomatic 28): MarkdownLexer::is_in_list_marker_whitespace has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/lexer/mod.rs"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0a88079d9fe2aa6810d28839444d45a6a7187d1a8120acf5e265b6f727c506"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_module_graph::db::queries::type_inference::calls::implementation::infer_generic_return_type (cyclomatic 28): biome_module_graph::db::queries::type_inference::calls::implementation::infer_generic_return_type has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/queries/type_inference/calls/implementation.rs"},"region":{"startLine":1770}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef93dd002f15067f3acad13f8b22c7f0c51575bf3e0d566154363564a7deeec"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_vue_semantic::semantic_model::sfc_model (cyclomatic 28): biome_vue_semantic::semantic_model::sfc_model has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_vue_semantic/src/semantic_model/mod.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"97bc6d58c6ee7fb3db3ca7c99ebdf13d952963ee390245249bd9de7a527bac2c"}},{"ruleId":"D1","level":"warning","message":{"text":"DeclarationOrRuleList::parse_element (cyclomatic 27): DeclarationOrRuleList::parse_element 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/biome_css_parser/src/syntax/block/declaration_or_rule_list_block.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b9142c394f4637166f1c432d9f2cbcfb0b5ccd422dd1ac8348435bd827cb74"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_grit_parser::parser::patterns::parse_pattern_with_precedence (cyclomatic 27): biome_grit_parser::parser::patterns::parse_pattern_with_precedence has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_parser/src/parser/patterns.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b5ddc9acee73565fbee0b066b828823c0e57d156716b9bacd379d7a52b08ce"}},{"ruleId":"D1","level":"warning","message":{"text":"HtmlLexer::next_token (cyclomatic 27): HtmlLexer::next_token has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_parser/src/lexer/mod.rs"},"region":{"startLine":1804}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a2d0b97cedffdbaab5a35ef0a72af19c8b2b09b995feec3a1253834b2353a9"}},{"ruleId":"D1","level":"warning","message":{"text":"FormatJsAnyConditionalRule::should_extra_indent (cyclomatic 27): FormatJsAnyConditionalRule::should_extra_indent 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/biome_js_formatter/src/utils/conditional.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d0eb03e5cd14cc577e0869f189f2019795b42e63dbd4142c1f947b459bb2063"}},{"ruleId":"D1","level":"warning","message":{"text":"Session::load_biome_configuration_file_internal (cyclomatic 27): Session::load_biome_configuration_file_internal has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/session.rs"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b074e62f40ea2a0bdec79212369a4bea4b4b79fda398712589b2bc7c81b999"}},{"ruleId":"D1","level":"warning","message":{"text":"QuoteBlockList::fmt (cyclomatic 27): QuoteBlockList::fmt 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/biome_markdown_formatter/src/quote.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7bea57593115730e42fc87d48e6961b4f4db4149b4630fcd7821d15c6dc0be1"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_markdown_parser::syntax::parse_inline_item_list_with_task_list_item (cyclomatic 27): biome_markdown_parser::syntax::parse_inline_item_list_with_task_list_item 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/biome_markdown_parser/src/syntax/mod.rs"},"region":{"startLine":1510}}}],"partialFingerprints":{"codehealthFindingId/v1":"68fa66d84403184171d3636022468c252454989aa131c6a3b0e2ce12a927a5da"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_markdown_parser::syntax::list::check_continuation_indent (cyclomatic 27): biome_markdown_parser::syntax::list::check_continuation_indent 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/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":2733}}}],"partialFingerprints":{"codehealthFindingId/v1":"f123666e5618f3fbfedbcf46535d8934dcb94953345d616e8789938870165a99"}},{"ruleId":"D1","level":"warning","message":{"text":"FormatYamlBlockMapExplicitEntry::fmt_fields (cyclomatic 27): FormatYamlBlockMapExplicitEntry::fmt_fields 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/biome_yaml_formatter/src/yaml/auxiliary/block_map_explicit_entry.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a753d656f8fc7604bcca02cc8e0d85ec0125edf4319707f5b5f3d280dcfc162"}},{"ruleId":"D1","level":"warning","message":{"text":"GlobalBuilder::try_lower_type (cyclomatic 27): GlobalBuilder::try_lower_type has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/generate_global_types/lower/generic.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"629ccb8198a6f8415e92b456b18981c77a05a46826fbe0c02594991c21ab68d4"}},{"ruleId":"D1","level":"warning","message":{"text":"NoScssNullComparison::run (cyclomatic 26): NoScssNullComparison::run 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/biome_css_analyze/src/lint/nursery/no_scss_null_comparison.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea0969ee814f177cdf1c0a2c425241fb2647c5caa87db2c427b6cc92903f7a4"}},{"ruleId":"D1","level":"warning","message":{"text":"DeriveStructInput::parse (cyclomatic 26): DeriveStructInput::parse has cyclomatic complexity 26 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_diagnostics_macros/src/parse.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"b71a4b2ae89edd12a54df03f68aa33e705b33e2ba6e47428f851d032c96e1e8d"}},{"ruleId":"D1","level":"warning","message":{"text":"HtmlLexer::consume_token_inside_tag_directives (cyclomatic 26): HtmlLexer::consume_token_inside_tag_directives has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: HtmlLexer::consume_language_identifier (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/biome_html_parser/src/lexer/mod.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"77772b6a479fb473fd1f63bdbed87da420daa2d912a43a2b17c9ec10fd674ad4"}},{"ruleId":"D1","level":"warning","message":{"text":"NoUselessUndefined::run (cyclomatic 26): NoUselessUndefined::run 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/biome_js_analyze/src/lint/complexity/no_useless_undefined.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"df9d357574dab451bfb5670bc319ede55ecc85586fb853021622d92a1f63eaf4"}},{"ruleId":"D1","level":"warning","message":{"text":"NoUnreachableSuper::run (cyclomatic 26): NoUnreachableSuper::run 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/biome_js_analyze/src/lint/correctness/no_unreachable_super.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"381a1c565697cbd294d045b1720646db622187290469782099f2f2991d81184c"}},{"ruleId":"D1","level":"warning","message":{"text":"UseFilenamingConvention::run (cyclomatic 26): UseFilenamingConvention::run 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/biome_js_analyze/src/lint/style/use_filenaming_convention.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c84ac6ee2768bc4944f702cc0a342a52a4245d205a9d6ad9dcc63f4e717cebb"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_parser::syntax::expr::parse_primary_expression (cyclomatic 26): biome_js_parser::syntax::expr::parse_primary_expression has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_parser/src/syntax/expr.rs"},"region":{"startLine":1281}}}],"partialFingerprints":{"codehealthFindingId/v1":"115b368f8fcc140a1a393bf52156bd24ea64f6fc09504ce41dc4da4a6f0245fa"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_parser::syntax::typescript::types::parse_ts_non_array_type (cyclomatic 26): biome_js_parser::syntax::typescript::types::parse_ts_non_array_type has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_parser/src/syntax/typescript/types.rs"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba7f12664c0e8b8590f01d51b1cc169c54b95451a78bd2257c24101c2bdb83a"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeDataSlotReplacements::rebuild (cyclomatic 26): TypeDataSlotReplacements::rebuild has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: TypeData::type_description (cyclomatic 40) 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/biome_js_type_info/src/interned_types.rs"},"region":{"startLine":1667}}}],"partialFingerprints":{"codehealthFindingId/v1":"17cf6209aa5c7ce31b3de55bf6132cf581847c6d0d5da53643823793a3c9adb4"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_markdown_parser::syntax::inline::emphasis::collect_delimiters (cyclomatic 26): biome_markdown_parser::syntax::inline::emphasis::collect_delimiters 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/biome_markdown_parser/src/syntax/inline/emphasis.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c0911f3a5240b33d7d86b24354c0d6b1aa663387772d8d6942d7b7bad97730f"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_module_graph::db::type_inference::lookup::find_member_key_type_with_resolver (cyclomatic 26): biome_module_graph::db::type_inference::lookup::find_member_key_type_with_resolver 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/biome_module_graph/src/db/type_inference/lookup.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eea92684302ab13f24543842581e9f1e23f8996e47b992c3b9658bf7194950a"}},{"ruleId":"D1","level":"warning","message":{"text":"OrganizeImports::run (cyclomatic 25): OrganizeImports::run has cyclomatic complexity 25 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/assist/source/organize_imports.rs"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"c48434435b96fa1a6edacf374427b7212f9d575a6df94db3ab0f6d6959ab321a"}},{"ruleId":"D1","level":"warning","message":{"text":"GritLexer::consume_number (cyclomatic 25): GritLexer::consume_number has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: GritLexer::lex_token (cyclomatic 30) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_parser/src/lexer/mod.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f0b46c1f3f7c89068cd8f9798e5f75acebc3678646869cba828959ebba08a3d"}},{"ruleId":"D1","level":"warning","message":{"text":"NoImplicitCoercions::run (cyclomatic 25): NoImplicitCoercions::run has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/complexity/no_implicit_coercions.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f25b5a7509117f491f81551b7c1db5c71fc3d26a4a1f5e441b1402f1d2789dd"}},{"ruleId":"D1","level":"warning","message":{"text":"UseComponentExportOnlyModules::run (cyclomatic 25): UseComponentExportOnlyModules::run has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_component_export_only_modules.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a49df4ee9807fe3b732eb57eca149c595ead9d2d9682954411bb676e7a03958"}},{"ruleId":"D1","level":"warning","message":{"text":"UseErrorCause::run (cyclomatic 25): UseErrorCause::run has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_error_cause.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea75e6ff7f2d5340f2cac40130d33b05f6d948c154633331c40f1b334b28e90"}},{"ruleId":"D1","level":"warning","message":{"text":"UseImportType::action (cyclomatic 25): UseImportType::action 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/biome_js_analyze/src/lint/style/use_import_type.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"753ffb925724f4ca676fe15a34c77bb26270cc23831c86c0a108a4fccc6042ca"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::lint::complexity::no_playwright_useless_await::is_sync_expect_call (cyclomatic 25): biome_js_analyze::lint::complexity::no_playwright_useless_await::is_sync_expect_call 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/biome_js_analyze/src/lint/complexity/no_playwright_useless_await.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"199149e6177928e862c4076b27a1ea18e365deea21cfb409d1b97d4c583fca02"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::use_explicit_type::is_allowed_in_untyped_expression (cyclomatic 25): biome_js_analyze::lint::nursery::use_explicit_type::is_allowed_in_untyped_expression has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_explicit_type.rs"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e12eb7f1e2e389c9de3e9a22baaa6ad05db3860bbecfd4b674e1dca184129c7"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::lint::style::use_global_this::check_expression (cyclomatic 25): biome_js_analyze::lint::style::use_global_this::check_expression 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/biome_js_analyze/src/lint/style/use_global_this.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa2dbd0462d6b02cd09db8b28c25a5ba2615ede728aaec969f0e6febfd7c3b9"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_parser::syntax::function::is_parenthesized_arrow_function_expression_impl (cyclomatic 25): biome_js_parser::syntax::function::is_parenthesized_arrow_function_expression_impl has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_parser/src/syntax/function.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"923756f63dc29e4f51b76115b155ce3c1692e049e6c730ea1699d0ab485ce592"}},{"ruleId":"D1","level":"warning","message":{"text":"SemanticModelBuilder::push_event (cyclomatic 25): SemanticModelBuilder::push_event 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/biome_js_semantic/src/semantic_model/builder.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3612cd09ddfeed93d4983549e0528719618030417da46b08d49b23150d51690"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_markdown_parser::to_html::extract_alt_text_inline (cyclomatic 25): biome_markdown_parser::to_html::extract_alt_text_inline has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/to_html.rs"},"region":{"startLine":2064}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b2c950fa1c089706610d8c9130a30c404d79b424ada08d5a35e0af2a2720afd"}},{"ruleId":"D1","level":"warning","message":{"text":"RuleMover::action (cyclomatic 25): RuleMover::action 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/biome_migrate/src/analyzers/rule_mover.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca746a2c48da94e2155834651c25cdd525ac6b4ea765e84578400da6df9d89be"}},{"ruleId":"D1","level":"warning","message":{"text":"Collector::collect_options_object (cyclomatic 25): Collector::collect_options_object has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_vue_semantic/src/semantic_model/component.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"be98ee162ec082e095a9bc9d6691583385cf729bb6533a1ab93e0e31a0d06637"}},{"ruleId":"D1","level":"warning","message":{"text":"xtask_codegen::generate_new_analyzer_rule::generate_new_analyzer_rule (cyclomatic 25): xtask_codegen::generate_new_analyzer_rule::generate_new_analyzer_rule has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/generate_new_analyzer_rule.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6ece0bfecda2116d51f9188b183f7c5d10e5c3645ea75a5fe0f538afdea7ed5"}},{"ruleId":"D1","level":"warning","message":{"text":"rules_check::check_rules (cyclomatic 25): rules_check::check_rules has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/rules_check/src/lib.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"841835bdff8af57900463398d307d255f4b78e49464eea226bf6c0f50c782f16"}},{"ruleId":"D1","level":"warning","message":{"text":"OrganizeImports::diagnostic (cyclomatic 24): OrganizeImports::diagnostic has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/assist/source/organize_imports.rs"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f5a263bb902a1f452cffc408155ec68b7212c615675639d7476fc3ad005507"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_css_syntax::property_syntax::matcher::matches_type (cyclomatic 24): biome_css_syntax::property_syntax::matcher::matches_type has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_syntax/src/property_syntax/matcher.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d188751e20d4d6eeb0f8c3c83e6ef22a93cc0c9481f3908440234a25b47868"}},{"ruleId":"D1","level":"warning","message":{"text":"FormatHtmlElement::fmt_inner (cyclomatic 24): FormatHtmlElement::fmt_inner has cyclomatic complexity 24 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_formatter/src/html/auxiliary/element.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"df358d914a1a087a373c1eefbaedd01ab1e70d513b8b55632d87e000d801c817"}},{"ruleId":"D1","level":"warning","message":{"text":"HtmlLexer::consume_html_text (cyclomatic 24): HtmlLexer::consume_html_text has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: HtmlLexer::consume_language_identifier (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/biome_html_parser/src/lexer/mod.rs"},"region":{"startLine":1677}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1eb38eaed15b3c8a5f69a968a072d22fcad4e5e9c41c21038c311cc65a2499"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_html_parser::lexer::vue_v_for_default_length (cyclomatic 24): biome_html_parser::lexer::vue_v_for_default_length has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: HtmlLexer::consume_language_identifier (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/biome_html_parser/src/lexer/mod.rs"},"region":{"startLine":2049}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c935d07d1eb6b8f8f1e6a99b491546ca9b99f4754dc8022c46e51c65e165215"}},{"ruleId":"D1","level":"warning","message":{"text":"NoUnusedImports::action (cyclomatic 24): NoUnusedImports::action has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/no_unused_imports.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a509a5f1b0849cc09609f9af5b0fbdfea5a929712790f0319b8374d573ec4d"}},{"ruleId":"D1","level":"warning","message":{"text":"NoUnsafeReturn::run (cyclomatic 24): NoUnsafeReturn::run has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_unsafe_return.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a44b56dec50c3e9a7a9c01bd8a4c32d9359a9d3f50c487c075abe3694ea4b84"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::lint::style::use_naming_convention::selector_from_binding_declaration (cyclomatic 24): biome_js_analyze::lint::style::use_naming_convention::selector_from_binding_declaration has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_naming_convention.rs"},"region":{"startLine":1209}}}],"partialFingerprints":{"codehealthFindingId/v1":"9acbc928270d64a216bd32dbad737ec4aadde5692a5ace9db5b428d701259879"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_parser::syntax::stmt::parse_variable_declarator (cyclomatic 24): biome_js_parser::syntax::stmt::parse_variable_declarator has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_parser/src/syntax/stmt.rs"},"region":{"startLine":1366}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd7fdfa8172cfb4238d2648b519eed4fc686b255f780d3f229096a80938c677"}},{"ruleId":"D1","level":"warning","message":{"text":"JsBinding::init (cyclomatic 24): JsBinding::init has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_runtime/src/semantic.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eab3de48fbc31423d6219fe51e3ce45c19e16ac574928ff3205fa5695b90873"}},{"ruleId":"D1","level":"warning","message":{"text":"FormatMdInlineItemList::fmt (cyclomatic 24): FormatMdInlineItemList::fmt has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_formatter/src/markdown/lists/inline_item_list.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9dc7d94efedcc6eb4220c9e9bfa6f28ddf9ac3345c042647443b7b0d228d175"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_markdown_parser::syntax::inline::parse_inline_item_list_until_impl (cyclomatic 24): biome_markdown_parser::syntax::inline::parse_inline_item_list_until_impl has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/inline/mod.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a2a4f78ea37a68973a1f74dd858caa422878cc69193a68c962e5b810431800"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_markdown_parser::syntax::link_block::is_valid_link_definition_lookahead (cyclomatic 24): biome_markdown_parser::syntax::link_block::is_valid_link_definition_lookahead has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/link_block.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe05e19b8ca9922f5fd80bbe7439e460781c9f92135e2961c3d616efa4ece36"}},{"ruleId":"D1","level":"warning","message":{"text":"BatchMutation::commit_with_text_range_and_edit (cyclomatic 24): BatchMutation::commit_with_text_range_and_edit has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_rowan/src/ast/batch.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e5c97c0e5c77de0844d792ef248d6c0215bf2b53a460e91e53d56ea1cd5cbe"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkspaceServerWithDb::is_ignored_by_scanner (cyclomatic 24): WorkspaceServerWithDb::is_ignored_by_scanner has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/workspace/server.rs"},"region":{"startLine":1829}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb3cd8153efaef814c3a326b194fec6b7901113e4a131c31655a8b08cbab066"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_cli::runner::impls::finalizers::default::print_to_reporter (cyclomatic 23): biome_cli::runner::impls::finalizers::default::print_to_reporter 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/biome_cli/src/runner/impls/finalizers/default.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ca827a1e5ce79097eb4360bfe52f4445f04b82c28d5578f6806159edf1403e"}},{"ruleId":"D1","level":"warning","message":{"text":"SemanticModelBuilder::push_event (cyclomatic 23): SemanticModelBuilder::push_event 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/biome_css_semantic/src/semantic_model/builder.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"d37f05048576caeb19642f843d626d667d3d911a9865c989940ff3f6a0279c6b"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_formatter::token::number::format_trimmed_number (cyclomatic 23): biome_formatter::token::number::format_trimmed_number 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/biome_formatter/src/token/number.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"699d084c133cb3823d3bd19ca3bd9d9c7b2660f1a18b64107c5f8843a77d6c89"}},{"ruleId":"D1","level":"warning","message":{"text":"GritNodePattern::execute (cyclomatic 23): GritNodePattern::execute 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/biome_grit_patterns/src/grit_node_patterns.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"581b4f2c02275852a181629f88a6ca4ffdee3d3abd2343b0a620bbf83cc1bc81"}},{"ruleId":"D1","level":"warning","message":{"text":"HtmlLexer::consume_token_inside_tag_astro (cyclomatic 23): HtmlLexer::consume_token_inside_tag_astro has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: HtmlLexer::consume_language_identifier (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/biome_html_parser/src/lexer/mod.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"1745a12df32896ed7c6cfc37749e54a7c5ffb8c7d9d386a0022e5c146c8e01cd"}},{"ruleId":"D1","level":"warning","message":{"text":"UseConsistentArrowReturn::run (cyclomatic 23): UseConsistentArrowReturn::run 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/biome_js_analyze/src/lint/style/use_consistent_arrow_return.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce9967bbad8f4fa0c2a348a00d213f24c58443074c77d1acffe0a610240ced8"}},{"ruleId":"D1","level":"warning","message":{"text":"UseExportType::run (cyclomatic 23): UseExportType::run 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/biome_js_analyze/src/lint/style/use_export_type.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0ebaefbb280215e5ad1f8c98e00168f730bcb3f28e5adb1fccb07138e6b6197"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::lint::correctness::no_unreachable::analyze_simple (cyclomatic 23): biome_js_analyze::lint::correctness::no_unreachable::analyze_simple 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/biome_js_analyze/src/lint/correctness/no_unreachable.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"567582fe90fbcfcdce0618fa76f7f5deeb67cde42cd0ba38145578d5f6dfc65d"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::lint::correctness::use_exhaustive_dependencies::is_stable_binding (cyclomatic 23): biome_js_analyze::lint::correctness::use_exhaustive_dependencies::is_stable_binding 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/biome_js_analyze/src/lint/correctness/use_exhaustive_dependencies.rs"},"region":{"startLine":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"64e4fc01bb4bf0f0879ea2389fba50f6d809bb82d79a676627a0504cc11eee67"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::lint::style::use_at_index::analyze_slice_element_access (cyclomatic 23): biome_js_analyze::lint::style::use_at_index::analyze_slice_element_access 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/biome_js_analyze/src/lint/style/use_at_index.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2aaf1538e0e5b8847d51ea8314b9ef107c40eb1b19d7220a5d7e2523b15949f"}},{"ruleId":"D1","level":"warning","message":{"text":"InferredType::has_index_signature (cyclomatic 23): InferredType::has_index_signature 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/biome_js_type_info/src/inferred_type.rs"},"region":{"startLine":1237}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b43118ac3b71c69a94e072e184028d3a6e6c3ae4db8396717f893c24aac00e2"}},{"ruleId":"D1","level":"warning","message":{"text":"InferredType::try_switch_case_variants (cyclomatic 23): InferredType::try_switch_case_variants 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/biome_js_type_info/src/inferred_type.rs"},"region":{"startLine":1403}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c88e4c7e73b4cdfb1ccdf9eed36354f0ddea5f795a1e62349a4431cbc3cc216"}},{"ruleId":"D1","level":"warning","message":{"text":"AssignabilityCheck::find_member (cyclomatic 23): AssignabilityCheck::find_member 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/biome_js_type_info/src/type_relation.rs"},"region":{"startLine":2056}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7b1bccc7c6fc1406fd31e1020aedbc285306544925566e6651d68f422c29b6"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_type_info::narrowing::narrow_non_union (cyclomatic 23): biome_js_type_info::narrowing::narrow_non_union 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/biome_js_type_info/src/narrowing.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe03d98d91d363f4a8b592692071b542fb68ffeb46134146b2be06a6461664f"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer::lex_number (cyclomatic 23): Lexer::lex_number 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/biome_json_parser/src/lexer/mod.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cbc3aaade05cd2929aeac0b337fd30612b01f9e432ac43ef64f69ebbc68b896"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_lsp::handlers::analysis::fix_all (cyclomatic 23): biome_lsp::handlers::analysis::fix_all has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/handlers/analysis.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"12eb942cb5a0dc003260cbd25a085f142356599ba6ca79c7e55d513db9edeebd"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_markdown_parser::syntax::inline::emphasis::match_delimiters (cyclomatic 23): biome_markdown_parser::syntax::inline::emphasis::match_delimiters 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/biome_markdown_parser/src/syntax/inline/emphasis.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"207440b7f90c2f738b8c14a705936f635d94ca37ec1079b03d124713aff0ed54"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_markdown_parser::syntax::list::classify_blank_line (cyclomatic 23): biome_markdown_parser::syntax::list::classify_blank_line 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/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":3184}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5d5768b8119a052840ff77dadca91b212b0c02e90b281eaf6a7d13c7fea5f13"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_react_compiler::convert_ast::modules::convert_export (cyclomatic 23): biome_react_compiler::convert_ast::modules::convert_export 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/biome_react_compiler/src/convert_ast/modules.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2633d224f5eb097c328ecb9743452718dae8de6fbba526413db2a3b4a3cb52"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_rule_options::shared::restricted_regex::validate_restricted_regex (cyclomatic 23): biome_rule_options::shared::restricted_regex::validate_restricted_regex 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/biome_rule_options/src/shared/restricted_regex.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"6650b03e0d16ed95fa223f12e96afbffc6a23b8a8546e4ab57710cc9009a1476"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_vue_semantic::format_semantic_model::write_symbol (cyclomatic 23): biome_vue_semantic::format_semantic_model::write_symbol 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/biome_vue_semantic/src/format_semantic_model.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"e81dab2d0d41d0ab652c77694ca95dae09b783d18b93e0abb35f123ae91d80ed"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_vue_semantic::semantic_model::snippets::class_entries_of (cyclomatic 23): biome_vue_semantic::semantic_model::snippets::class_entries_of 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/biome_vue_semantic/src/semantic_model/snippets.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c4ce39dccfd2e90439dff4864aa4447c93589e2f162f62476f3467ecb9436d"}},{"ruleId":"D1","level":"warning","message":{"text":"xtask_codegen::generate_global_types::lower::overrides::lower_promise_globals (cyclomatic 23): xtask_codegen::generate_global_types::lower::overrides::lower_promise_globals 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":"xtask/codegen/src/generate_global_types/lower/overrides.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a58412dcac29871a834c18395205f756c3e6165b4120bbd562257b10c4e399"}},{"ruleId":"D1","level":"warning","message":{"text":"NoMissingScssInterpolation::run (cyclomatic 22): NoMissingScssInterpolation::run 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/biome_css_analyze/src/lint/nursery/no_missing_scss_interpolation.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"3efc6db83975a8fd646dd5c124e6ea9936311c84f44de370254015514dcdeb70"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_css_analyze::lint::correctness::no_unknown_media_feature_name::has_invalid_media_feature_name (cyclomatic 22): biome_css_analyze::lint::correctness::no_unknown_media_feature_name::has_invalid_media_feature_name 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/biome_css_analyze/src/lint/correctness/no_unknown_media_feature_name.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d56cd237022da437902f0b7e64468261802673fc52fe025284aaee410d77e31"}},{"ruleId":"D1","level":"warning","message":{"text":"YamlValue::deserialize_erased (cyclomatic 22): YamlValue::deserialize_erased 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/biome_deserialize/src/yaml/value.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebef04d4a59f193cd45682f006b3e890bceab7cd0966536d3d755a41b442049f"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_diagnostics::display::diff::print_full_diff (cyclomatic 22): biome_diagnostics::display::diff::print_full_diff 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/biome_diagnostics/src/display/diff.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b0a453ad8cf05e15777ac20c93aa88fa0c0c0c2458c73c530490c3177109ebb"}},{"ruleId":"D1","level":"warning","message":{"text":"FormatSkippedTokenTrivia::fmt_skipped (cyclomatic 22): FormatSkippedTokenTrivia::fmt_skipped 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/biome_formatter/src/trivia.rs"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab7bd196ba5ca88f1a528af4ccb33fb58b945b6317baefebfccb2c1c17d1bc5f"}},{"ruleId":"D1","level":"warning","message":{"text":"NoDisabledAttribute::action (cyclomatic 22): NoDisabledAttribute::action 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/biome_html_analyze/src/lint/nursery/no_disabled_attribute.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"432b7d9c6acaff60b1c0dc7ebe7e5e9bd4d1b68b33ccfb406f48402f6b65b259"}},{"ruleId":"D1","level":"warning","message":{"text":"NoNextAsyncClientComponent::run (cyclomatic 22): NoNextAsyncClientComponent::run 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/biome_js_analyze/src/lint/correctness/no_next_async_client_component.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7e425683631da691d9c215dee89ff890ffa54d4f0e15238bfee2b070c4e010a"}},{"ruleId":"D1","level":"warning","message":{"text":"UseHookAtTopLevel::run (cyclomatic 22): UseHookAtTopLevel::run 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/biome_js_analyze/src/lint/correctness/use_hook_at_top_level.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9207bad3f55c18d84733658051a52e599c4112d60ac786cc124f0796d35919"}},{"ruleId":"D1","level":"warning","message":{"text":"UseIterableCallbackReturn::run (cyclomatic 22): UseIterableCallbackReturn::run 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/biome_js_analyze/src/lint/suspicious/use_iterable_callback_return.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"7026c0793351f68079f87bcb2ba400da9fe6bcce11df8eb98e51dfeb036378b9"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::no_unsafe_return::expected_type_at (cyclomatic 22): biome_js_analyze::lint::nursery::no_unsafe_return::expected_type_at 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/biome_js_analyze/src/lint/nursery/no_unsafe_return.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb04eebe084e3e99c8dd96d37708762f3e0f2d86d4ed6e4aa1049a325e1efafb"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::use_block_statement_over_iife::needs_function_scope (cyclomatic 22): biome_js_analyze::lint::nursery::use_block_statement_over_iife::needs_function_scope has cyclomatic complexity 22 (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/biome_js_analyze/src/lint/nursery/use_block_statement_over_iife.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"a42fb833923cf746a61f998051188ad14c1eafaa332fec12e0630876acb8c2f8"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrowChain::fmt (cyclomatic 22): ArrowChain::fmt 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/biome_js_formatter/src/js/expressions/arrow_function_expression.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c1fb62de4a97c78ed70c3b208cbb1017a3f5bdc5bed6ee1f1cac42664fa024"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_syntax::parentheses::expression::is_first_in_statement (cyclomatic 22): biome_js_syntax::parentheses::expression::is_first_in_statement 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. This is NOT this file\u0027s highest cyclomatic complexity: AnyJsExpression::needs_parentheses (cyclomatic 38) 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/biome_js_syntax/src/parentheses/expression.rs"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d015495a8dfd69db655c562602e287f619f61326432e12e1b480512d1dc5f35"}},{"ruleId":"D1","level":"warning","message":{"text":"StringificationAnalyzer::base_stringification (cyclomatic 22): StringificationAnalyzer::base_stringification 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/biome_js_type_info/src/stringification.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5bf0274d4664eb85bc3da8b048928dd6e6941460f02476a865ab7f68db64a7f"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_markdown_parser::syntax::link_block::skip_destination_tokens (cyclomatic 22): biome_markdown_parser::syntax::link_block::skip_destination_tokens 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/biome_markdown_parser/src/syntax/link_block.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e9a625bc8fcc2c961d72a34cd39a8ff37bba00904c7f6f8bf48075f1ce65ae2"}},{"ruleId":"D1","level":"warning","message":{"text":"RootBuilder::statement (cyclomatic 22): RootBuilder::statement 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/biome_module_graph/src/js_module_info/flow/builder.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebab913cdaf6dd693d1d3c48b95a7a85def7d23b3b1604812cca6a150dfd69f4"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_package::node_semver::range::parse_version_string (cyclomatic 22): biome_package::node_semver::range::parse_version_string 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/biome_package/src/node_semver/range.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"58a9e0fae3866b42192a6fbea3deb6c9c3c70a6f196c07985ca9f69b9353a47a"}},{"ruleId":"D1","level":"warning","message":{"text":"Case::convert (cyclomatic 22): Case::convert 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/biome_string_case/src/lib.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"88cb0de643169dc03575f7f7d6ae9c21a759fa05b3d499eacc18673e612ecd0f"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_tailwind_logic::no_tailwind_legacy_utilities::classify (cyclomatic 22): biome_tailwind_logic::no_tailwind_legacy_utilities::classify 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/biome_tailwind_logic/src/no_tailwind_legacy_utilities.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec3bf0271529bc60642c9e6a3ce48349c4eb0cb53c0e1c65b850573dcf60ded"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_tailwind_logic::syntax_service::is_class_configuration_value (cyclomatic 22): biome_tailwind_logic::syntax_service::is_class_configuration_value 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/biome_tailwind_logic/src/syntax_service.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba1e7851d016c96295191b47af5c4c004382ef19e18246484ea4fb9da1440e1e"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_tailwind_logic::use_tailwind_shorthand_classes::analyze_tailwind_shorthand (cyclomatic 22): biome_tailwind_logic::use_tailwind_shorthand_classes::analyze_tailwind_shorthand has cyclomatic complexity 22 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_tailwind_logic/src/use_tailwind_shorthand_classes.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"45e17589d64bdcfe090ff7d9f63b5019da31839e8b4a8e0f4eba45dd068d5109"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_vue_semantic::semantic_model::references::collect_template_references (cyclomatic 22): biome_vue_semantic::semantic_model::references::collect_template_references has cyclomatic complexity 22 (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/biome_vue_semantic/src/semantic_model/references.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"6216183f64045d33ebc5448702bfe8f580f76d5b97734463b15343574ba201af"}},{"ruleId":"D1","level":"warning","message":{"text":"watch.createWatcher (cyclomatic 22): watch.createWatcher has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 1 of the 22 points is its own statement and the rest belongs to 8 function items inside it that branch (visitDirectory, a function literal at line 120, a function literal at line 79, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/prettier-compare/src/watch.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"25903f6574c779cc729a051536c54fc0b4d99b41bac8838b2bb680aa58383bd8"}},{"ruleId":"D1","level":"warning","message":{"text":"Analyzer::run_with_optional_inspector (cyclomatic 21): Analyzer::run_with_optional_inspector has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_analyze/src/lib.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd6d453b6616d1b0c73710da33c2c26c5044359bca117deb3186794114b5fd0d"}},{"ruleId":"D1","level":"warning","message":{"text":"HtmlLexer::consume_token_inside_tag (cyclomatic 21): HtmlLexer::consume_token_inside_tag 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: HtmlLexer::consume_language_identifier (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/biome_html_parser/src/lexer/mod.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"6103a2466c0378771b6fe8b5e7dac0ea95d05aa296850b395303e960bd071715"}},{"ruleId":"D1","level":"warning","message":{"text":"HtmlLexer::consume_restricted_single_text_expression (cyclomatic 21): HtmlLexer::consume_restricted_single_text_expression has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: HtmlLexer::consume_language_identifier (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/biome_html_parser/src/lexer/mod.rs"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e23552cc54d5940983dd332c4d511b41e8e8b7b65f620d48146726f67bc6787"}},{"ruleId":"D1","level":"warning","message":{"text":"LogicalAndChain::optional_chain_expression_nodes (cyclomatic 21): LogicalAndChain::optional_chain_expression_nodes has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/complexity/use_optional_chain.rs"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd9ebd9fd1445b02e5433a0e5a2fd94dac2b21ba97b25bc24848b484445f89f8"}},{"ruleId":"D1","level":"warning","message":{"text":"UseExhaustiveDependencies::run (cyclomatic 21): UseExhaustiveDependencies::run has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/use_exhaustive_dependencies.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ce9aa7c6febe5eb24a004949637753319b46fe77028516e772965ab1483671"}},{"ruleId":"D1","level":"warning","message":{"text":"NoFallthroughSwitchClause::run (cyclomatic 21): NoFallthroughSwitchClause::run has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/no_fallthrough_switch_clause.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe5195b69f9f43386af1326ed9be69dc468220d3a9e42860226f81e778badc2"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::no_useless_spread::inline_literal (cyclomatic 21): biome_js_analyze::lint::nursery::no_useless_spread::inline_literal has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_useless_spread.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3e9e5423acc03ebb235ab84d1f65895998d0c3e9c1af0d103142907344d711"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::use_svelte_reactive_classes::find_mutation (cyclomatic 21): biome_js_analyze::lint::nursery::use_svelte_reactive_classes::find_mutation has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_svelte_reactive_classes.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"39b92b59af19e227aa0558f97b107b8a17be1bfce0a30e840e96ef96b5d345b5"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::use_svelte_reactive_classes::is_exported_value (cyclomatic 21): biome_js_analyze::lint::nursery::use_svelte_reactive_classes::is_exported_value has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_svelte_reactive_classes.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d52d38585a46628015480557723b0925d8d77a92de4f9a63d617d2660fdf39"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::lint::suspicious::no_misleading_character_class::diagnostic_regex_class (cyclomatic 21): biome_js_analyze::lint::suspicious::no_misleading_character_class::diagnostic_regex_class has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/no_misleading_character_class.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"996e124d440e6c6eae9882567470f812a7f341d75761b49bd74a1eb886c3a0e3"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::lint::suspicious::no_unnecessary_conditions::check_comparison_necessity (cyclomatic 21): biome_js_analyze::lint::suspicious::no_unnecessary_conditions::check_comparison_necessity 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/biome_js_analyze/src/lint/suspicious/no_unnecessary_conditions.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"592c47fccc498c32e410538d57f654c7d009a8dd737d35e331949b961bb3cf70"}},{"ruleId":"D1","level":"warning","message":{"text":"SemanticEventExtractor::enter (cyclomatic 21): SemanticEventExtractor::enter 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/biome_js_semantic/src/events.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5db6a4758340e76cd6f16cd2f0efa4f168497e1d64553ad7efed939c4d226d"}},{"ruleId":"D1","level":"warning","message":{"text":"AnyJsExpression::contains_a_test_pattern (cyclomatic 21): AnyJsExpression::contains_a_test_pattern 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/biome_js_syntax/src/expr_ext.rs"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"95756f1ffe8163e5e292257fbb0e1a03d90eefa51418868843a85d8e8c2f99d9"}},{"ruleId":"D1","level":"warning","message":{"text":"InferredType::has_overloaded_member (cyclomatic 21): InferredType::has_overloaded_member 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/biome_js_type_info/src/inferred_type.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"7228b03712c0ce1c0ee52636732e5a9eb3b6a1d4accca661484c027533605340"}},{"ruleId":"D1","level":"warning","message":{"text":"InferredType::conditional_type (cyclomatic 21): InferredType::conditional_type has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/inferred_type.rs"},"region":{"startLine":1570}}}],"partialFingerprints":{"codehealthFindingId/v1":"79df8201d2e760ff0ddff6a4d058d5d2ac35454482f825c479c8826c3459c7c7"}},{"ruleId":"D1","level":"warning","message":{"text":"InferredType::has_computed_member (cyclomatic 21): InferredType::has_computed_member has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/inferred_type.rs"},"region":{"startLine":1715}}}],"partialFingerprints":{"codehealthFindingId/v1":"dee802050141983a94b8ceb2e5dc34c0ec51adb310a01c63cc041477c1c81a4e"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_type_info::return_type_relation::compare_declared_return_type_owned (cyclomatic 21): biome_js_type_info::return_type_relation::compare_declared_return_type_owned 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/biome_js_type_info/src/return_type_relation.rs"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"c17d3b7fed46128729ce86e6b516b2bf2b465794307b9cddf6e8b687cd17a501"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_type_info::type_operations::indexed_access (cyclomatic 21): biome_js_type_info::type_operations::indexed_access has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/type_operations.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"56129b5af7050e4444ba578075524463b89b361fca6be5ecdcb6f5396bdfe0aa"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer::lex_string_literal (cyclomatic 21): Lexer::lex_string_literal 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/biome_json_parser/src/lexer/mod.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ddb2719f5ef0900ce3180ca1639f1544ba068a22b360b591a55efdd3df78e3"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_markdown_parser::syntax::scan_newline_in_inline_list (cyclomatic 21): biome_markdown_parser::syntax::scan_newline_in_inline_list has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/mod.rs"},"region":{"startLine":1781}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cdb9804fd0ca5c3f9da821d3d3aeff38640b9e9eb53c0fedb8442dc6c8f33f7"}},{"ruleId":"D1","level":"warning","message":{"text":"RuleMover::run (cyclomatic 21): RuleMover::run has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_migrate/src/analyzers/rule_mover.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d6983d2ba6279a98f7b0f8f01678a083e855fb0ccfcdd8b2f13991b072e386f"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_ungrammar::lexer::advance (cyclomatic 21): biome_ungrammar::lexer::advance 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/biome_ungrammar/src/lexer.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db195a48947104272cbd0592c939293e1b2ab49c19055be6700203655f3ccf5"}},{"ruleId":"D1","level":"warning","message":{"text":"GlobalBuilder::try_lower_member (cyclomatic 21): GlobalBuilder::try_lower_member 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":"xtask/codegen/src/generate_global_types/lower/generic.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2872f03b84512d8adb9a290262794950ca5dd885695e7c591eb1384d56d26c4"}},{"ruleId":"D1","level":"warning","message":{"text":"RecessOrderMember::kind (cyclomatic 20): RecessOrderMember::kind has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_analyze/src/assist/source/use_sorted_properties.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbf3431628eef9fdee168a140b27f37e91271af24a73bef8e68f22e9cf983b05"}},{"ruleId":"D1","level":"warning","message":{"text":"EmbeddedBindingsBuilder::visit_define_props_call (cyclomatic 20): EmbeddedBindingsBuilder::visit_define_props_call 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/biome_embeds/src/visitor.rs"},"region":{"startLine":1503}}}],"partialFingerprints":{"codehealthFindingId/v1":"26f96896eef5ffc0b381efa417215ad6a19f72879c3c3b8c5d5e1e3401cbf9b5"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_grit_patterns::grit_query::extract_anchor_kinds (cyclomatic 20): biome_grit_patterns::grit_query::extract_anchor_kinds has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_patterns/src/grit_query.rs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"6148913cb86ce4c64aa66597a11c786aa220b1cd31debfb056434778b2e0e57a"}},{"ruleId":"D1","level":"warning","message":{"text":"NumberLiteral::try_from (cyclomatic 20): NumberLiteral::try_from 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/biome_js_analyze/src/lint/complexity/use_simple_number_keys.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"186c91c244d27b9bf672eb67c6e78393f58bb22ea1c4013894d28d7c3b6ad081"}},{"ruleId":"D1","level":"warning","message":{"text":"NoUnusedVariables::run (cyclomatic 20): NoUnusedVariables::run has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/no_unused_variables.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c84d2f5f844288711270c3ab42a4d34f238b8867529c46d0dffdae1da141cb9"}},{"ruleId":"D1","level":"warning","message":{"text":"UseValidForDirection::run (cyclomatic 20): UseValidForDirection::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/biome_js_analyze/src/lint/correctness/use_valid_for_direction.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca8aa62ca27418560aab1258e82096aff37e91be216bbed0ff9af8a33d798db"}},{"ruleId":"D1","level":"warning","message":{"text":"NoTripleSlashReference::run (cyclomatic 20): NoTripleSlashReference::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/biome_js_analyze/src/lint/nursery/no_triple_slash_reference.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5682c73d6e271518b4b850091f59a94509ef9f6d57971ee85ef76872ba4fa3c"}},{"ruleId":"D1","level":"warning","message":{"text":"Function::evaluate (cyclomatic 20): Function::evaluate 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/biome_js_analyze/src/lint/nursery/use_atomic_updates.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"9074e925837b9808a9c302006874a55356ec44a51e2c3fc0d446574ad54b9f9f"}},{"ruleId":"D1","level":"warning","message":{"text":"UseVueValidDefineProps::run (cyclomatic 20): UseVueValidDefineProps::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/biome_js_analyze/src/lint/nursery/use_vue_valid_define_props.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"860c9da3aa758d0ce782cce2f20e393190134703cf9e97b66fe6b65a7f754a07"}},{"ruleId":"D1","level":"warning","message":{"text":"NoDuplicateEnumValues::run (cyclomatic 20): NoDuplicateEnumValues::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/biome_js_analyze/src/lint/suspicious/no_duplicate_enum_values.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c10a352f33ef8a7148bf0abe36845ef9e424505c5ece2086cf1fad35c841b5"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::lint::correctness::no_unused_variables::suggested_fix_if_unused (cyclomatic 20): biome_js_analyze::lint::correctness::no_unused_variables::suggested_fix_if_unused 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/biome_js_analyze/src/lint/correctness/no_unused_variables.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccab9d223710f3ef83b703cdcd916649c60a76937015d9c3f0ca9fa3213d39b6"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::use_math_trunc::is_side_effect_free (cyclomatic 20): biome_js_analyze::lint::nursery::use_math_trunc::is_side_effect_free has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_math_trunc.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b44af93fe2fc04b37d17c792847bfe6c752f311366e690f2efbc74cdb877357"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::use_object_from_entries::reduce_entry (cyclomatic 20): biome_js_analyze::lint::nursery::use_object_from_entries::reduce_entry 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/biome_js_analyze/src/lint/nursery/use_object_from_entries.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eac16c94caabfd6643a436afac55bf2de7d4f48ac15c3e059ffc12570975731"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::use_object_from_entries::loop_object_statement (cyclomatic 20): biome_js_analyze::lint::nursery::use_object_from_entries::loop_object_statement has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_object_from_entries.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"e466f3d55aeabd3750e67d323a479d41553fa8a0e2d66a30c873d76e6ec48818"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::use_promise_reject_errors::could_be_error (cyclomatic 20): biome_js_analyze::lint::nursery::use_promise_reject_errors::could_be_error has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_promise_reject_errors.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"491d476f0476573369c46b9720380c0ec235e850442c91d1ee3ef93289ffb1b6"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::lint::suspicious::no_then_property::process_js_call_expr (cyclomatic 20): biome_js_analyze::lint::suspicious::no_then_property::process_js_call_expr 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/biome_js_analyze/src/lint/suspicious/no_then_property.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"d230fda355780a59b27c4122549daa6e306a1d2e9de412065b07f7d00cb400f0"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_formatter::comments::handle_class_comment (cyclomatic 20): biome_js_formatter::comments::handle_class_comment 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/biome_js_formatter/src/comments.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"a86517ab9aad698589815e1b31a940eb13642a3e71c92aaf024fd183333881b5"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_parser::syntax::class::parse_class_member_impl (cyclomatic 20): biome_js_parser::syntax::class::parse_class_member_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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_parser/src/syntax/class.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"d97d9c1becb2b98329d38af167cc901bf88e69703dea6b157f887eeae72d42d9"}},{"ruleId":"D1","level":"warning","message":{"text":"AssignabilityCheck::is_structurally_assignable (cyclomatic 20): AssignabilityCheck::is_structurally_assignable 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/biome_js_type_info/src/type_relation.rs"},"region":{"startLine":1783}}}],"partialFingerprints":{"codehealthFindingId/v1":"049834f4c409f8a13497c72640810dcf357f006cdd8637c612d469f1fd0d8205"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_type_info::return_type_relation::is_nonunion_wider (cyclomatic 20): biome_js_type_info::return_type_relation::is_nonunion_wider 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/biome_js_type_info/src/return_type_relation.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"23cd4eb004942d8ffa048aa47020f6ab2bf88ce6f9f3cae87f12cc6753b0511f"}},{"ruleId":"D1","level":"warning","message":{"text":"ResolutionCtx::resolve_static_member_expression (cyclomatic 20): ResolutionCtx::resolve_static_member_expression 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: ResolutionCtx::resolve_inferred_typeof_expression (cyclomatic 26) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":1646}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fcd57e37e6db331afccd1efa5bb114d1ffd6224f1f87666798e79f031890c2f"}},{"ruleId":"D1","level":"warning","message":{"text":"JsModuleInfoCollector::infer_type (cyclomatic 20): JsModuleInfoCollector::infer_type 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/biome_module_graph/src/js_module_info/collector.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"8535f5269bbb479a838b59b52015323d7362e6edb6a0798f83d2da2a6e5cfd48"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkspaceServerWithDb::update_settings (cyclomatic 20): WorkspaceServerWithDb::update_settings 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/biome_service/src/workspace/server.rs"},"region":{"startLine":2985}}}],"partialFingerprints":{"codehealthFindingId/v1":"58182beec46ab1d212b77a322704ac8dda50192486ea821311d32f8109b36da0"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_service::file_handlers::html::format_embedded (cyclomatic 20): biome_service::file_handlers::html::format_embedded has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/html.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"864619f6e676f5737dac69e8916c4344a6e5d5ae4188131f83eda091f1a07e53"}},{"ruleId":"D1","level":"warning","message":{"text":"Collector::collect_macro (cyclomatic 20): Collector::collect_macro 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/biome_vue_semantic/src/semantic_model/component.rs"},"region":{"startLine":1961}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d64bf2ac6038a166830e02ad19313c487302e35d21a29c55a02652c0f5c256b"}},{"ruleId":"D1","level":"warning","message":{"text":"FormatYamlDocument::fmt_fields (cyclomatic 20): FormatYamlDocument::fmt_fields 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/biome_yaml_formatter/src/yaml/auxiliary/document.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea94a9ce29571526fc35cc9b723fa0c4b73f8d57db19fecee2909bb7435e53a"}},{"ruleId":"D1","level":"warning","message":{"text":"YamlLexer::consume_tokens (cyclomatic 20): YamlLexer::consume_tokens has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_yaml_parser/src/lexer/mod.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"16b08b69dcb32b70e1a0245912b128abc4fa2ea15cff951aed54b5ad4f4fe8a5"}},{"ruleId":"D1","level":"warning","message":{"text":"YamlLexer::consume_block_properties (cyclomatic 20): YamlLexer::consume_block_properties 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/biome_yaml_parser/src/lexer/mod.rs"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d2d290d58f242648ba94b7681b46b85e8856bc0db5575fcd6587ef3edf5117"}},{"ruleId":"D1","level":"warning","message":{"text":"xtask_codegen::generate_schema::rename_references_in_object (cyclomatic 20): xtask_codegen::generate_schema::rename_references_in_object 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":"xtask/codegen/src/generate_schema.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"66e60560975167e3fb385825766bbe54fad909053dea9a9cb9f33405ec759455"}},{"ruleId":"D1","level":"warning","message":{"text":"App.App (cyclomatic 20): App.App has cyclomatic complexity 20 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 6 belong to 3 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/prettier-compare/src/components/App.tsx"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d9bd8f32c42ad8f63044c9ecf305384957948b9b3a11e0fe263dc75764418b"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_deserialize::yaml::block_scalar::block_scalar_value (cyclomatic 19): biome_deserialize::yaml::block_scalar::block_scalar_value 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/biome_deserialize/src/yaml/block_scalar.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4964c54b30ca9861144df339877764078bc9f7dd6778cad84c9863ad219c72f"}},{"ruleId":"D1","level":"warning","message":{"text":"StructFieldAttrs::try_from (cyclomatic 19): StructFieldAttrs::try_from 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/biome_deserialize_macros/src/deserializable_derive/struct_field_attrs.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f02b29732c38a0c6e08e988b7b26c9334f71b5cd4256d48d9b1b9442bfc321"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_diagnostics::display::frame::print_invisibles (cyclomatic 19): biome_diagnostics::display::frame::print_invisibles has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: biome_diagnostics::display::frame::show_invisible_char (cyclomatic 26) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_diagnostics/src/display/frame.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"33da99f4648712540cad5dd1970ce1e5f6696fadbfb6c25374914d1757613124"}},{"ruleId":"D1","level":"warning","message":{"text":"EmbeddedBindingsBuilder::visit_js_export (cyclomatic 19): EmbeddedBindingsBuilder::visit_js_export 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/biome_embeds/src/visitor.rs"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6b2ec1941b5f191931522e617e41c61ebacb1b72cc9ed9998bbf23937f4c90a"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_html_formatter::utils::css_display::get_css_display (cyclomatic 19): biome_html_formatter::utils::css_display::get_css_display has cyclomatic complexity 19 (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/biome_html_formatter/src/utils/css_display.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee265811bb5c8fa7437a3274937cd5acd030066cd74c9e0cadc2189f6a9e24d"}},{"ruleId":"D1","level":"warning","message":{"text":"LogicalAndChain::optional_chain_expression_nodes_from_negated_or (cyclomatic 19): LogicalAndChain::optional_chain_expression_nodes_from_negated_or 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/biome_js_analyze/src/lint/complexity/use_optional_chain.rs"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"48734eed7c73746e72626c6fd2b4179a4b99b29c2ec2d00fa5af4f4edb0f16a7"}},{"ruleId":"D1","level":"warning","message":{"text":"UseExhaustiveSwitchCases::run (cyclomatic 19): UseExhaustiveSwitchCases::run has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_exhaustive_switch_cases.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc804b6565b9513b1d50fda76b048b7c4510db99c8ce0e5475ff34fdeeabf3ca"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::lint::correctness::use_exhaustive_dependencies::is_stable_expression (cyclomatic 19): biome_js_analyze::lint::correctness::use_exhaustive_dependencies::is_stable_expression 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/biome_js_analyze/src/lint/correctness/use_exhaustive_dependencies.rs"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd57fdeb30314f6202dd94935d3d4fcc78930c13bbb12d255b3e201af3ec92d"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::lint::correctness::use_import_extensions::get_extensionless_import (cyclomatic 19): biome_js_analyze::lint::correctness::use_import_extensions::get_extensionless_import 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/biome_js_analyze/src/lint/correctness/use_import_extensions.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae9c84169d62231fd24f5787c7e9899d4363e2163e95bfd4c2eae584d9d7386c"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::use_vue_slots_as_functions::is_used_as_value (cyclomatic 19): biome_js_analyze::lint::nursery::use_vue_slots_as_functions::is_used_as_value has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_vue_slots_as_functions.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cfca536a3260563fec79d78dc809c1b181111019a7b9a24f01916578eacb8ca"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::lint::suspicious::no_control_characters_in_regex::collect_control_characters (cyclomatic 19): biome_js_analyze::lint::suspicious::no_control_characters_in_regex::collect_control_characters 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/biome_js_analyze/src/lint/suspicious/no_control_characters_in_regex.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"161212b22c7cc3182524e31ca697ebe2fb84ad5e6bc211406d7bad27720388b3"}},{"ruleId":"D1","level":"warning","message":{"text":"JsFormatSyntaxRewriter::visit_parenthesized (cyclomatic 19): JsFormatSyntaxRewriter::visit_parenthesized 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/biome_js_formatter/src/syntax_rewriter.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a53500170693ab72684e6920bf02379f5420d82ee9a5b24a26bd8b057d0bc96"}},{"ruleId":"D1","level":"warning","message":{"text":"FormatJsAnyConditionalRule::fmt (cyclomatic 19): FormatJsAnyConditionalRule::fmt 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/biome_js_formatter/src/utils/conditional.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"72bdcd82052499a35b2f4f4087dafd8bb27943d44f408ba54a9e8cb88bd17105"}},{"ruleId":"D1","level":"warning","message":{"text":"JsSemanticModel::init (cyclomatic 19): JsSemanticModel::init 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/biome_js_runtime/src/semantic.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbcc05c16dba1042047e63022e14fefb6d46ff0ef51efd9ca581cded4124583e"}},{"ruleId":"D1","level":"warning","message":{"text":"SemanticEventExtractor::enter_identifier_reference (cyclomatic 19): SemanticEventExtractor::enter_identifier_reference 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/biome_js_semantic/src/events.rs"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ac3182d780530f42fb4caa064f845f389c0f2ce5ed7c1a79833ed7bb9e22bf"}},{"ruleId":"D1","level":"warning","message":{"text":"JsDeclarationKind::from_node (cyclomatic 19): JsDeclarationKind::from_node has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: TsBindingReference::union_with (cyclomatic 21) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_semantic/src/semantic_model/binding.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"2193b3636aa22e716b81723197d8798535ef8c5f1814e2bb4e746246c39c4911"}},{"ruleId":"D1","level":"warning","message":{"text":"AnyJsParameterList::try_merge (cyclomatic 19): AnyJsParameterList::try_merge has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: AnyTsType::is_type_equal (cyclomatic 37) 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/biome_js_analyze/src/lint/style/use_unified_type_signatures.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"045ff40fa065439a3f74b789256fe7d9495c83154a1ebcc2b7cbf41840be27cb"}},{"ruleId":"D1","level":"warning","message":{"text":"InferredType::is_at_least_as_wide_as_object (cyclomatic 19): InferredType::is_at_least_as_wide_as_object 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/biome_js_type_info/src/inferred_type.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"526f0bfab04495a2c32f2f30694955e14894f36a092167b677db8740819656e9"}},{"ruleId":"D1","level":"warning","message":{"text":"BiomeManifest::validate (cyclomatic 19): BiomeManifest::validate has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_manifest/src/lib.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a9eb6320518c138baa5b0a28c7fa512ae83fe7307dea8c7514bd608d68e200"}},{"ruleId":"D1","level":"warning","message":{"text":"FormatMdBlockList::fmt (cyclomatic 19): FormatMdBlockList::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/biome_markdown_formatter/src/markdown/lists/block_list.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed52f7bac7c66bbe94d3e3b5629f62a40dc1fe27a0e265e8fd9e7cf158ed2c8"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_markdown_parser::syntax::inline::links::parse_inline_link_destination_tokens (cyclomatic 19): biome_markdown_parser::syntax::inline::links::parse_inline_link_destination_tokens 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/biome_markdown_parser/src/syntax/inline/links.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"31147b54ed4f7b1f2816d2f37730e2dfbdd1e3d19ecc77ca0abdc0327db037f3"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_markdown_parser::syntax::list::parse_continuation_block (cyclomatic 19): biome_markdown_parser::syntax::list::parse_continuation_block 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/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":2935}}}],"partialFingerprints":{"codehealthFindingId/v1":"31944b1bc812d904c679d07960e8cd298d3554b083d9431d0302f0af780aca07"}},{"ruleId":"D1","level":"warning","message":{"text":"StatementCheck::statement (cyclomatic 19): StatementCheck::statement 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/biome_module_graph/src/js_module_info/flow/builder.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d16d6c982a23610be572ba940f1b9d501d2388d1b6f096602267734a44fb09"}},{"ruleId":"D1","level":"warning","message":{"text":"GuardFunctions::guard (cyclomatic 19): GuardFunctions::guard 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/biome_module_graph/src/js_module_info/flow/guards.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"787bb2660a7fe4b7db0c1d7059403d8e4862e0d174578b524a8679bf73fa748d"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_module_graph::js_module_info::flow::guards::comparison_step (cyclomatic 19): biome_module_graph::js_module_info::flow::guards::comparison_step 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/biome_module_graph/src/js_module_info/flow/guards.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb07d468d450c3254e7f4518256e44ebaf354d848764fe9dd6e4f7182ad9d4b"}},{"ruleId":"D1","level":"warning","message":{"text":"Settings::apply_configuration (cyclomatic 19): Settings::apply_configuration 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/biome_service/src/settings.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a026acc6deb99567e72a50ac74ed18172a4aa33386260f311adff8190b53a9"}},{"ruleId":"D1","level":"warning","message":{"text":"Collator::cmp (cyclomatic 19): Collator::cmp 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/biome_string_case/src/lib.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec89d520c946c4e9b96c22630b4ffec3d7c5fc141271b621e293ca4b3af49b6"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_vue_semantic::semantic_model::references::collect_markup_references (cyclomatic 19): biome_vue_semantic::semantic_model::references::collect_markup_references 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/biome_vue_semantic/src/semantic_model/references.rs"},"region":{"startLine":1249}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ddfbe11c3e80b00d5717cad269af2181beba36b48e9471544f0b5d1f1cc91c8"}},{"ruleId":"D1","level":"warning","message":{"text":"FormatYamlBlockContent::fmt_fields (cyclomatic 19): FormatYamlBlockContent::fmt_fields 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/biome_yaml_formatter/src/yaml/auxiliary/block_content.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c626c02f8d83694b7a5bb58df0eb1d862c4a0b3b3a7b3a865e556e135f063d"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_yaml_formatter::comments::handle_own_line_comment (cyclomatic 19): biome_yaml_formatter::comments::handle_own_line_comment 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/biome_yaml_formatter/src/comments.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb1d81d49c34a14ba26536a3ed00c73968ead7810cb9b6d362d4fbf4490eaba"}},{"ruleId":"D1","level":"warning","message":{"text":"YamlLexer::consume_plain_literal (cyclomatic 19): YamlLexer::consume_plain_literal 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/biome_yaml_parser/src/lexer/mod.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2aebffd114f4608327d3be964124cfe50c0d9649b0a38be14a0704518ed5ede"}},{"ruleId":"D1","level":"warning","message":{"text":"YamlLexer::consume_tag_property (cyclomatic 19): YamlLexer::consume_tag_property 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/biome_yaml_parser/src/lexer/mod.rs"},"region":{"startLine":1290}}}],"partialFingerprints":{"codehealthFindingId/v1":"649523ee1b328a25ac898004d2d1e5af6482826e01f05fa8a17a537516e649e7"}},{"ruleId":"D1","level":"warning","message":{"text":"parseAriaSpec (cyclomatic 19): parseAriaSpec has cyclomatic complexity 19 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/aria-data/generate-aria-data.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"a17a150ba2a1590eadda724d728fac637405e01a2f9f174b1f5d3156d185cbe2"}},{"ruleId":"D1","level":"warning","message":{"text":"Suppressions::suppresses (cyclomatic 18): Suppressions::suppresses 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/biome_analyze/src/suppressions.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"112d19c1a67636e0c4f411e17bd067179eb2d31543d4afff6fc15d51ffda21e1"}},{"ruleId":"D1","level":"warning","message":{"text":"RuleSelector::from_str (cyclomatic 18): RuleSelector::from_str 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/biome_configuration/src/analyzer/mod.rs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f96a7e63fd2b857d88fd28185c6e8ffa2a7794260cac79e9bdd2e095059369"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_css_formatter::utils::component_value_list::write_component_value_list (cyclomatic 18): biome_css_formatter::utils::component_value_list::write_component_value_list 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/biome_css_formatter/src/utils/component_value_list.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"381ba5bf49e82aa0a2f1a6f4db70d0ae9833c1f4b7ef7e1e545c0f0953bd61b9"}},{"ruleId":"D1","level":"warning","message":{"text":"DecodedCursor::next (cyclomatic 18): DecodedCursor::next 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/biome_css_syntax/src/css_escape.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"377898fcd59179bf32f53271ea465a09260e5a03207791cbc722e8b6c04b9d16"}},{"ruleId":"D1","level":"warning","message":{"text":"ContainerAttrs::try_from (cyclomatic 18): ContainerAttrs::try_from has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_deserialize_macros/src/deserializable_derive/container_attrs.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec30547ced2327bd95a77fbc63841fe141a01d951e313a4d36f41e131de54652"}},{"ruleId":"D1","level":"warning","message":{"text":"GritLexer::consume_string_literal (cyclomatic 18): GritLexer::consume_string_literal has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: GritLexer::lex_token (cyclomatic 30) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_parser/src/lexer/mod.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b67c61c5c1e12448572c3ea7ae738c0e19ee6737693947e288e88c000e07d8"}},{"ruleId":"D1","level":"warning","message":{"text":"UseVueValidVSlot::run (cyclomatic 18): UseVueValidVSlot::run has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/nursery/use_vue_valid_v_slot.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0d5d4f1b18615735fa7063c0ed5ca758118da5713acc4e5ce77968bf2dc8f5"}},{"ruleId":"D1","level":"warning","message":{"text":"HtmlSplitChunksIterator::next (cyclomatic 18): HtmlSplitChunksIterator::next 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/biome_html_formatter/src/utils/children.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b925281ba334364769722f1a122c7c857b14678972d1c5e6e06b07bfb185a61"}},{"ruleId":"D1","level":"warning","message":{"text":"Accesses::add_binding (cyclomatic 18): Accesses::add_binding 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/biome_js_analyze/src/lint/nursery/no_useless_assignment.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d8b86451b16bff6d2ca35e04ab964ebc526769bf909cfae9844c92ee2799d1f"}},{"ruleId":"D1","level":"warning","message":{"text":"UseConsistentFunctionStyle::run (cyclomatic 18): UseConsistentFunctionStyle::run has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_consistent_function_style.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"323ba74633eeaabb5e9694569fb9859cebb6d16d93f63010fe8ee6f59e55475a"}},{"ruleId":"D1","level":"warning","message":{"text":"NoLeakedRender::run (cyclomatic 18): NoLeakedRender::run has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/no_leaked_render.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"c28080d75335087581155b82618c4945deca42391224baad39016c658a25cdba"}},{"ruleId":"D1","level":"warning","message":{"text":"MissingAwaitVisitor::visit (cyclomatic 18): MissingAwaitVisitor::visit 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/biome_js_analyze/src/lint/suspicious/use_await.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a8c7a299e19057ecd886fd1962caa849986b0ab4b3f5ce3ea49b7ed931dffd"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::ast_utils::is_logical_identity (cyclomatic 18): biome_js_analyze::ast_utils::is_logical_identity 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/biome_js_analyze/src/ast_utils.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa18224b3deaac252e2bcddcb747f842062b754e6a25f54c084c77f8f087c12"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::no_single_promise_in_promise_methods::unwrapped_all_target (cyclomatic 18): biome_js_analyze::lint::nursery::no_single_promise_in_promise_methods::unwrapped_all_target 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/biome_js_analyze/src/lint/nursery/no_single_promise_in_promise_methods.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc2b0ac90759dde4253fc2a0edfa3704e3341c263c8d6e34ce4f12b3db370377"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::use_object_from_entries::is_typed_array (cyclomatic 18): biome_js_analyze::lint::nursery::use_object_from_entries::is_typed_array has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_object_from_entries.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"4289f3d7bb004aacc6270901f7940ccfb62c3de6751350c231945c62eae4ce88"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::use_valid_character_comparison::is_longer_than_one_code_unit (cyclomatic 18): biome_js_analyze::lint::nursery::use_valid_character_comparison::is_longer_than_one_code_unit 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/biome_js_analyze/src/lint/nursery/use_valid_character_comparison.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2aa08937e5613a0bc98a7055a4669314c629c101814ac9afa24757274c23027"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::lint::style::use_template::template_expression_from_binary_expression (cyclomatic 18): biome_js_analyze::lint::style::use_template::template_expression_from_binary_expression has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_template.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1239f121994bbb7ab969f7394f8cc813ad025d7056f16c5b3056712e3fc2234"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::lint::suspicious::no_parameters_only_used_in_recursion::traces_to_parameter (cyclomatic 18): biome_js_analyze::lint::suspicious::no_parameters_only_used_in_recursion::traces_to_parameter 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/biome_js_analyze/src/lint/suspicious/no_parameters_only_used_in_recursion.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a8df8669ae8033f011be445be826cc324b77b219985997b79ef6492396075a"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_formatter::comments::handle_if_statement_comment (cyclomatic 18): biome_js_formatter::comments::handle_if_statement_comment has cyclomatic complexity 18 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/comments.rs"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"928b7d6baa8f0a7362b35d0adfbb7c8dde9ab52e2b37a5b364475ddbf9eb2c23"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_formatter::js::bindings::parameters::should_hug_function_parameters (cyclomatic 18): biome_js_formatter::js::bindings::parameters::should_hug_function_parameters has cyclomatic complexity 18 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 9 belong to one function item inside it that branches. 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/biome_js_formatter/src/js/bindings/parameters.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffafafb8d242984f7e7207f3729f133fabdc411ef9643a6a132fe10aec0e70ae"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_formatter::js::classes::property_class_member::needs_semicolon (cyclomatic 18): biome_js_formatter::js::classes::property_class_member::needs_semicolon has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/js/classes/property_class_member.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"28953f05486e7e32136e193d4e754c72786add44caefea1ffd1aba7d022dc64d"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_formatter::js::expressions::call_arguments::is_relatively_short_argument (cyclomatic 18): biome_js_formatter::js::expressions::call_arguments::is_relatively_short_argument 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/biome_js_formatter/src/js/expressions/call_arguments.rs"},"region":{"startLine":1109}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e7fe3604ceb47a5872a003267f388e8a9b94b99f6b2682617d794ea642bd30"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_formatter::js::expressions::call_arguments::can_group_expression_argument (cyclomatic 18): biome_js_formatter::js::expressions::call_arguments::can_group_expression_argument has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/js/expressions/call_arguments.rs"},"region":{"startLine":1178}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fcdf9ce05157b2610be64dbb280d36ca6b517e82c9cab6a554542e2bbda886f"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_parser::syntax::module::parse_import_clause (cyclomatic 18): biome_js_parser::syntax::module::parse_import_clause 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/biome_js_parser/src/syntax/module.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1cbe5bd17ba2f7957cba076ccb3351f0f1eba51bd06077de21258a1658b772f"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_parser::syntax::module::parse_export_default_clause (cyclomatic 18): biome_js_parser::syntax::module::parse_export_default_clause has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_parser/src/syntax/module.rs"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"d782214fbe17d373da840b44eec293c8d4fed77e7d5cb22aa3f98fd744943a6b"}},{"ruleId":"D1","level":"warning","message":{"text":"JsAstNode::update_field (cyclomatic 18): JsAstNode::update_field 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/biome_js_runtime/src/ast.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"df97edbf28c494825e8319432bf619d8a4e75861c5eb30c48bf83ba28d135e9f"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeData::conditional_type_shallow (cyclomatic 18): TypeData::conditional_type_shallow has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: TypeData::type_description (cyclomatic 40) 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/biome_js_type_info/src/interned_types.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a70c2e2bdd77012662662f2126a9d5217ea257ac10d944922debe4a8435135"}},{"ruleId":"D1","level":"warning","message":{"text":"StringificationAnalyzer::is_ignored_type (cyclomatic 18): StringificationAnalyzer::is_ignored_type has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/stringification.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ead110dd79d40919674c9451b6d30476f9614c795511eba5c42ec30f7b2353b"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_lsp::utils::code_fix_to_lsp (cyclomatic 18): biome_lsp::utils::code_fix_to_lsp 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/biome_lsp/src/utils.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ad1e6d340f4711c9e71264f9d8e1ed81dd91dc373ceb385accfc35ccb30d8f"}},{"ruleId":"D1","level":"warning","message":{"text":"ProseItemCollector::collect (cyclomatic 18): ProseItemCollector::collect has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_formatter/src/words.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fb48a301903efada0c9fa1ea5b85d3a0f7ddc3f1c7fa0ed259fad01246f179d"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_markdown_parser::syntax::at_unindented_block_interrupt (cyclomatic 18): biome_markdown_parser::syntax::at_unindented_block_interrupt has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/mod.rs"},"region":{"startLine":2058}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca9359c0274ccae967ba8dd7621dae0adc08dc3f72312d0967d3ba659d766f66"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_markdown_parser::syntax::list::parse_bullet (cyclomatic 18): biome_markdown_parser::syntax::list::parse_bullet 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/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad3a4c6464ca47dd18fb2ef5e01f1816f6cc9a29a7cd45bd87111675915e7f58"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_markdown_parser::syntax::list::handle_first_line_marker_only (cyclomatic 18): biome_markdown_parser::syntax::list::handle_first_line_marker_only 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/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":2126}}}],"partialFingerprints":{"codehealthFindingId/v1":"6925a6dcf09545e052ece894771c4f8c04d2b02b43a32ae22b8f905a1f64ccb9"}},{"ruleId":"D1","level":"warning","message":{"text":"FlowRootScanner::enter (cyclomatic 18): FlowRootScanner::enter 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/biome_module_graph/src/js_module_info/flow/scanner.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c8dc29839fd35660e261fc02afc2e438defad228aeb309505211f9e6b92fe3"}},{"ruleId":"D1","level":"warning","message":{"text":"JsModuleVisitor::visit_binding_pattern (cyclomatic 18): JsModuleVisitor::visit_binding_pattern 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/biome_module_graph/src/js_module_info/visitor.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"13508631febde6cf2dbf63cd109215219526b489519c36abd8069cf2018e20a4"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_module_graph::db::queries::find_js_exported_symbol (cyclomatic 18): biome_module_graph::db::queries::find_js_exported_symbol 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/biome_module_graph/src/db/queries.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e548b5f2b16888cbb245c3dc42428b5635c949e1ab2c1b7271a5e45f245d9c"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_module_graph::db::queries::type_inference::calls::implementation::matched_parameter_types (cyclomatic 18): biome_module_graph::db::queries::type_inference::calls::implementation::matched_parameter_types 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/biome_module_graph/src/db/queries/type_inference/calls/implementation.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"79034524c5642ed3ef08640662cff8fa99b516789c50171848e191ad8eef79ce"}},{"ruleId":"D1","level":"warning","message":{"text":"TurboJson::env_vars_cache (cyclomatic 18): TurboJson::env_vars_cache has cyclomatic complexity 18 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_package/src/node_js_package/turbo_json.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e413a3b4835e73aaeddfa9a48b1e5b42f165d4f9f2be81215617adce1f17abb"}},{"ruleId":"D1","level":"warning","message":{"text":"ProjectScanComputer::compute (cyclomatic 18): ProjectScanComputer::compute 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/biome_service/src/configuration.rs"},"region":{"startLine":1696}}}],"partialFingerprints":{"codehealthFindingId/v1":"b535fb773f7d0093d6db8cb92ba9c62f8166ff1490b1b2d640c14e7b59d4fd35"}},{"ruleId":"D1","level":"warning","message":{"text":"OverrideSettingPattern::apply_overrides_to_js_format_options (cyclomatic 18): OverrideSettingPattern::apply_overrides_to_js_format_options 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/biome_service/src/settings.rs"},"region":{"startLine":2096}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59a54854aedf8a98e3ce180907749a6a5e8a9fd33286fe7d399126cbcdf6d80"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkspaceServerWithDb::process_file (cyclomatic 18): WorkspaceServerWithDb::process_file has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/workspace/server.rs"},"region":{"startLine":3591}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcf988a96079c4ba265762f14d43ec42efcd83ffd8ac2a256e803cf22ca23ba0"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_service::workspace_types::instance_type (cyclomatic 18): biome_service::workspace_types::instance_type 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/biome_service/src/workspace_types.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"55dee6c91c6a88dab03be69da6bbd06767bbde807ea8383e63aac184be45dee1"}},{"ruleId":"D1","level":"warning","message":{"text":"DisplayProfiles::fmt (cyclomatic 17): DisplayProfiles::fmt has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_analyze/src/profiling.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a637ada4728208998ee8adaae5371a6b086060fe5afb2346698568410acd7f1"}},{"ruleId":"D1","level":"warning","message":{"text":"DefaultFinalizer::finalize (cyclomatic 17): DefaultFinalizer::finalize 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/biome_cli/src/runner/impls/finalizers/default.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa6c083e6690eab323fa61bb5f3ec4273ca58ccbba1bd1295c6ff8b201298f3"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorConfig::from_str (cyclomatic 17): EditorConfig::from_str 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/biome_configuration/src/editorconfig.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"05bd2bc1f274b7dc711682613032fd6ca926c1998fef077c0864e1b0ccc3bf68"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_css_analyze::fonts::find_font_family (cyclomatic 17): biome_css_analyze::fonts::find_font_family 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/biome_css_analyze/src/fonts.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"44dcf85e3053084edd8b4d3505a7f897889b2f653d8d29b5c5e42c35346a2b17"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_css_analyze::lint::nursery::use_logical_properties::merge_longhands_violation (cyclomatic 17): biome_css_analyze::lint::nursery::use_logical_properties::merge_longhands_violation 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/biome_css_analyze/src/lint/nursery/use_logical_properties.rs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b7652d2f61bf167a3acb25c79f9338a17349d36c119d9f00e1261e0ecf6752"}},{"ruleId":"D1","level":"warning","message":{"text":"CssLexer::consume_slash (cyclomatic 17): CssLexer::consume_slash 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: CssLexer::consume_identifier_with_slash (cyclomatic 242) 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/biome_css_parser/src/lexer/mod.rs"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f752adf5b5e7a0d645a73bd09bafa422c4813e79f8971c5452fbfcf499ddd06"}},{"ruleId":"D1","level":"warning","message":{"text":"CssScanCursor::consume_scss_interpolation_in_raw_url (cyclomatic 17): CssScanCursor::consume_scss_interpolation_in_raw_url has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_parser/src/lexer/scan_cursor.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c92a8296f3b69008f1cd1fa6e0de9c52ddddfa347d9a2175937c7e59e518a7"}},{"ruleId":"D1","level":"warning","message":{"text":"SemanticEventExtractor::process_at_property (cyclomatic 17): SemanticEventExtractor::process_at_property 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/biome_css_semantic/src/events.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd043eed3492e8c322d9579146aa2b8a36ec6ed6c5cac6ac5acd49c15875ea4"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_deserialize::json::unescape_json_string (cyclomatic 17): biome_deserialize::json::unescape_json_string has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_deserialize/src/json.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ffbccadd2891247328c6d1143be31b689291d7163bec97afb6f8cdf495f65e"}},{"ruleId":"D1","level":"warning","message":{"text":"Printer::print_fill_entries (cyclomatic 17): Printer::print_fill_entries 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/biome_formatter/src/printer/mod.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e8ea3efca55897137c5a9b671008afc8909627e477c96fb85c112a4a794c5c1"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_html_analyze::lint::a11y::use_heading_content::has_accessible_content (cyclomatic 17): biome_html_analyze::lint::a11y::use_heading_content::has_accessible_content 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/biome_html_analyze/src/lint/a11y/use_heading_content.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b224637c9c2ac246f6877783cb2d977be8b3dc3e502a73400a497828d4a584a"}},{"ruleId":"D1","level":"warning","message":{"text":"FormatHtmlAttributeList::fmt (cyclomatic 17): FormatHtmlAttributeList::fmt has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_formatter/src/html/lists/attribute_list.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b54fd18e5e1526a37d7e689c0487a15f0225b6b8723a31253f508a9b240d50a"}},{"ruleId":"D1","level":"warning","message":{"text":"NoVoidElementsWithChildren::action (cyclomatic 17): NoVoidElementsWithChildren::action 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/biome_js_analyze/src/lint/correctness/no_void_elements_with_children.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"de2bffcd897dbe5c4381d1b4e39b7d6124ff8a2753ea7dfd8f3aa1b68dc2dccb"}},{"ruleId":"D1","level":"warning","message":{"text":"Function::check_writes (cyclomatic 17): Function::check_writes 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/biome_js_analyze/src/lint/nursery/use_atomic_updates.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"9454d7aede6d0ebc38cb71d5e26a9c0a856294f5a214597016b7c36ad1a6da95"}},{"ruleId":"D1","level":"warning","message":{"text":"UseExplicitReturnType::run (cyclomatic 17): UseExplicitReturnType::run 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/biome_js_analyze/src/lint/nursery/use_explicit_return_type.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"af9db5af194c58348ec9035da9a3aba17895082a82f707465ef48bd8064ac48d"}},{"ruleId":"D1","level":"warning","message":{"text":"NoScriptUrl::run (cyclomatic 17): NoScriptUrl::run 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/biome_js_analyze/src/lint/security/no_script_url.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b7f7e47bd56bae55ef803c097d33c6945b449f260cb9b0d2de5a349f4171d5"}},{"ruleId":"D1","level":"warning","message":{"text":"UseDestructuring::run (cyclomatic 17): UseDestructuring::run 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/biome_js_analyze/src/lint/style/use_destructuring.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b2b9e53083d5bd18d507a72b4e3349dd28697955c33c07dee63fa94faa2bdd"}},{"ruleId":"D1","level":"warning","message":{"text":"UseNumberNamespace::action (cyclomatic 17): UseNumberNamespace::action has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_number_namespace.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb7a50ea96af7edc9fc6630acbc8b13e2995e2f0bb58e89b7d46c35d4b36bcb"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::lint::complexity::use_optional_chain::extract_optional_chain_like_typeof (cyclomatic 17): biome_js_analyze::lint::complexity::use_optional_chain::extract_optional_chain_like_typeof has cyclomatic complexity 17 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 8 belong to 2 function items inside it that branch. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/complexity/use_optional_chain.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d60bd91c007b80adac2b05c47d58d881837a417942b3dc0bc05c47843e45368"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::lint::correctness::no_unused_imports::is_unused (cyclomatic 17): biome_js_analyze::lint::correctness::no_unused_imports::is_unused has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/no_unused_imports.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"20f57c23a565bf80547a0779fa3d187718022b9d8cf2f2d0fc3f4de31c96e90a"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::lint::correctness::no_vue_ref_as_operand::track_to_refs_references (cyclomatic 17): biome_js_analyze::lint::correctness::no_vue_ref_as_operand::track_to_refs_references 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/biome_js_analyze/src/lint/correctness/no_vue_ref_as_operand.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7c0fe02b7890c6434d1b294f41f99904a11649643902077f3b2be3fbb7dd19"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::no_misleading_return_type::analysis::misleading_suggestion (cyclomatic 17): biome_js_analyze::lint::nursery::no_misleading_return_type::analysis::misleading_suggestion has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_misleading_return_type/analysis.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"df0e1560daebe7ff66d2fbd87ccd5be4a01088e3ba701da5cdfbddf755d8611a"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::no_null::is_allowed_argument (cyclomatic 17): biome_js_analyze::lint::nursery::no_null::is_allowed_argument has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_null.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f48b865a24e916ecddb2c673ba58d887b5737a8afe79b857d072e143fc1811e"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::no_vue_deprecated_props_default_this::is_member_with_own_this (cyclomatic 17): biome_js_analyze::lint::nursery::no_vue_deprecated_props_default_this::is_member_with_own_this has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_vue_deprecated_props_default_this.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"1792f1aa86c524155dae0f1dfd535501014cedb3d76a9b560886d93888cd88bf"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::use_explicit_return_type::handle_any_function (cyclomatic 17): biome_js_analyze::lint::nursery::use_explicit_return_type::handle_any_function has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_explicit_return_type.rs"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"c46e0972019f9c9ed6285da4afa73885f50f47464d3ad2bd75f943cf4b60bba4"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::use_vue_valid_default_prop::check_default (cyclomatic 17): biome_js_analyze::lint::nursery::use_vue_valid_default_prop::check_default 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/biome_js_analyze/src/lint/nursery/use_vue_valid_default_prop.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bd1f0a71dfc16a9d52029dce696fb3a7597620f7222a5917d76d618d63bf349"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::lint::style::use_consistent_array_type::transform_array_element_type (cyclomatic 17): biome_js_analyze::lint::style::use_consistent_array_type::transform_array_element_type 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/biome_js_analyze/src/lint/style/use_consistent_array_type.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b2ff4d5f7f8d814d38eed3d15fd4d74773cc5ff6766b2d8d170ce6a92e8eb23"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::lint::style::use_consistent_type_definitions::convert_type_alias_to_interface (cyclomatic 17): biome_js_analyze::lint::style::use_consistent_type_definitions::convert_type_alias_to_interface 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/biome_js_analyze/src/lint/style/use_consistent_type_definitions.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a273f21402ca25437b2c6b965995b76875306442d380f99b93975a3d4483a65"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::lint::style::use_literal_enum_members::is_constant_enum_expression (cyclomatic 17): biome_js_analyze::lint::style::use_literal_enum_members::is_constant_enum_expression has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_literal_enum_members.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab6372e8dedc01fc89fa02c51bb1ee6fc73c2c4901d359d8226bdee63e62015"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::lint::suspicious::no_constant_binary_expressions::has_constant_strict_boolean_comparison (cyclomatic 17): biome_js_analyze::lint::suspicious::no_constant_binary_expressions::has_constant_strict_boolean_comparison has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/no_constant_binary_expressions.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"866680619726968c308cc72b8c809dcc393bf0e78e1c6fc7fd35650199de7a55"}},{"ruleId":"D1","level":"warning","message":{"text":"FormatTemplateElement::fmt (cyclomatic 17): FormatTemplateElement::fmt has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/js/auxiliary/template_element.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a3f26c6832e44e54ff694bf5caa576c7dd5a825a957df7787dc7fcbfe15ef4"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_formatter::js::expressions::call_arguments::write_grouped_arguments (cyclomatic 17): biome_js_formatter::js::expressions::call_arguments::write_grouped_arguments has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/js/expressions/call_arguments.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d23ce2a9cb9a2a46bf0ff685e13f870c646c72c9cd80d47c8db7ee86742816"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_formatter::utils::assignment_like::is_poorly_breakable_member_or_call_chain (cyclomatic 17): biome_js_formatter::utils::assignment_like::is_poorly_breakable_member_or_call_chain has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/utils/assignment_like.rs"},"region":{"startLine":1178}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f3a316e579b0f61fd05fc8eb41a1d6cbae88175101b2a202c3e5f017e5eefb"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_parser::syntax::object::parse_object_member (cyclomatic 17): biome_js_parser::syntax::object::parse_object_member 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/biome_js_parser/src/syntax/object.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"d758e26cc0835ad5e45ee080eded3cd85ffdc26a8951b949889a676242570525"}},{"ruleId":"D1","level":"warning","message":{"text":"JsAssignmentExpression::needs_parentheses (cyclomatic 17): JsAssignmentExpression::needs_parentheses has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: AnyJsExpression::needs_parentheses (cyclomatic 38) 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/biome_js_syntax/src/parentheses/expression.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9835296a51b5dad0b0075cfda851d1506cbb0d17312fd8c94a1e7c43c3624cf"}},{"ruleId":"D1","level":"warning","message":{"text":"InferredType::boolean_coercion (cyclomatic 17): InferredType::boolean_coercion has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/inferred_type/boolean_coercion.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"cee192fab5a096c34da95f2d044d897a75b5335c16861d56fdc84296472fa09f"}},{"ruleId":"D1","level":"warning","message":{"text":"AssignabilityCheck::is_tuple_assignable (cyclomatic 17): AssignabilityCheck::is_tuple_assignable has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/type_relation.rs"},"region":{"startLine":1428}}}],"partialFingerprints":{"codehealthFindingId/v1":"490266dfe27b25b087d0d083b53c5ca6480854c9f80a2a358f6eb260f2e5afb7"}},{"ruleId":"D1","level":"warning","message":{"text":"NoDuplicateDependencies::run (cyclomatic 17): NoDuplicateDependencies::run 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/biome_json_analyze/src/lint/suspicious/no_duplicate_dependencies.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee2820a72d6c67a790e8dc6ac739d494632f7b5bf67fe95dcf6735198d8870f5"}},{"ruleId":"D1","level":"warning","message":{"text":"Session::update_diagnostics_for_document (cyclomatic 17): Session::update_diagnostics_for_document 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/biome_lsp/src/session.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"e57f29c0bcadabc35d14e9e8e904e74a3ac3197ea362c0a78c264a03d29f931d"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeSpanNormalization::fmt (cyclomatic 17): CodeSpanNormalization::fmt 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/biome_markdown_formatter/src/markdown/auxiliary/inline_code.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b4ec8a8c3a72f1672d3b5b45da5d107ce6ad3bff06073af07cd839cc7a659d"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_markdown_parser::syntax::textual_looks_like_list_marker (cyclomatic 17): biome_markdown_parser::syntax::textual_looks_like_list_marker 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/biome_markdown_parser/src/syntax/mod.rs"},"region":{"startLine":2095}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e9a47b1a512dff76f355fa723007fd5fcccaa616f90946847c94c21f796904f"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_markdown_parser::to_html::strip_quote_prefixes (cyclomatic 17): biome_markdown_parser::to_html::strip_quote_prefixes 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/biome_markdown_parser/src/to_html.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"6449b965c0979ab907eb34a0b4fcfc7b23c3b461d7f8b4753357b0361d8af097"}},{"ruleId":"D1","level":"warning","message":{"text":"ImportSourceKind::from_source (cyclomatic 17): ImportSourceKind::from_source has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_rule_options/src/organize_imports/import_source.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a3cbb86f21c7653ddba12252133f6bec002c1632c7fead34743d61eabcbba3"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_service::file_handlers::javascript::go_to::resolve_binding (cyclomatic 17): biome_service::file_handlers::javascript::go_to::resolve_binding 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/biome_service/src/file_handlers/javascript/go_to.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"afcde7b3b9e971bc21f14cddab7d0c15e34c7e6a6aaee5023168547549e0e490"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_service::workspace_types::generate_type (cyclomatic 17): biome_service::workspace_types::generate_type 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/biome_service/src/workspace_types.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec83f6df825f5acf61d2bff8805dd7bc12437b291d88bbfca9d5d71d00b5f016"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_vue_semantic::semantic_model::component::type_set_of (cyclomatic 17): biome_vue_semantic::semantic_model::component::type_set_of has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_vue_semantic/src/semantic_model/component.rs"},"region":{"startLine":2600}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a62b3b7f1e1db959e92909e7c3d637e28b4cf03532c614bd7061aaa6a34f66b"}},{"ruleId":"D1","level":"warning","message":{"text":"xtask_codegen::generate_global_types::lower::overrides::lower_error_constructor_signatures (cyclomatic 17): xtask_codegen::generate_global_types::lower::overrides::lower_error_constructor_signatures 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":"xtask/codegen/src/generate_global_types/lower/overrides.rs"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"60775d481d3e0e2640c2fa2caf47b0126600e6d35c68e9362237ae181676617f"}},{"ruleId":"D1","level":"warning","message":{"text":"ConfigurationInspector::inspect_key (cyclomatic 16): ConfigurationInspector::inspect_key has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/commands/inspect/config/configuration.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"49051c5b4ed160df7db8c6d1a0706341ee66dba5da1b92f665f9188c84487270"}},{"ruleId":"D1","level":"warning","message":{"text":"SummaryReporterVisitor::report_diagnostics (cyclomatic 16): SummaryReporterVisitor::report_diagnostics 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/biome_cli/src/reporter/summary.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2bad6959e9f05e55bc4914cfc7b99d8972d459d846bcd844024df12457ada02"}},{"ruleId":"D1","level":"warning","message":{"text":"CheckProcessFile::process_file (cyclomatic 16): CheckProcessFile::process_file has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/runner/impls/process_file/check.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f5828775f2bd96f8da8b314b7b1b09efa77bea4bc54d14ce64a34ccaa7923af"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_configuration_macros::group_struct::generate_group_struct (cyclomatic 16): biome_configuration_macros::group_struct::generate_group_struct 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/biome_configuration_macros/src/group_struct.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"883880d4a7b1637f743021c6fa5dd02629fdb6111e1af2919a07c2b2b611f10b"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_css_analyze::lint::nursery::use_logical_properties::make_split_declaration (cyclomatic 16): biome_css_analyze::lint::nursery::use_logical_properties::make_split_declaration 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/biome_css_analyze/src/lint/nursery/use_logical_properties.rs"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"92e4916f07d5de91a28d541cd76e7ac2f991e17b7079ef6961466180925c0aab"}},{"ruleId":"D1","level":"warning","message":{"text":"CssScanCursor::is_ident_start_at (cyclomatic 16): CssScanCursor::is_ident_start_at 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/biome_css_parser/src/lexer/scan_cursor.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaadb226263251fe76375f012805a4570473fc9df469ae74f0802786bb6167b0"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_css_semantic::semantic_model::specificity::evaluate_any_pseudo_class (cyclomatic 16): biome_css_semantic::semantic_model::specificity::evaluate_any_pseudo_class 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/biome_css_semantic/src/semantic_model/specificity.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c4c6c936f18fce7c5bfb6f380fc3c06062343cc5c04c7ffdf8d0757f4496874"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_css_syntax::property_syntax::matcher::matches_component (cyclomatic 16): biome_css_syntax::property_syntax::matcher::matches_component 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/biome_css_syntax/src/property_syntax/matcher.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef83a4d44c734971ad5c24b9528ee51e39e179af74c07d007a6e917d50cf5ac3"}},{"ruleId":"D1","level":"warning","message":{"text":"Document::propagate_expand::propagate_expands (cyclomatic 16): Document::propagate_expand::propagate_expands 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/biome_formatter/src/format_element/document.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"b10905d61132571c65cf5e902bb6d707b0274aa6150aba2d6dfaaf6f75075cec"}},{"ruleId":"D1","level":"warning","message":{"text":"GritExecContext::exec_step (cyclomatic 16): GritExecContext::exec_step 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/biome_grit_patterns/src/grit_context.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"97746025388d8ac78aa6f9e8b9ba451b3497a61e848b93caa720f1db6d620bc8"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_grit_patterns::grit_binding::are_equivalent (cyclomatic 16): biome_grit_patterns::grit_binding::are_equivalent 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/biome_grit_patterns/src/grit_binding.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"f390c6bc81d1874ae1528576fe3f9a1e1a6dedfde80f6ce63657cc0f40a41dea"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_html_formatter::utils::srcset::parse_srcset (cyclomatic 16): biome_html_formatter::utils::srcset::parse_srcset has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_formatter/src/utils/srcset.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"261cc1f5d786a25a5a3284b73934e9ccc566db6f5891242ad03a37ce78c7237d"}},{"ruleId":"D1","level":"warning","message":{"text":"HtmlLexer::consume_token (cyclomatic 16): HtmlLexer::consume_token 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. This is NOT this file\u0027s highest cyclomatic complexity: HtmlLexer::consume_language_identifier (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/biome_html_parser/src/lexer/mod.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"466512ec86bd156bf0a4a51dd9d1e02c2c21428180278ce919df6f59ec074905"}},{"ruleId":"D1","level":"warning","message":{"text":"LogicalAndChain::cmp_chain (cyclomatic 16): LogicalAndChain::cmp_chain 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/biome_js_analyze/src/lint/complexity/use_optional_chain.rs"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc23b3fcde9486791d839039f8ca50375a4080dee9b8413e98197ec2cee87cdb"}},{"ruleId":"D1","level":"warning","message":{"text":"NoJsxLiterals::run (cyclomatic 16): NoJsxLiterals::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/biome_js_analyze/src/lint/style/no_jsx_literals.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dabfb5406b91140be668c08992843d2f02766f80e1fce2ca9be0e6eee370bbc"}},{"ruleId":"D1","level":"warning","message":{"text":"UseBlockStatements::action (cyclomatic 16): UseBlockStatements::action 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/biome_js_analyze/src/lint/style/use_block_statements.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"7642a01bb2f0696f9bfda45cdf931c5a6d951a956e9a0dc32e0043ceaa382bd2"}},{"ruleId":"D1","level":"warning","message":{"text":"UseConsistentEnumValueType::run (cyclomatic 16): UseConsistentEnumValueType::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/biome_js_analyze/src/lint/style/use_consistent_enum_value_type.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d125ca92f40d21a96ddbbb3db772a2cecc5be450191c6d84940bca53c0491b4"}},{"ruleId":"D1","level":"warning","message":{"text":"UseConsistentObjectDefinitions::run (cyclomatic 16): UseConsistentObjectDefinitions::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/biome_js_analyze/src/lint/style/use_consistent_object_definitions.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"3947a319dff51a57a5c1a9309727759bb7484acae65df8e8dae83985753102a5"}},{"ruleId":"D1","level":"warning","message":{"text":"UseConsistentObjectDefinitions::action (cyclomatic 16): UseConsistentObjectDefinitions::action 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/biome_js_analyze/src/lint/style/use_consistent_object_definitions.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"707f75ee853b6987545e2b283e1620435c2a61652e73ecaab0db49831100db87"}},{"ruleId":"D1","level":"warning","message":{"text":"NoUnnecessaryConditions::run (cyclomatic 16): NoUnnecessaryConditions::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/biome_js_analyze/src/lint/suspicious/no_unnecessary_conditions.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb9935436eaf8159adc8713a90c56bf0c5ac41dd0f853ae68aa307d1380f942a"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::frameworks::playwright::is_playwright_call_chain (cyclomatic 16): biome_js_analyze::frameworks::playwright::is_playwright_call_chain 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/biome_js_analyze/src/frameworks/playwright.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"f993f7cf297b69f9aa800f721a2244941d4c2f94614decc613406a6fa79aa327"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::lint::correctness::no_playwright_missing_await::is_call_awaited_or_returned (cyclomatic 16): biome_js_analyze::lint::correctness::no_playwright_missing_await::is_call_awaited_or_returned has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/no_playwright_missing_await.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d48e4dbe1922abc92cd3b713839c9db96a048dea0fb022959a79f79b854b41"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::no_undeclared_classes::collect_class_names_from_expression (cyclomatic 16): biome_js_analyze::lint::nursery::no_undeclared_classes::collect_class_names_from_expression 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/biome_js_analyze/src/lint/nursery/no_undeclared_classes.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc44a1662f3a2c5cd2a4eff3f3ac2836d366646cc7b06144b2798058892f6d1d"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::no_unmodified_loop_condition::condition_references (cyclomatic 16): biome_js_analyze::lint::nursery::no_unmodified_loop_condition::condition_references 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/biome_js_analyze/src/lint/nursery/no_unmodified_loop_condition.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e35238516dc3006f5b881f9ffe7a9079a27a83e367a31999828887836452fa1"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::use_explicit_return_type::ancestor_has_return_type (cyclomatic 16): biome_js_analyze::lint::nursery::use_explicit_return_type::ancestor_has_return_type has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_explicit_return_type.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e5c2b1c17f6eeb51ae8eb6fd4f1c7b85f739d85dad9e1efb693c64dd7e770a3"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::lint::suspicious::no_react_forward_ref::fix_parameters (cyclomatic 16): biome_js_analyze::lint::suspicious::no_react_forward_ref::fix_parameters 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/biome_js_analyze/src/lint/suspicious/no_react_forward_ref.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7483a4d388aebc18be833a0050a5e032fda21de33c822940dd16e5acce8c2d3"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::lint::suspicious::no_redeclare::check_redeclarations_in_single_scope (cyclomatic 16): biome_js_analyze::lint::suspicious::no_redeclare::check_redeclarations_in_single_scope has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/no_redeclare.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"4360d8e2f5a47d7b496388264b766042b74b5f733bf04635987af9af1a645462"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::lint::suspicious::use_iterable_callback_return::get_function_returns_info (cyclomatic 16): biome_js_analyze::lint::suspicious::use_iterable_callback_return::get_function_returns_info has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/use_iterable_callback_return.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d8944eef96a2426f536fba39bfd6f05a3ed5b836f5594763d79810eda422a2"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_analyze::shared::late_event_handler::classify_type_name (cyclomatic 16): biome_js_analyze::shared::late_event_handler::classify_type_name 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/biome_js_analyze/src/shared/late_event_handler.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9afa02a5f0c7e6bb834b9e7b3ad5398fb0769ec5aced2dcbc745a90fd2b4fc"}},{"ruleId":"D1","level":"warning","message":{"text":"FormatTsTypeArguments::fmt_fields (cyclomatic 16): FormatTsTypeArguments::fmt_fields has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/ts/expressions/type_arguments.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"5632131412b3986bd1660f17248e102c371f4c6238375421eb47fc3e81b46e52"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_formatter::utils::assignment_like::should_break_after_operator (cyclomatic 16): biome_js_formatter::utils::assignment_like::should_break_after_operator 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/biome_js_formatter/src/utils/assignment_like.rs"},"region":{"startLine":985}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce7550c334bedfb44e85f1cfd75f178b300bb3a29c59c397477175008cbc1eb"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_parser::syntax::expr::parse_member_expression_rest (cyclomatic 16): biome_js_parser::syntax::expr::parse_member_expression_rest 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/biome_js_parser/src/syntax/expr.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"30d6c5ba728c198a0515fca58ae3df0bdbad0ba8f89c47c3df357ad445f02959"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_js_parser::syntax::expr::parse_unary_expr (cyclomatic 16): biome_js_parser::syntax::expr::parse_unary_expr 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/biome_js_parser/src/syntax/expr.rs"},"region":{"startLine":1866}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f638d51d7869f1fcc936702376c221dded11b63601e67abafdacc9282017f0"}},{"ruleId":"D1","level":"warning","message":{"text":"JsMutation::change (cyclomatic 16): JsMutation::change 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/biome_js_runtime/src/mutation.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"289d6b1dda44fb992d44d9159c49406ee517f113916740355de33e6e3aee3ae5"}},{"ruleId":"D1","level":"warning","message":{"text":"InferredType::function_returns_promise_with (cyclomatic 16): InferredType::function_returns_promise_with has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: CallableVisitor::enter (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/inferred_type.rs"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"5babe592d14e65744884609bb3df4e840ff8601991fef6b2b7a626416187c732"}},{"ruleId":"D1","level":"warning","message":{"text":"InferredType::callable_type_with (cyclomatic 16): InferredType::callable_type_with has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: CallableVisitor::enter (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/inferred_type.rs"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd60fb85be523b306c2da0b5fba5c548966484e549f5cfeec9cd5b06dfec569"}},{"ruleId":"D1","level":"warning","message":{"text":"FormatGfmTableRowWithOptions::fmt (cyclomatic 16): FormatGfmTableRowWithOptions::fmt 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/biome_markdown_formatter/src/gfm/auxiliary/table_row.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"a216bbb1e8c899d33feeb882c3e9c0711cc18a272dd420b66dfcacd56c246730"}},{"ruleId":"D1","level":"warning","message":{"text":"FormatMdInlineItemList::fmt_inside_list (cyclomatic 16): FormatMdInlineItemList::fmt_inside_list 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/biome_markdown_formatter/src/markdown/lists/inline_item_list.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"92709c4f5bbcb90b37035b0c518bca061a648e3f2526b56ebc304b0e6e64ab3d"}},{"ruleId":"D1","level":"warning","message":{"text":"MarkdownLexer::is_after_block_quote_marker (cyclomatic 16): MarkdownLexer::is_after_block_quote_marker 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/biome_markdown_parser/src/lexer/mod.rs"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"a70fc44133b3ea72925299274e99e160f3faa93b9521cbd4e1c5e1e16a64632e"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_markdown_parser::syntax::classify_quote_break_after_newline (cyclomatic 16): biome_markdown_parser::syntax::classify_quote_break_after_newline has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/mod.rs"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"7750945847884bdef5b2954fbe49700d7ea893d27bf2cd76cf0b4dceecd168c2"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_markdown_parser::syntax::is_quote_only_blank_line_from_source (cyclomatic 16): biome_markdown_parser::syntax::is_quote_only_blank_line_from_source 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/biome_markdown_parser/src/syntax/mod.rs"},"region":{"startLine":1648}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d55dda3d9e480e4581e36d1c7eabd2d1586e714a7e88735f11820a75d6968c"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_markdown_parser::syntax::inline::links::collect_link_text (cyclomatic 16): biome_markdown_parser::syntax::inline::links::collect_link_text 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/biome_markdown_parser/src/syntax/inline/links.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"72ec4519b89058805aa0fb6f120a5d37b71796114b661beef1b3a7e57cbfd25e"}},{"ruleId":"D1","level":"warning","message":{"text":"CssModuleVisitor::visit (cyclomatic 16): CssModuleVisitor::visit 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/biome_module_graph/src/css_module_info/visitor.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c7a6e81b6c405e187f1b98e247c1353cf44b4ab7db81e5674ae42c15e9ed102"}},{"ruleId":"D1","level":"warning","message":{"text":"ResolutionCtx::resolve_const_argument (cyclomatic 16): ResolutionCtx::resolve_const_argument has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: ResolutionCtx::resolve_inferred_typeof_expression (cyclomatic 26) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cdbe9731483ab5f924cd6d19b8b4c6012aa388a4bbcb2f712eb0a96cac99033"}},{"ruleId":"D1","level":"warning","message":{"text":"ResolutionCtx::resolve_promise_value_type (cyclomatic 16): ResolutionCtx::resolve_promise_value_type has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: ResolutionCtx::resolve_inferred_typeof_expression (cyclomatic 26) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":1383}}}],"partialFingerprints":{"codehealthFindingId/v1":"43daf44b45b31daf9969bb8374ecfa85c7edccbb8fba4e9e24f0c8219cf197b2"}},{"ruleId":"D1","level":"warning","message":{"text":"ResolutionCtx::rest_object_from_type (cyclomatic 16): ResolutionCtx::rest_object_from_type has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: ResolutionCtx::resolve_inferred_typeof_expression (cyclomatic 26) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":2523}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b459b25c78c4a2fb4bdb06ab6959d4a40941d87cc969cba434681a5a9a9116"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_module_graph::db::queries::find_jsdoc_for_exported_symbol (cyclomatic 16): biome_module_graph::db::queries::find_jsdoc_for_exported_symbol 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/biome_module_graph/src/db/queries.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"510978cd208d8ce2d9d265afc76b12c4dcfc64f5a1c940931a12d3eaa54d4dc9"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_package::node_semver::range::parse_hyphen_range (cyclomatic 16): biome_package::node_semver::range::parse_hyphen_range 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. This is NOT this file\u0027s highest cyclomatic complexity: Comparator::intersects (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_package/src/node_semver/range.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b1fa7f9a92e41c3fca68722b95d3f33390e46bb3d88655793e656d8c8ebd888"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_resolver::resolve_dependency (cyclomatic 16): biome_resolver::resolve_dependency 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/biome_resolver/src/lib.rs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df49cbde717f42c61cf6edb50d23f3427d1cf097f8f40a7737af9861d882e78"}},{"ruleId":"D1","level":"warning","message":{"text":"RawLanguageSyntaxFactory::make_syntax (cyclomatic 16): RawLanguageSyntaxFactory::make_syntax 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/biome_rowan/src/raw_language.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b6b01069abc9118a106deddde937f885e45707383b6e8fff7d545611b9bf138"}},{"ruleId":"D1","level":"warning","message":{"text":"Watcher::handle_notify_event (cyclomatic 16): Watcher::handle_notify_event 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/biome_service/src/scanner/watcher.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"889541bd06af169131c3be54e58e9f058b053a2fd4c96c73392303d319522fa4"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_service::file_handlers::html::go_to::resolve_binding_html (cyclomatic 16): biome_service::file_handlers::html::go_to::resolve_binding_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/biome_service/src/file_handlers/html/go_to.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"b106f6403437e9bd2856f632485d2397031f822cbe59183c629d6e709643597e"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_suppression::parse_suppression_comment_with_line_prefix (cyclomatic 16): biome_suppression::parse_suppression_comment_with_line_prefix 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/biome_suppression/src/lib.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"74b12ce2c7119743190953e5b3b05fc66a837b8eaec89282ec7f5e41297f93f2"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_syntax_codegen::ast::handle_rule (cyclomatic 16): biome_syntax_codegen::ast::handle_rule has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_syntax_codegen/src/ast.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"937992eeb0338c6b9f544e8a16d69d5f3ee67c44f6d399fc17689328b9800444"}},{"ruleId":"D1","level":"warning","message":{"text":"Collector::collect_setup_function (cyclomatic 16): Collector::collect_setup_function 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/biome_vue_semantic/src/semantic_model/component.rs"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5240aa75fbab2f64d4746fcbc80f3c67b0f1efc9d33e7e51c663d2e8c289fa"}},{"ruleId":"D1","level":"warning","message":{"text":"biome_vue_semantic::semantic_model::references::collect_script_references (cyclomatic 16): biome_vue_semantic::semantic_model::references::collect_script_references 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/biome_vue_semantic/src/semantic_model/references.rs"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c39eee3b148fe3ea05ec297af52ce38b358684d20b4198c057f5ae733f2c021"}},{"ruleId":"D1","level":"warning","message":{"text":"FormatYamlVerbatimNode::fmt (cyclomatic 16): FormatYamlVerbatimNode::fmt 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/biome_yaml_formatter/src/verbatim.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c67a880b83cf02f56b53031d7114321c3a7a1e8e543ff3b06dd588ae88430c"}},{"ruleId":"D1","level":"warning","message":{"text":"YamlLexer::report_over_indented_leading_empty_line (cyclomatic 16): YamlLexer::report_over_indented_leading_empty_line 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/biome_yaml_parser/src/lexer/mod.rs"},"region":{"startLine":1515}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc3a5030a5de797b8862b3c7c47204e814149479b51868931cdcf4f898158e5f"}},{"ruleId":"D1","level":"warning","message":{"text":"xtask_codegen::ast::handle_rule (cyclomatic 16): xtask_codegen::ast::handle_rule has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/ast.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1ac647ec8361f9718ad41a9a48af4595c83e61399dcc301c9f92a818f912ba6"}},{"ruleId":"D1","level":"warning","message":{"text":"xtask_codegen::generate_global_types::compare::assert_promise_shape (cyclomatic 16): xtask_codegen::generate_global_types::compare::assert_promise_shape has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/generate_global_types/compare.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b154a450c245c4096af3b995b87230e27d7893f8aec78cf313149ab99ba36b"}},{"ruleId":"D1","level":"warning","message":{"text":"SymbolsMicrosoftTestCase::run (cyclomatic 16): SymbolsMicrosoftTestCase::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":"xtask/coverage/src/symbols/msts.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeba7fb28264009af731ff4fff96a782838b2b58ce640ece929140ef3da6ecf5"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_module_graph::db::type_inference::promise_classification::classify_expression (cognitive 491): biome_module_graph::db::type_inference::promise_classification::classify_expression has cognitive complexity 491 (threshold 15). Drivers by points: if/else 76 (341 pts), match/switch 32 (123 pts), loops 4 (16 pts), boolean chains 11 (nesting depth added 368). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/type_inference/promise_classification.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33143be1aaebd184927944128e66a4d45db98a4a0ba3d01a37763da0f5218ef"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatHtmlElementList::fmt_children (cognitive 246): FormatHtmlElementList::fmt_children has cognitive complexity 246 (threshold 15). Drivers by points: if/else 87 (174 pts), boolean chains 36, match/switch 8 (26 pts), loops 5 (10 pts) (nesting depth added 110). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_formatter/src/html/lists/element_list.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf4f2274390f64d5d7086968bbfd0535e8c0eb5d52deed900344419d05d1d98"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_cli::execute::migrate::eslint_to_biome::migrate_eslint_rule (cognitive 188): biome_cli::execute::migrate::eslint_to_biome::migrate_eslint_rule has cognitive complexity 188 (threshold 15). Drivers by points: if/else 61 (155 pts), boolean chains 19, match/switch 6 (14 pts) (nesting depth added 102). 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/biome_cli/src/execute/migrate/eslint_to_biome.rs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"347191957c31ac170343a37edc203e68d8430ba46ac1e92983368aa57a8c7f8d"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_html_formatter::utils::children::html_split_children (cognitive 186): biome_html_formatter::utils::children::html_split_children has cognitive complexity 186 (threshold 15). Drivers by points: if/else 43 (139 pts), loops 8 (22 pts), match/switch 5 (20 pts), boolean chains 5 (nesting depth added 125). 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/biome_html_formatter/src/utils/children.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f1f0a10058ce36b06465937ce1f37a1d55c8023fe40ce6a20d533910f3cfc8b"}},{"ruleId":"D2","level":"warning","message":{"text":"DefaultBlockListFormatter::fmt (cognitive 186): DefaultBlockListFormatter::fmt has cognitive complexity 186 (threshold 15). Drivers by points: if/else 42 (117 pts), loops 12 (46 pts), boolean chains 23 (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/biome_markdown_formatter/src/markdown/lists/block_list.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"faae90daa487d723273dd01bc3056eb3333aef58fc80bb24f6c37bca89d9383a"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_service::file_handlers::html::parse_embedded_nodes::parse_embedded_nodes (cognitive 156): biome_service::file_handlers::html::parse_embedded_nodes::parse_embedded_nodes has cognitive complexity 156 (threshold 15). Drivers by points: if/else 36 (89 pts), loops 17 (36 pts), boolean chains 27, match/switch 2 (4 pts) (nesting depth added 74). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/html/parse_embedded_nodes.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac154ebba398beaa0e8370ed57c934cedf10d9ec1c5d0bac11242f81baba935"}},{"ruleId":"D2","level":"warning","message":{"text":"ControlFlowVisitor::visit (cognitive 151): ControlFlowVisitor::visit has cognitive complexity 151 (threshold 15). Drivers by points: if/else 64 (150 pts), match/switch 1 (nesting depth added 86). 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/biome_js_control_flow/src/visitor.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cef13495194898babb263b3e9fc35c76ff8fd12ee01474a9d5e96aaed445928"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::suspicious::no_useless_regex_backrefs::run (cognitive 134): biome_js_analyze::lint::suspicious::no_useless_regex_backrefs::run has cognitive complexity 134 (threshold 15). Drivers by points: if/else 18 (77 pts), loops 8 (31 pts), match/switch 6 (22 pts), boolean chains 4 (nesting depth added 98). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/no_useless_regex_backrefs.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"4633011a558f1fe7463459774910042d82b522b9ebe16e90a4973f36879439f9"}},{"ruleId":"D2","level":"warning","message":{"text":"Rules::deserialize (cognitive 108): Rules::deserialize has cognitive complexity 108 (threshold 15). Drivers by points: if/else 35 (104 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 70). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/execute/migrate/eslint_eslint.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ded3a502e880914d752517816145e449f7f5ca37f22f7391b9a11ee6644ac3"}},{"ruleId":"D2","level":"warning","message":{"text":"OrganizeImports::action (cognitive 107): OrganizeImports::action has cognitive complexity 107 (threshold 15). Drivers by points: if/else 24 (81 pts), boolean chains 10, loops 4 (8 pts), match/switch 3 (8 pts) (nesting depth added 66). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/assist/source/organize_imports.rs"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"39264193e050f1be39d392737c8f8131a9e8efa269a29a37f62e512e0354a0e4"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_parser::syntax::parse_any_block_with_indent_code_policy (cognitive 105): biome_markdown_parser::syntax::parse_any_block_with_indent_code_policy has cognitive complexity 105 (threshold 15). Drivers by points: if/else 45 (80 pts), boolean chains 20, match/switch 1 (3 pts), loops 1 (2 pts) (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/mod.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"2df91f72358c2c68214910066138742e3bec6f549aafc83cc29bc68f4e764f69"}},{"ruleId":"D2","level":"warning","message":{"text":"ListBlockList::fmt (cognitive 103): ListBlockList::fmt has cognitive complexity 103 (threshold 15). Drivers by points: if/else 28 (78 pts), loops 4 (10 pts), boolean chains 8, match/switch 3 (7 pts) (nesting depth added 60). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_formatter/src/bullet_list.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"64fd6e2650096a96f11c7dbbe6190332344abf04a2dd592453ea39168e9408ff"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_type_info::return_type_relation::is_only_property_literal_widening (cognitive 101): biome_js_type_info::return_type_relation::is_only_property_literal_widening has cognitive complexity 101 (threshold 15). Drivers by points: if/else 19 (65 pts), match/switch 5 (21 pts), loops 5 (14 pts), boolean chains 1 (nesting depth added 71). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/return_type_relation.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e751807efc0ccf6f0ed33d450221914bed39bdf6233f59e70de9dd636faef7f"}},{"ruleId":"D2","level":"warning","message":{"text":"DefaultCollector::run (cognitive 97): DefaultCollector::run has cognitive complexity 97 (threshold 15). Drivers by points: if/else 18 (59 pts), match/switch 6 (24 pts), loops 3 (9 pts), boolean chains 5 (nesting depth added 65). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/runner/impls/collectors/default.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c993f75b72ee487754b235221dde8355f8b9ad4541c30568dd92060aca4c6b5"}},{"ruleId":"D2","level":"warning","message":{"text":"NoUselessFragments::run (cognitive 92): NoUselessFragments::run has cognitive complexity 92 (threshold 15). Drivers by points: if/else 34 (73 pts), match/switch 6 (12 pts), boolean chains 6, loops 1 (nesting depth added 45). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/complexity/no_useless_fragments.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec2de466958ce2cec464cb436a27d79ab97d031449da88f6d13a30d800495782"}},{"ruleId":"D2","level":"warning","message":{"text":"JsLexer::read_regex (cognitive 89): JsLexer::read_regex has cognitive complexity 89 (threshold 15). Drivers by points: if/else 17 (74 pts), match/switch 3 (10 pts), loops 2 (5 pts) (nesting depth added 67). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_parser/src/lexer/mod.rs"},"region":{"startLine":1674}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cfea5cac0a3b1f1541635112f8c3ca2619af73306e3f78ff53bd234e91943f5"}},{"ruleId":"D2","level":"warning","message":{"text":"HtmlRenderer::enter (cognitive 89): HtmlRenderer::enter has cognitive complexity 89 (threshold 15). Drivers by points: if/else 52 (71 pts), boolean chains 10, match/switch 2 (6 pts), loops 1 (2 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/to_html.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce7e4b994e6a64aab46df45d33f2886372993aab109b13e21bd7460092a47e3"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_cli::execute::migrate::migrate_file (cognitive 87): biome_cli::execute::migrate::migrate_file has cognitive complexity 87 (threshold 15). Drivers by points: if/else 34 (71 pts), match/switch 4 (10 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 44). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/execute/migrate.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"738f37f2097defb6dfabbc8a48f849a4564c31c3854fd86c8b00298c1cf2faea"}},{"ruleId":"D2","level":"warning","message":{"text":"BatchMutation::commit_with_text_range_and_edit (cognitive 83): BatchMutation::commit_with_text_range_and_edit has cognitive complexity 83 (threshold 15). Drivers by points: if/else 13 (43 pts), match/switch 4 (23 pts), loops 5 (15 pts), boolean chains 2 (nesting depth added 59). 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/biome_rowan/src/ast/batch.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e2ff436a8e1423b06fece71df0013468fbdcc0132e047ca04cc7622277ced7c"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_diagnostics::display::frame::print_frame (cognitive 81): biome_diagnostics::display::frame::print_frame has cognitive complexity 81 (threshold 15). Drivers by points: if/else 21 (38 pts), loops 9 (25 pts), match/switch 8 (13 pts), boolean chains 5 (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_diagnostics/src/display/frame.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa3b5e3a07aa9de9e76aba59ed3d34fb9c8668d41ac25c151bc0989af104697"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkdownLexer::consume_textual_impl (cognitive 80): MarkdownLexer::consume_textual_impl has cognitive complexity 80 (threshold 15). Drivers by points: if/else 18 (46 pts), loops 7 (20 pts), boolean chains 12, match/switch 1 (2 pts) (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/lexer/mod.rs"},"region":{"startLine":1451}}}],"partialFingerprints":{"codehealthFindingId/v1":"4acccd35345b482b6bbe546c2270dd68ae2c1f3da32f39da2c0eeed0a028a53f"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_cli::commands::inspect::plugins::inspect_plugins (cognitive 79): biome_cli::commands::inspect::plugins::inspect_plugins has cognitive complexity 79 (threshold 15). Drivers by points: if/else 20 (47 pts), loops 8 (15 pts), match/switch 4 (14 pts), boolean chains 3 (nesting depth added 44). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/commands/inspect/plugins/mod.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a71e18c7654699442df749356ed945230623e5fff4331620010cf7a7668890f"}},{"ruleId":"D2","level":"warning","message":{"text":"NoUnreachableSuper::run (cognitive 79): NoUnreachableSuper::run has cognitive complexity 79 (threshold 15). Drivers by points: if/else 15 (61 pts), loops 4 (9 pts), match/switch 2 (8 pts), boolean chains 1 (nesting depth added 57). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/no_unreachable_super.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce67b3ea280b3ba6dcbe02132fca442b930b551651c29f67bc1885a8e11588d"}},{"ruleId":"D2","level":"warning","message":{"text":"UseImportType::run (cognitive 78): UseImportType::run has cognitive complexity 78 (threshold 15). Drivers by points: if/else 32 (64 pts), match/switch 5 (11 pts), boolean chains 3 (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/biome_js_analyze/src/lint/style/use_import_type.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"824d31060ede5f3e13465d43685aaf643832a5d4a0e82bc31e482f4045af777f"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_css_analyze::lint::correctness::no_unknown_media_feature_name::has_invalid_media_feature_name (cognitive 77): biome_css_analyze::lint::correctness::no_unknown_media_feature_name::has_invalid_media_feature_name has cognitive complexity 77 (threshold 15). Drivers by points: if/else 10 (50 pts), match/switch 5 (18 pts), loops 3 (9 pts) (nesting depth added 59). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_analyze/src/lint/correctness/no_unknown_media_feature_name.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c57a5fc4b06409eb78638301ccd5ac64b70f9a7e93e765f4b31bbc948de12a"}},{"ruleId":"D2","level":"warning","message":{"text":"InferredType::is_promise_instance_with (cognitive 77): InferredType::is_promise_instance_with has cognitive complexity 77 (threshold 15). Drivers by points: if/else 22 (56 pts), match/switch 4 (12 pts), loops 2 (5 pts), boolean chains 4 (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/inferred_type.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d8077623899488c41579ae4be89c57f4f9335a3611af122a1984a9d8df97b4"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::correctness::no_unused_private_class_members::traverse_members_usage (cognitive 76): biome_js_analyze::lint::correctness::no_unused_private_class_members::traverse_members_usage has cognitive complexity 76 (threshold 15). Drivers by points: if/else 12 (45 pts), loops 6 (18 pts), match/switch 2 (7 pts), boolean chains 6 (nesting depth added 50). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/no_unused_private_class_members.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"3178d5ee078a10156b6f3b6f31cb9431201540739170a288551bc91c7c60a65a"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_service::file_handlers::html::parse_embedded_nodes::parse_svelte_blocks (cognitive 76): biome_service::file_handlers::html::parse_embedded_nodes::parse_svelte_blocks has cognitive complexity 76 (threshold 15). Drivers by points: if/else 15 (51 pts), boolean chains 11, loops 3 (7 pts), match/switch 2 (7 pts) (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/html/parse_embedded_nodes.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f302639c076c147e9f5e5c4051ef4721592469314d0820c29b9129d356b4b2a"}},{"ruleId":"D2","level":"warning","message":{"text":"HtmlLexer::consume_identifier (cognitive 74): HtmlLexer::consume_identifier has cognitive complexity 74 (threshold 15). Drivers by points: if/else 23 (59 pts), boolean chains 11, match/switch 2 (3 pts), loops 1 (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_parser/src/lexer/mod.rs"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a395367c47d345c2c6af82a5532bbec0467336d47b607b3d94a1afb17521e8c"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markup::markup (cognitive 74): biome_markup::markup has cognitive complexity 74 (threshold 15). Drivers by points: match/switch 11 (46 pts), if/else 6 (21 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 53). 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/biome_markup/src/lib.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"51bfdc51bd7f5b889873f30995bf28baf22ffb4295be062084391392ce01880c"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_ruledoc_utils::analyzer::analyze_rule_code (cognitive 74): biome_ruledoc_utils::analyzer::analyze_rule_code has cognitive complexity 74 (threshold 15). Drivers by points: if/else 25 (36 pts), loops 11 (35 pts), match/switch 2 (3 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_ruledoc_utils/src/analyzer.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"799e940c9374db68582275a08566ed5acdb532c833b52edbd80f36f45aa1d8c9"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask_codegen::generate_nodes::generate_nodes (cognitive 74): xtask_codegen::generate_nodes::generate_nodes has cognitive complexity 74 (threshold 15). Drivers by points: if/else 53 (65 pts), match/switch 5 (6 pts), boolean chains 3 (nesting depth added 13). 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":"xtask/codegen/src/generate_nodes.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ef5380b484620ab34f8c3389f5bbc430d82b242a02d8f4742a24097702db2a7"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticEventExtractor::enter_identifier_binding (cognitive 72): SemanticEventExtractor::enter_identifier_binding has cognitive complexity 72 (threshold 15). Drivers by points: if/else 28 (68 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_semantic/src/events.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59ed7183bfbd435264954ad1c2f78f2cd1dedcba75a6ca71215dab55ec2abee"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::style::use_unicode_regex::is_valid_unicode_pattern (cognitive 71): biome_js_analyze::lint::style::use_unicode_regex::is_valid_unicode_pattern has cognitive complexity 71 (threshold 15). Drivers by points: if/else 12 (35 pts), match/switch 5 (17 pts), loops 4 (11 pts), boolean chains 8 (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_unicode_regex.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"557a8b4efd648dad44c2dd7832cf4eab4a4703758aa57c805c04e48487971694"}},{"ruleId":"D2","level":"warning","message":{"text":"VueSemanticModel::fmt (cognitive 70): VueSemanticModel::fmt has cognitive complexity 70 (threshold 15). Drivers by points: if/else 17 (32 pts), loops 14 (24 pts), match/switch 5 (14 pts) (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/biome_vue_semantic/src/format_semantic_model.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a4b3a0f6dd9369c4ad7cd406072b7b0de141164a52ab00876fd8fe430a97a2"}},{"ruleId":"D2","level":"warning","message":{"text":"NoUnsafeOptionalChaining::run (cognitive 69): NoUnsafeOptionalChaining::run has cognitive complexity 69 (threshold 15). Drivers by points: if/else 21 (60 pts), match/switch 2 (5 pts), boolean chains 3, loops 1 (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/no_unsafe_optional_chaining.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f2a283fda8b7d8d4be902b96d67f3bfad65970c96d09c4a846036f9b15c4cc"}},{"ruleId":"D2","level":"warning","message":{"text":"JsExtent::run (cognitive 68): JsExtent::run has cognitive complexity 68 (threshold 15). Drivers by points: if/else 11 (36 pts), match/switch 7 (21 pts), boolean chains 10, loops 1 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_extent/src/lib.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb911840473c90743441ccd08322363ca11f1da6d36e122e36e8ff2fa364b70"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_parser::syntax::list::parse_first_line_blocks (cognitive 68): biome_markdown_parser::syntax::list::parse_first_line_blocks has cognitive complexity 68 (threshold 15). Drivers by points: if/else 27 (42 pts), boolean chains 20, loops 3 (4 pts), match/switch 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":2208}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5579ccf6481627c226a92ab3c728dc5aef05da9922e4aa347238370c5d6ecf1"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::ast_utils::is_constant_condition (cognitive 65): biome_js_analyze::ast_utils::is_constant_condition has cognitive complexity 65 (threshold 15). Drivers by points: if/else 21 (44 pts), match/switch 5 (12 pts), boolean chains 9 (nesting depth added 30). 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/biome_js_analyze/src/ast_utils.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62aad65fc12a8eeb1eee1c473d30b6c5be71702cd2c24067d5d749e6bbdcff7"}},{"ruleId":"D2","level":"warning","message":{"text":"QuoteBlockList::fmt (cognitive 65): QuoteBlockList::fmt has cognitive complexity 65 (threshold 15). Drivers by points: if/else 17 (47 pts), loops 4 (11 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_formatter/src/quote.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ce27000635b07cac7b71f4f78cac766419f0eca3bfa2f35a54b9eadd306af8"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatJsxChildList::fmt_children (cognitive 64): FormatJsxChildList::fmt_children has cognitive complexity 64 (threshold 15). Drivers by points: if/else 27 (49 pts), match/switch 3 (8 pts), boolean chains 6, loops 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/jsx/lists/child_list.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"a977ed045f7870b2c4deaef65bf40ce72fbe9e096e8b3bc45b35d666889b3ee7"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_parser::syntax::expr::parse_binary_or_logical_expression (cognitive 64): biome_js_parser::syntax::expr::parse_binary_or_logical_expression has cognitive complexity 64 (threshold 15). Drivers by points: if/else 18 (47 pts), boolean chains 7, match/switch 2 (7 pts), loops 2 (3 pts) (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_parser/src/syntax/expr.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c784bdd4c6c639128c4f03b04d73e5447a3b63f757ef0dd0b6a4275e56e503"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::use_consistent_boolean_name::expressions_state (cognitive 63): biome_js_analyze::lint::nursery::use_consistent_boolean_name::expressions_state has cognitive complexity 63 (threshold 15). Drivers by points: if/else 17 (44 pts), match/switch 7 (18 pts), loops 1 (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/biome_js_analyze/src/lint/nursery/use_consistent_boolean_name.rs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"df0c21c1750a9c61a54ed38ac1aa71f1e04c596be13fbffb53a5ddcf892836b7"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_parser::syntax::list::classify_blank_line_in_quote (cognitive 63): biome_markdown_parser::syntax::list::classify_blank_line_in_quote has cognitive complexity 63 (threshold 15). Drivers by points: if/else 23 (51 pts), boolean chains 7, loops 3 (5 pts) (nesting depth added 30). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":3283}}}],"partialFingerprints":{"codehealthFindingId/v1":"00dff369fc28c5785d75d219254c8cdc67db11eefa32f87d11ada087e1c3f602"}},{"ruleId":"D2","level":"warning","message":{"text":"NoUselessEscapeInRegex::run (cognitive 62): NoUselessEscapeInRegex::run has cognitive complexity 62 (threshold 15). Drivers by points: if/else 8 (33 pts), match/switch 4 (14 pts), boolean chains 11, loops 2 (4 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/biome_js_analyze/src/lint/complexity/no_useless_escape_in_regex.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"385d15a8ab01ac89e9102f61955f8dceb1ece9c5736c79fd0faee0fb71c34c74"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_lsp::handlers::analysis::code_actions (cognitive 62): biome_lsp::handlers::analysis::code_actions has cognitive complexity 62 (threshold 15). Drivers by points: if/else 36 (45 pts), boolean chains 9, match/switch 3 (5 pts), loops 2 (3 pts) (nesting depth added 12). 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/biome_lsp/src/handlers/analysis.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"637db4f946120a1f8220307a72c16c1028cd54b3bc37ac64553902ac213c2413"}},{"ruleId":"D2","level":"warning","message":{"text":"HtmlRenderer::leave (cognitive 62): HtmlRenderer::leave has cognitive complexity 62 (threshold 15). Drivers by points: if/else 30 (58 pts), boolean chains 4 (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/biome_markdown_parser/src/to_html.rs"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c62a9d3a5e99f31cd8fdb6bf84268098d71eca9b230437bfbed9a6c6b393f8"}},{"ruleId":"D2","level":"warning","message":{"text":"UseErrorCause::run (cognitive 61): UseErrorCause::run has cognitive complexity 61 (threshold 15). Drivers by points: if/else 13 (36 pts), match/switch 4 (18 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_error_cause.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b8c656961be858a376dc0fe3aba291ab73e891bfa813249bcace2b5cdea66b"}},{"ruleId":"D2","level":"warning","message":{"text":"NoFallthroughSwitchClause::run (cognitive 61): NoFallthroughSwitchClause::run has cognitive complexity 61 (threshold 15). Drivers by points: if/else 13 (45 pts), loops 4 (10 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/no_fallthrough_switch_clause.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc0cb6db2b1259fcc90fb180344cec28e58bf7cd95dcea5397a3f3be311b4ee"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_syntax_codegen::generate_nodes::generate_nodes (cognitive 61): biome_syntax_codegen::generate_nodes::generate_nodes has cognitive complexity 61 (threshold 15). Drivers by points: if/else 46 (56 pts), match/switch 4, boolean chains 1 (nesting depth added 10). 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/biome_syntax_codegen/src/generate_nodes.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3be60731bc5c78cc531342d915dbe21907ce394d53906d2949cc8c4179b1097"}},{"ruleId":"D2","level":"warning","message":{"text":"PendingSortKey::from_candidate (cognitive 60): PendingSortKey::from_candidate has cognitive complexity 60 (threshold 15). Drivers by points: if/else 27 (46 pts), boolean chains 8, match/switch 3 (6 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_tailwind_logic/src/use_tailwind_sorted_classes/sort_v4.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"411a231d7c30a69164d839cd12f6352cdf0c4a6a39fa62e5f39645bfccf6e217"}},{"ruleId":"D2","level":"warning","message":{"text":"UseExplicitType::run (cognitive 59): UseExplicitType::run has cognitive complexity 59 (threshold 15). Drivers by points: if/else 23 (52 pts), match/switch 2 (4 pts), loops 1 (2 pts), boolean chains 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/biome_js_analyze/src/lint/nursery/use_explicit_type.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"c68d35a4492a57ab38c23f302ea832e905d95777e78e061d16ad156f36419a51"}},{"ruleId":"D2","level":"warning","message":{"text":"UseReactFunctionComponentDefinition::action (cognitive 59): UseReactFunctionComponentDefinition::action has cognitive complexity 59 (threshold 15). Drivers by points: if/else 25 (47 pts), match/switch 6 (11 pts), boolean chains 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_react_function_component_definition.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f985b5c4d4667746bf8a7f832cb0e1f9bf32f2545d4b1f98a9b00b210404827"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_module_graph::db::queries::type_inference::calls::implementation::infer_generic_return_type (cognitive 59): biome_module_graph::db::queries::type_inference::calls::implementation::infer_generic_return_type has cognitive complexity 59 (threshold 15). Drivers by points: if/else 19 (43 pts), match/switch 3 (9 pts), loops 3 (4 pts), boolean chains 3 (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/biome_module_graph/src/db/queries/type_inference/calls/implementation.rs"},"region":{"startLine":1770}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee8891b5d65fde664009630e4af98850a10eeaf9d9c1dc9a0c43b0c3a360402c"}},{"ruleId":"D2","level":"warning","message":{"text":"Printer::print_element (cognitive 58): Printer::print_element has cognitive complexity 58 (threshold 15). Drivers by points: if/else 21 (43 pts), match/switch 6 (12 pts), boolean chains 3 (nesting depth added 28). 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/biome_formatter/src/printer/mod.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a83d7286c0850c64b51cdd74911220e1d4d0a56e4e126d9b490b23369839116"}},{"ruleId":"D2","level":"warning","message":{"text":"NoScriptUrl::run (cognitive 58): NoScriptUrl::run has cognitive complexity 58 (threshold 15). Drivers by points: if/else 13 (51 pts), loops 1 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 41). 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/biome_js_analyze/src/lint/security/no_script_url.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"426cf159845cec7963caed3d909349945335252d3b5c9462099353bd1cb36242"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassMemberModifiers::check_class_member_modifier (cognitive 58): ClassMemberModifiers::check_class_member_modifier has cognitive complexity 58 (threshold 15). Drivers by points: if/else 41 (51 pts), boolean chains 6, match/switch 1 (nesting depth added 10). 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/biome_js_parser/src/syntax/class.rs"},"region":{"startLine":2263}}}],"partialFingerprints":{"codehealthFindingId/v1":"adc52c389c8cce88dd9a0e94c0ceeb3403bb6031cf9a4328e4eb931cb829e24c"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_glob::editorconfig::convert_glob (cognitive 57): biome_glob::editorconfig::convert_glob has cognitive complexity 57 (threshold 15). Drivers by points: if/else 11 (33 pts), match/switch 5 (13 pts), loops 5 (9 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/biome_glob/src/editorconfig.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa7ce8d957b3ffa498aa7f268b0b09a196775a4683642aaf50ea790a3cfe4e6"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_formatter::format_range (cognitive 56): biome_formatter::format_range has cognitive complexity 56 (threshold 15). Drivers by points: if/else 20 (37 pts), match/switch 8 (14 pts), boolean chains 4, loops 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_formatter/src/lib.rs"},"region":{"startLine":2021}}}],"partialFingerprints":{"codehealthFindingId/v1":"497d01e3f1e88dcc3a54d15c3bfebc7165296708cd3551d6abc29330963303dc"}},{"ruleId":"D2","level":"warning","message":{"text":"UseConsistentArrowReturn::run (cognitive 56): UseConsistentArrowReturn::run has cognitive complexity 56 (threshold 15). Drivers by points: if/else 14 (48 pts), boolean chains 5, 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/biome_js_analyze/src/lint/style/use_consistent_arrow_return.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"628d6f716832e56399bf1493442ae114fc379f688cf88edbde3e90522bc5dd50"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_parser::syntax::link_block::skip_destination_tokens (cognitive 56): biome_markdown_parser::syntax::link_block::skip_destination_tokens has cognitive complexity 56 (threshold 15). Drivers by points: if/else 17 (44 pts), loops 3 (5 pts), boolean chains 4, match/switch 1 (3 pts) (nesting depth added 31). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/link_block.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"79d25af7cda426a4978490726ca2e15e439f7c269b9c373d6c1b160dabba6629"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_html_parser::syntax::parse_element_allowing_sfc_blocks (cognitive 55): biome_html_parser::syntax::parse_element_allowing_sfc_blocks has cognitive complexity 55 (threshold 15). Drivers by points: if/else 18 (40 pts), boolean chains 8, match/switch 2 (4 pts), loops 1 (3 pts) (nesting depth added 26). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_parser/src/syntax/mod.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"d325e752db858c45cf9f47d2f78c83898ed3f7c1901da1ad0b12fca609a017ec"}},{"ruleId":"D2","level":"warning","message":{"text":"UseComponentExportOnlyModules::run (cognitive 55): UseComponentExportOnlyModules::run has cognitive complexity 55 (threshold 15). Drivers by points: if/else 16 (36 pts), loops 3 (9 pts), boolean chains 6, match/switch 1 (4 pts) (nesting depth added 29). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_component_export_only_modules.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cce495c557dbb789a25133e29790e2d8c1793a2b97e588d0e3084ea7202ff1e"}},{"ruleId":"D2","level":"warning","message":{"text":"UseExportType::run (cognitive 54): UseExportType::run has cognitive complexity 54 (threshold 15). Drivers by points: if/else 25 (48 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_export_type.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48b4881b2e1d81956dba50af317799b40b2fa076b526ae343c6725c48615d8c"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::correctness::no_unreachable::analyze_simple (cognitive 54): biome_js_analyze::lint::correctness::no_unreachable::analyze_simple has cognitive complexity 54 (threshold 15). Drivers by points: if/else 12 (41 pts), loops 4 (6 pts), boolean chains 4, match/switch 1 (3 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/no_unreachable.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d9422d435a24934a9ee4e484decb1c44b3773165fae3c1c364e737ae49f5fc7"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_formatter::utils::jsx::jsx_split_children (cognitive 52): biome_js_formatter::utils::jsx::jsx_split_children has cognitive complexity 52 (threshold 15). Drivers by points: if/else 10 (38 pts), match/switch 3 (10 pts), loops 2 (4 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/biome_js_formatter/src/utils/jsx.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"99c066fc12af7fef8a4e604e8f4560b105663745d8a71911248a2fa9e45c0cf1"}},{"ruleId":"D2","level":"warning","message":{"text":"RuleMover::run (cognitive 52): RuleMover::run has cognitive complexity 52 (threshold 15). Drivers by points: if/else 16 (43 pts), loops 3 (7 pts), boolean chains 2 (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/biome_migrate/src/analyzers/rule_mover.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"24af08d6ac7d8ae27418e763ee4d88ff3a754ff5bd6e4747d965d056d70d04bb"}},{"ruleId":"D2","level":"warning","message":{"text":"ResolutionCtx::resolve_qualifier (cognitive 52): ResolutionCtx::resolve_qualifier has cognitive complexity 52 (threshold 15). Drivers by points: if/else 22 (32 pts), boolean chains 14, loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/type_inference/qualifiers.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"284a3421af5171ce4766be380620f7fe982797393b563146d8699e9f5282023e"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticEventExtractor::enter (cognitive 51): SemanticEventExtractor::enter has cognitive complexity 51 (threshold 15). Drivers by points: if/else 10 (28 pts), match/switch 6 (19 pts), loops 1 (4 pts) (nesting depth added 34). 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/biome_css_semantic/src/events.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc5454ec10d35a12e958812ba724a2506bdfb3a4e0eaee7a6ee1ea71f1abdc1"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::no_unmodified_loop_condition::condition_references (cognitive 51): biome_js_analyze::lint::nursery::no_unmodified_loop_condition::condition_references has cognitive complexity 51 (threshold 15). Drivers by points: if/else 16 (48 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_unmodified_loop_condition.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"18833a0735b4b07d92e0a6f6e4d08c7c0ce3c603f3e27ecf3e4234e63ab7e534"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::suspicious::no_then_property::process_js_call_expr (cognitive 51): biome_js_analyze::lint::suspicious::no_then_property::process_js_call_expr has cognitive complexity 51 (threshold 15). Drivers by points: if/else 13 (40 pts), boolean chains 5, loops 1 (5 pts), match/switch 1 (nesting depth added 31). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/no_then_property.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"86921d84557cb6b6d1f581f5f01c93edf9137e1eb2bac2072516c9dcd559a587"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_parser::syntax::list::check_continuation_indent (cognitive 51): biome_markdown_parser::syntax::list::check_continuation_indent has cognitive complexity 51 (threshold 15). Drivers by points: if/else 21 (42 pts), boolean chains 9 (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/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":2733}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad1e980012a95782158b1ab5c88e94c8e932a61edb755e1db7a5bf167b5abf9"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_vue_semantic::semantic_model::references::usage_of (cognitive 51): biome_vue_semantic::semantic_model::references::usage_of has cognitive complexity 51 (threshold 15). Drivers by points: if/else 15 (40 pts), match/switch 4 (9 pts), boolean chains 1, loops 1 (nesting depth added 30). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_vue_semantic/src/semantic_model/references.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"6724d619a2dd4cb3d5e93fcfb2bb8c91b335693a655f2dc6880cc98b6dd313f7"}},{"ruleId":"D2","level":"warning","message":{"text":"UseIterableCallbackReturn::run (cognitive 50): UseIterableCallbackReturn::run has cognitive complexity 50 (threshold 15). Drivers by points: if/else 23 (40 pts), loops 2 (7 pts), boolean chains 3 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/use_iterable_callback_return.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"353adf41120a38c5d0aa5a6a2ae9959e72fa0859488d29dcc2d7bee99b7b9063"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::style::use_consistent_type_definitions::convert_type_alias_to_interface (cognitive 50): biome_js_analyze::lint::style::use_consistent_type_definitions::convert_type_alias_to_interface has cognitive complexity 50 (threshold 15). Drivers by points: if/else 15 (42 pts), boolean chains 5, loops 1 (3 pts) (nesting depth added 29). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_consistent_type_definitions.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"a62666d2821d515c154c84893c2534b4b1cc83d2bf005a4153345290987b5e83"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_syntax::unescape::unescape_js_string (cognitive 50): biome_js_syntax::unescape::unescape_js_string has cognitive complexity 50 (threshold 15). Drivers by points: if/else 10 (28 pts), match/switch 6 (20 pts), loops 1 (2 pts) (nesting depth added 33). 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/biome_js_syntax/src/unescape.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfdb438a756cc6f2ef3f47fc637595ac1b14220116f766dd22137be7c302fbaa"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkdownLexer::consume_token_impl (cognitive 50): MarkdownLexer::consume_token_impl has cognitive complexity 50 (threshold 15). Drivers by points: if/else 29 (38 pts), boolean chains 11, match/switch 1 (nesting depth added 9). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/lexer/mod.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ed8865de0fafa513afedb493806fb96fab878b9d02215c7b52196a39bd2cc5"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_parser::syntax::inline::parse_inline_item_list_until_impl (cognitive 50): biome_markdown_parser::syntax::inline::parse_inline_item_list_until_impl has cognitive complexity 50 (threshold 15). Drivers by points: if/else 17 (41 pts), match/switch 2 (5 pts), boolean chains 3, loops 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/inline/mod.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"205c8b88954a5105701f56a1ce3a331288a27e12457c678ee883b0cb8584e709"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_parser::syntax::inline::emphasis::match_delimiters (cognitive 50): biome_markdown_parser::syntax::inline::emphasis::match_delimiters has cognitive complexity 50 (threshold 15). Drivers by points: if/else 11 (33 pts), boolean chains 9, loops 3 (8 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/inline/emphasis.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dedb5e37f7263c4f896b1f47b752f8ffe245c4a07d143c73a9a79e2015dca95"}},{"ruleId":"D2","level":"warning","message":{"text":"RuleMover::action (cognitive 50): RuleMover::action has cognitive complexity 50 (threshold 15). Drivers by points: if/else 25 (40 pts), loops 4 (8 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_migrate/src/analyzers/rule_mover.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd7a36c94d37fade465d8d1c7da82be744021c0c7931ff85090b8a123158925"}},{"ruleId":"D2","level":"warning","message":{"text":"NoMissingScssInterpolation::run (cognitive 49): NoMissingScssInterpolation::run has cognitive complexity 49 (threshold 15). Drivers by points: if/else 18 (45 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_analyze/src/lint/nursery/no_missing_scss_interpolation.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6306f200a82a927b3b50fba394ef0342f3e8893de87875ad431574dac4db22e"}},{"ruleId":"D2","level":"warning","message":{"text":"ResolutionCtx::resolve_flow_expression (cognitive 49): ResolutionCtx::resolve_flow_expression has cognitive complexity 49 (threshold 15). Drivers by points: if/else 20 (37 pts), boolean chains 7, match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/type_inference/flow_expressions.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"f16a70836cb4647fd37c56ff0efd8d8ad5a7894e8d9d13106e6605b35e10d7f6"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_tailwind_logic::use_tailwind_shorthand_classes::analyze_tailwind_shorthand (cognitive 49): biome_tailwind_logic::use_tailwind_shorthand_classes::analyze_tailwind_shorthand has cognitive complexity 49 (threshold 15). Drivers by points: if/else 11 (28 pts), loops 6 (16 pts), boolean chains 4, match/switch 1 (nesting depth added 27). Of this number, 48 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_tailwind_logic/src/use_tailwind_shorthand_classes.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6fe08ef84212d2e043359c28f2307461a6694ad01b33e34b1ed2f312f20cc30"}},{"ruleId":"D2","level":"warning","message":{"text":"YamlLexer::consume_tag_property (cognitive 49): YamlLexer::consume_tag_property has cognitive complexity 49 (threshold 15). Drivers by points: if/else 17 (39 pts), loops 4 (9 pts), match/switch 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_yaml_parser/src/lexer/mod.rs"},"region":{"startLine":1290}}}],"partialFingerprints":{"codehealthFindingId/v1":"49fbdeca7f2100897b4c901109022ef645e46a1f25b762bbb92e0d53235bfb71"}},{"ruleId":"D2","level":"warning","message":{"text":"NoScssNullComparison::run (cognitive 48): NoScssNullComparison::run has cognitive complexity 48 (threshold 15). Drivers by points: if/else 11 (37 pts), match/switch 3 (8 pts), boolean chains 2, loops 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/biome_css_analyze/src/lint/nursery/no_scss_null_comparison.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"56681809088ab6df7e3ff621c91234ab2ab5ba5a693e254069670da471f3416a"}},{"ruleId":"D2","level":"warning","message":{"text":"HtmlLexer::consume_html_text (cognitive 48): HtmlLexer::consume_html_text has cognitive complexity 48 (threshold 15). Drivers by points: if/else 14 (39 pts), match/switch 2 (4 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 28). 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/biome_html_parser/src/lexer/mod.rs"},"region":{"startLine":1677}}}],"partialFingerprints":{"codehealthFindingId/v1":"044cb5a98dc685f0dbafc713e2df14c37aee60b396324acb66d666a6d31520a4"}},{"ruleId":"D2","level":"warning","message":{"text":"NoUselessUndefined::run (cognitive 48): NoUselessUndefined::run has cognitive complexity 48 (threshold 15). Drivers by points: if/else 16 (42 pts), boolean chains 3, loops 1 (2 pts), match/switch 1 (nesting depth added 27). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/complexity/no_useless_undefined.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"678d82e736a395ed1fa135963fea854314cfcb109e81592c08f7c926c571a627"}},{"ruleId":"D2","level":"warning","message":{"text":"NoDuplicateEnumValues::run (cognitive 48): NoDuplicateEnumValues::run has cognitive complexity 48 (threshold 15). Drivers by points: if/else 14 (41 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/no_duplicate_enum_values.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c64eabf1f35620413b933e3d879fadebe909f6c39bd567d0e011390f07de794"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_parser::syntax::inline::parse_any_inline (cognitive 48): biome_markdown_parser::syntax::inline::parse_any_inline has cognitive complexity 48 (threshold 15). Drivers by points: if/else 29 (42 pts), boolean chains 6 (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/biome_markdown_parser/src/syntax/inline/mod.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b6f17adf80b830a685c6611e6d5b14a40dc2a2f920f41bebcc9d59d4f1e904b"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceServerWithDb::open_file_internal (cognitive 48): WorkspaceServerWithDb::open_file_internal has cognitive complexity 48 (threshold 15). Drivers by points: if/else 24 (32 pts), boolean chains 12, match/switch 3 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/workspace/server.rs"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"417c230137906df0fc446c42faa33c5f438c64e96208513f4cad475c4460c43c"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_tailwind_logic::syntax_service::inspect_string_literal (cognitive 48): biome_tailwind_logic::syntax_service::inspect_string_literal has cognitive complexity 48 (threshold 15). Drivers by points: if/else 12 (36 pts), boolean chains 6, match/switch 2 (5 pts), loops 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_tailwind_logic/src/syntax_service.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba9b4010163d8a3ce313c052bca9e4af9676cb662fca051408c67c22a5212c65"}},{"ruleId":"D2","level":"warning","message":{"text":"NoImplicitCoercions::run (cognitive 47): NoImplicitCoercions::run has cognitive complexity 47 (threshold 15). Drivers by points: if/else 19 (39 pts), match/switch 4 (7 pts), boolean chains 1 (nesting depth added 23). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/complexity/no_implicit_coercions.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"f62f98e6e6d79f4f65042dc08a8ce54f0d609a42160fe846618642955b8978a2"}},{"ruleId":"D2","level":"warning","message":{"text":"NoUnusedImports::action (cognitive 47): NoUnusedImports::action has cognitive complexity 47 (threshold 15). Drivers by points: if/else 19 (39 pts), boolean chains 3, match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 22). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/no_unused_imports.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4cb8bd515a1a5b2bae6788f94f7ea45eda8157f9ddfdb39cd45eeb655dff954"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeData::from_any_js_expression (cognitive 47): TypeData::from_any_js_expression has cognitive complexity 47 (threshold 15). Drivers by points: if/else 18 (35 pts), match/switch 6 (12 pts) (nesting depth added 23). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/local_inference.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d12470dc4926a9e2d97f302c4ddb68405f659852adaf573ccff9123b7176a0"}},{"ruleId":"D2","level":"warning","message":{"text":"OrganizeImports::run (cognitive 46): OrganizeImports::run has cognitive complexity 46 (threshold 15). Drivers by points: if/else 17 (34 pts), boolean chains 11, loops 1 (nesting depth added 17). Of this number, 44 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/assist/source/organize_imports.rs"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce0bba947bd1df726cd3c447ae8d55ffa6b699ada55a22ffd41a1c55eb48583a"}},{"ruleId":"D2","level":"warning","message":{"text":"NoUnknownUnit::run (cognitive 46): NoUnknownUnit::run has cognitive complexity 46 (threshold 15). Drivers by points: if/else 6 (32 pts), match/switch 4 (10 pts), loops 1 (4 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/biome_css_analyze/src/lint/correctness/no_unknown_unit.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66f8a39e34838d850d896de78ce7b48e2d7d52f47829e6d6f424427843198c4"}},{"ruleId":"D2","level":"warning","message":{"text":"UseImportType::action (cognitive 46): UseImportType::action has cognitive complexity 46 (threshold 15). Drivers by points: if/else 13 (31 pts), loops 4 (10 pts), match/switch 3 (5 pts) (nesting depth added 26). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_import_type.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"0da4e136be1641a976a990c874cad50f3a3da012360035ad6cdbc3f24d67ac40"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::use_explicit_return_type::collect_return_statements (cognitive 46): biome_js_analyze::lint::nursery::use_explicit_return_type::collect_return_statements has cognitive complexity 46 (threshold 15). Drivers by points: if/else 12 (32 pts), match/switch 2 (6 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_explicit_return_type.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"03883b238e85e3fbc214c17ba9a800002445d1fcabaa0c662d4c9c65de5e779f"}},{"ruleId":"D2","level":"warning","message":{"text":"AssignabilityCheck::is_assignable (cognitive 46): AssignabilityCheck::is_assignable has cognitive complexity 46 (threshold 15). Drivers by points: if/else 23 (29 pts), match/switch 6 (9 pts), boolean chains 8 (nesting depth added 9). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/type_relation.rs"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb20cb682c00e3f49d487c63c0205320bba37848f294a101851fecea5aa30cdc"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_parser::syntax::thematic_break_block::is_thematic_break_pattern (cognitive 46): biome_markdown_parser::syntax::thematic_break_block::is_thematic_break_pattern has cognitive complexity 46 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 17, loops 4 (5 pts), match/switch 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/biome_markdown_parser/src/syntax/thematic_break_block.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"c830091a1401dc7219ac4995c9145eebb2ecb85c77165daa916dc4b44d02c99c"}},{"ruleId":"D2","level":"warning","message":{"text":"UseFilenamingConvention::run (cognitive 45): UseFilenamingConvention::run has cognitive complexity 45 (threshold 15). Drivers by points: if/else 25 (36 pts), match/switch 2 (5 pts), boolean chains 4 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_filenaming_convention.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"9544442d5e20afff01dc1c2b61338bbce2073204b014174f374dde43450864a4"}},{"ruleId":"D2","level":"warning","message":{"text":"DeclarationOrRuleList::parse_element (cognitive 44): DeclarationOrRuleList::parse_element has cognitive complexity 44 (threshold 15). Drivers by points: if/else 26 (39 pts), boolean chains 5 (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/biome_css_parser/src/syntax/block/declaration_or_rule_list_block.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"e551619be5381a0cad002ac6e87a19ff27661d72f79a5e28b1e3399e80dbdd5c"}},{"ruleId":"D2","level":"warning","message":{"text":"DeriveStructInput::parse (cognitive 44): DeriveStructInput::parse has cognitive complexity 44 (threshold 15). Drivers by points: match/switch 5 (19 pts), if/else 10 (13 pts), loops 5 (12 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_diagnostics_macros/src/parse.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"598e2c7f168a972497587955a886d1e98a3c841303d5c7aba9e5bf50fbb25192"}},{"ruleId":"D2","level":"warning","message":{"text":"NoDisabledAttribute::action (cognitive 44): NoDisabledAttribute::action has cognitive complexity 44 (threshold 15). Drivers by points: if/else 16 (39 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/nursery/no_disabled_attribute.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccbe47746d39b7ecd47b804e56ae84ac8070e9ecf914ed234870481a3711ed01"}},{"ruleId":"D2","level":"warning","message":{"text":"NoNegationInEqualityCheck::action (cognitive 44): NoNegationInEqualityCheck::action has cognitive complexity 44 (threshold 15). Drivers by points: loops 11 (22 pts), if/else 11 (17 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 18). 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/biome_js_analyze/src/lint/nursery/no_negation_in_equality_check.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df43502f56e7fc58651c352a4a632fc46705529005470929476f75913ea91b3"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::suspicious::no_unnecessary_conditions::check_condition_necessity (cognitive 44): biome_js_analyze::lint::suspicious::no_unnecessary_conditions::check_condition_necessity has cognitive complexity 44 (threshold 15). Drivers by points: if/else 17 (37 pts), match/switch 3 (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/biome_js_analyze/src/lint/suspicious/no_unnecessary_conditions.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f79d2062779f7c15dfa52a3eaa86b1536a9aab5277517e93c8d25969c62f99"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::suspicious::use_iterable_callback_return::get_function_returns_info (cognitive 44): biome_js_analyze::lint::suspicious::use_iterable_callback_return::get_function_returns_info has cognitive complexity 44 (threshold 15). Drivers by points: if/else 10 (31 pts), match/switch 2 (7 pts), loops 3 (5 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/biome_js_analyze/src/lint/suspicious/use_iterable_callback_return.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c985aae85c58791a929c59fa7bf4ed5ac22c005bae0d633b6bbd403406fe1c"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticModelBuilder::push_event (cognitive 44): SemanticModelBuilder::push_event has cognitive complexity 44 (threshold 15). Drivers by points: if/else 18 (38 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 23). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_semantic/src/semantic_model/builder.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b26a0a7ce3353bb3d6e413679bd6e9dd774e7349db57bed9e2cfe1f3490f263"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_parser::syntax::parse_inline_item_list_with_task_list_item (cognitive 44): biome_markdown_parser::syntax::parse_inline_item_list_with_task_list_item has cognitive complexity 44 (threshold 15). Drivers by points: if/else 15 (31 pts), boolean chains 9, loops 2 (4 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/mod.rs"},"region":{"startLine":1510}}}],"partialFingerprints":{"codehealthFindingId/v1":"52da02658078903fb699cac6bc0cf867dbeaf76c668897d021216dd09e9ef24f"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_parser::syntax::inline::emphasis::collect_delimiters (cognitive 44): biome_markdown_parser::syntax::inline::emphasis::collect_delimiters has cognitive complexity 44 (threshold 15). Drivers by points: if/else 17 (30 pts), boolean chains 9, loops 3 (5 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/inline/emphasis.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bab64a329e346a488855775d3b88b1a32a919577168bbb97be59a0e0ec619e3"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_parser::syntax::inline::emphasis::parse_emphasis_from_context (cognitive 44): biome_markdown_parser::syntax::inline::emphasis::parse_emphasis_from_context has cognitive complexity 44 (threshold 15). Drivers by points: if/else 18 (27 pts), boolean chains 10, loops 3 (4 pts), match/switch 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/biome_markdown_parser/src/syntax/inline/emphasis.rs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d4f9a2428752a872ee5ad89ff2489bc18e78f2263397714d9adfabee1ac8e76"}},{"ruleId":"D2","level":"warning","message":{"text":"Collator::cmp (cognitive 44): Collator::cmp has cognitive complexity 44 (threshold 15). Drivers by points: if/else 8 (30 pts), match/switch 3 (10 pts), loops 2 (4 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_string_case/src/lib.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc2f9278a4253807af4d5c5d0a6d7f5c5d9ce5d916c500e29a6619c1ad1932ed"}},{"ruleId":"D2","level":"warning","message":{"text":"UseConsistentEnumValueType::run (cognitive 43): UseConsistentEnumValueType::run has cognitive complexity 43 (threshold 15). Drivers by points: if/else 19 (42 pts), loops 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_consistent_enum_value_type.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"0230f96eeb20a97e82c30a422cdc33ab7952610ca77647831eae96ee90e6578b"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_rule_options::shared::restricted_regex::validate_restricted_regex (cognitive 43): biome_rule_options::shared::restricted_regex::validate_restricted_regex has cognitive complexity 43 (threshold 15). Drivers by points: if/else 8 (23 pts), match/switch 3 (11 pts), loops 2 (6 pts), boolean chains 3 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_rule_options/src/shared/restricted_regex.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab510cea903abc30c539b225db6042619a75459f9f30328748de30ce2b9d464"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_tailwind_logic::class_category::utility_category (cognitive 43): biome_tailwind_logic::class_category::utility_category has cognitive complexity 43 (threshold 15). Drivers by points: if/else 22 (31 pts), boolean chains 12 (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/biome_tailwind_logic/src/class_category.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9157e9c98e49fb226b25c9e0b896e77c999b7fa9ed6e434b96b0c723b616b82"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_vue_semantic::semantic_model::sfc_model (cognitive 43): biome_vue_semantic::semantic_model::sfc_model has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (26 pts), loops 5 (8 pts), boolean chains 5, match/switch 3 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_vue_semantic/src/semantic_model/mod.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad65acf38eac0f0e3ccdbbdd6ea428abcee6b1ccf77753ecdc136e772e5b57f"}},{"ruleId":"D2","level":"warning","message":{"text":"FitsMeasurer::fits_element (cognitive 42): FitsMeasurer::fits_element has cognitive complexity 42 (threshold 15). Drivers by points: if/else 16 (29 pts), match/switch 6 (12 pts), boolean chains 1 (nesting depth added 19). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_formatter/src/printer/mod.rs"},"region":{"startLine":1289}}}],"partialFingerprints":{"codehealthFindingId/v1":"4914be1ceeaff4ac93ffd04097153dc09de18bd6860a2589c8880c78c229398f"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkdownLexer::is_in_list_marker_whitespace (cognitive 42): MarkdownLexer::is_in_list_marker_whitespace has cognitive complexity 42 (threshold 15). Drivers by points: if/else 18 (30 pts), loops 4 (6 pts), boolean chains 4, match/switch 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/lexer/mod.rs"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"14278b870440bdb198fc6d36b875f26d67421ec7e82ebbc060d93f70aa647894"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_parser::syntax::list::classify_blank_line (cognitive 42): biome_markdown_parser::syntax::list::classify_blank_line has cognitive complexity 42 (threshold 15). Drivers by points: if/else 16 (32 pts), boolean chains 5, loops 3 (5 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/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":3184}}}],"partialFingerprints":{"codehealthFindingId/v1":"da4cc99fc8d4f60931424ea048b37891fce107f107fc9c74e9297b5841fe6d3d"}},{"ruleId":"D2","level":"warning","message":{"text":"TurboJson::env_vars_cache (cognitive 42): TurboJson::env_vars_cache has cognitive complexity 42 (threshold 15). Drivers by points: loops 8 (24 pts), if/else 10 (18 pts) (nesting depth added 24). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_package/src/node_js_package/turbo_json.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"a662e5e34e7bfd66aacb53932dde5aaaedae6f7b0e6bf1f66e80d7c557b17f42"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_vue_semantic::semantic_model::snippets::class_entries_of (cognitive 42): biome_vue_semantic::semantic_model::snippets::class_entries_of has cognitive complexity 42 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 5 (10 pts), match/switch 3 (8 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/biome_vue_semantic/src/semantic_model/snippets.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bfaaa9bab286cbaa82471df5c9db52e3f6f734ce99f28eea1c795e48f7872d9"}},{"ruleId":"D2","level":"warning","message":{"text":"Printer::print_fill_entries (cognitive 41): Printer::print_fill_entries has cognitive complexity 41 (threshold 15). Drivers by points: if/else 13 (29 pts), loops 3 (6 pts), match/switch 2 (5 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/biome_formatter/src/printer/mod.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d28b30c187257c69e7013d4ce6cf89fea996e510dc3e019d7dfe373fd3dedfa"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatSkippedTokenTrivia::fmt_skipped (cognitive 41): FormatSkippedTokenTrivia::fmt_skipped has cognitive complexity 41 (threshold 15). Drivers by points: match/switch 7 (20 pts), if/else 11 (18 pts), loops 2 (3 pts) (nesting depth added 21). 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/biome_formatter/src/trivia.rs"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e56124d3425d993c6f602c4eaebfe66c2e272c11b2f6dd8eb38a7ecebaddec7"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_grit_parser::parser::patterns::parse_pattern_with_precedence (cognitive 41): biome_grit_parser::parser::patterns::parse_pattern_with_precedence has cognitive complexity 41 (threshold 15). Drivers by points: match/switch 9 (24 pts), if/else 8 (9 pts), boolean chains 7, loops 1 (nesting depth added 16). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_parser/src/parser/patterns.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"017629e3f3dd45ea926b5beee16ca8cc067a2a8951c6495bb377f979fff1f85f"}},{"ruleId":"D2","level":"warning","message":{"text":"NoTripleSlashReference::run (cognitive 41): NoTripleSlashReference::run has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (28 pts), match/switch 2 (7 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_triple_slash_reference.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc0a6db481a785980b972ea357c29a70f332ef04da14fa55222cc726fbb24a3"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::style::use_global_this::check_expression (cognitive 41): biome_js_analyze::lint::style::use_global_this::check_expression has cognitive complexity 41 (threshold 15). Drivers by points: if/else 9 (28 pts), boolean chains 10, match/switch 2 (3 pts) (nesting depth added 20). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_global_this.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd47638598e2d6bc7910949c33d02594de1587192ce867ef29cc078b02d6d6cd"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_module_graph::db::type_inference::lookup::find_member_key_type_with_resolver (cognitive 41): biome_module_graph::db::type_inference::lookup::find_member_key_type_with_resolver has cognitive complexity 41 (threshold 15). Drivers by points: if/else 14 (35 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/type_inference/lookup.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b2d17b87fe97292abb18ba52590e95952553ee7184f00f2a00828b4db8215c"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceServerWithDb::update_settings (cognitive 41): WorkspaceServerWithDb::update_settings has cognitive complexity 41 (threshold 15). Drivers by points: if/else 19 (34 pts), match/switch 1 (3 pts), boolean chains 2, loops 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/biome_service/src/workspace/server.rs"},"region":{"startLine":2985}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c80c9aef4d6b9852451ca92af284d1d89d4a0c63b7ab3e10c4a9ce0181fedc6"}},{"ruleId":"D2","level":"warning","message":{"text":"DecodedCursor::next (cognitive 40): DecodedCursor::next has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (31 pts), boolean chains 5, loops 2 (4 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_syntax/src/css_escape.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"7298698f7004716e5d9d0f938e27cc65cb3d6e4b36ee8fe189b40f6572657205"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_diagnostics::display::diff::print_full_diff (cognitive 40): biome_diagnostics::display::diff::print_full_diff has cognitive complexity 40 (threshold 15). Drivers by points: if/else 13 (23 pts), loops 3 (9 pts), boolean chains 4, match/switch 2 (4 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_diagnostics/src/display/diff.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"a350d51a586c14a5d66a9a8ba63207838ca5ebdef2040e32fecd4608cc1e362a"}},{"ruleId":"D2","level":"warning","message":{"text":"EmbeddedBindingsBuilder::visit_js_export (cognitive 40): EmbeddedBindingsBuilder::visit_js_export has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (28 pts), loops 3 (7 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_embeds/src/visitor.rs"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba1f435c16c3078f99e7b482a00a4a673b72eb7010375f10ef9629bd6bd0c6db"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrowChain::fmt (cognitive 40): ArrowChain::fmt has cognitive complexity 40 (threshold 15). Drivers by points: if/else 21 (32 pts), boolean chains 6, loops 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/js/expressions/arrow_function_expression.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"6750c7f0fbc845adee1da7d5b9ce9dd814269036d54a77ef104ccf6e1ab18a3a"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_syntax::parentheses::expression::is_first_in_statement (cognitive 40): biome_js_syntax::parentheses::expression::is_first_in_statement has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (30 pts), match/switch 3 (8 pts), boolean chains 1, 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/biome_js_syntax/src/parentheses/expression.rs"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"391999c21597eefee3005f3fdc7f948bf37b57f124f8638285c79d544ebf4e2c"}},{"ruleId":"D2","level":"warning","message":{"text":"StringificationAnalyzer::base_stringification (cognitive 40): StringificationAnalyzer::base_stringification has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (26 pts), match/switch 4 (12 pts), boolean chains 1, loops 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/stringification.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff5cb241e2837ffcd77bbdb824e3a3ae34f742f2e32b3622c994b5ad661dcb36"}},{"ruleId":"D2","level":"warning","message":{"text":"NoDuplicateDependencies::run (cognitive 40): NoDuplicateDependencies::run has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 6 (13 pts), match/switch 1 (2 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_json_analyze/src/lint/suspicious/no_duplicate_dependencies.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"df79571647578ad0f54463f173e3a7e26abefedc088bdb230cc2e1266658bdb2"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_service::file_handlers::html::parse_embedded_nodes::parse_matched_embed (cognitive 40): biome_service::file_handlers::html::parse_embedded_nodes::parse_matched_embed has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (26 pts), match/switch 5 (13 pts), boolean chains 1 (nesting depth added 20). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/html/parse_embedded_nodes.rs"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"599317343b486999fb408d8e6c93eea20eec2f5fbf87ee0705e40c31e0b6f942"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_service::workspace_types::generate_type (cognitive 40): biome_service::workspace_types::generate_type has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (30 pts), loops 2 (5 pts), boolean chains 4, match/switch 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/workspace_types.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b7e3f0f165dcc4e366a45cb076f7d02a915a6e3c0ad7ef861b2eb05a75015ca"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatYamlBlockMapExplicitEntry::fmt_fields (cognitive 40): FormatYamlBlockMapExplicitEntry::fmt_fields has cognitive complexity 40 (threshold 15). Drivers by points: if/else 17 (27 pts), boolean chains 9, match/switch 2 (3 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/biome_yaml_formatter/src/yaml/auxiliary/block_map_explicit_entry.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b783047732156a5e3b8c947bc380b3b24dbb44c3a35a2360d227b6f1638c280"}},{"ruleId":"D2","level":"warning","message":{"text":"Analyzer::run_with_optional_inspector (cognitive 39): Analyzer::run_with_optional_inspector has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (29 pts), loops 7 (10 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_analyze/src/lib.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6652e738748f6076fb8b8f304a38af552e67a4ff1cfb9726ecf77fa32919da3"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticModelBuilder::push_event (cognitive 39): SemanticModelBuilder::push_event has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (34 pts), loops 1 (3 pts), boolean chains 1, match/switch 1 (nesting depth added 21). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_semantic/src/semantic_model/builder.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3207c8f817db9331e3839d7af41aff4add56d03a03f9d22ee381f5000ce13a4"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_grit_patterns::grit_binding::are_equivalent (cognitive 39): biome_grit_patterns::grit_binding::are_equivalent has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (19 pts), match/switch 4 (14 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_patterns/src/grit_binding.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"b82cc58065580f41827c62a048957208f1460ea2e884e94346b58e8598023533"}},{"ruleId":"D2","level":"warning","message":{"text":"LogicalAndChain::optional_chain_expression_nodes (cognitive 39): LogicalAndChain::optional_chain_expression_nodes has cognitive complexity 39 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 5 (15 pts), loops 3 (7 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/complexity/use_optional_chain.rs"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"afa21207ab7f1e55ea58c5bfba87a27c3d8e5fb54d70842e21e4001877b53fa6"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::use_valid_character_comparison::is_longer_than_one_code_unit (cognitive 39): biome_js_analyze::lint::nursery::use_valid_character_comparison::is_longer_than_one_code_unit has cognitive complexity 39 (threshold 15). Drivers by points: if/else 8 (25 pts), match/switch 3 (9 pts), loops 2 (5 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_valid_character_comparison.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"1652f489338e3320e1a9808af2765326a09d49d5fcec61c50c8351f2dde70cee"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::suspicious::no_fallthrough_switch_clause::register_fallthrough_switch_clauses (cognitive 39): biome_js_analyze::lint::suspicious::no_fallthrough_switch_clause::register_fallthrough_switch_clauses has cognitive complexity 39 (threshold 15). Drivers by points: if/else 7 (29 pts), loops 3 (5 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/no_fallthrough_switch_clause.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"26be9715e4c478d33266ad6c417a81227eb6639654762a4bb45cbc180bc34fad"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::suspicious::no_redeclare::check_redeclarations_in_single_scope (cognitive 39): biome_js_analyze::lint::suspicious::no_redeclare::check_redeclarations_in_single_scope has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (31 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/no_redeclare.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d44519ddaf8da00b7e8ea49c7721c0a9892089267ac19ba3664c45087d12fee"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticEventExtractor::enter_identifier_reference (cognitive 39): SemanticEventExtractor::enter_identifier_reference has cognitive complexity 39 (threshold 15). Drivers by points: if/else 13 (30 pts), match/switch 4 (9 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_semantic/src/events.rs"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb104d320bac1aee908d1d8038bad90fdc39335a9bd6bd67a759a28062fa1a1"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_lsp::utils::code_fix_to_lsp (cognitive 39): biome_lsp::utils::code_fix_to_lsp has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (22 pts), match/switch 5 (13 pts), boolean chains 4 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/utils.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b0a37b1e02f00bb5d9dd3d682d702e21762e0cb23ee15965563769a796b249"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_parser::to_html::strip_quote_prefixes (cognitive 39): biome_markdown_parser::to_html::strip_quote_prefixes has cognitive complexity 39 (threshold 15). Drivers by points: if/else 8 (29 pts), boolean chains 4, loops 2 (3 pts), match/switch 1 (3 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/biome_markdown_parser/src/to_html.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"898afa293d7f2368e4bb3420569a3063366769fe07e827505e8b01c00881493d"}},{"ruleId":"D2","level":"warning","message":{"text":"PackageJsonVisitor::visit_map (cognitive 39): PackageJsonVisitor::visit_map has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (35 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_package/src/node_js_package/package_json.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"957363c72897b95edd89099782a9c12030292bfb9e5e4abb45f828dde5b4c5c3"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_vue_semantic::semantic_model::references::collect_markup_references (cognitive 39): biome_vue_semantic::semantic_model::references::collect_markup_references has cognitive complexity 39 (threshold 15). Drivers by points: if/else 8 (23 pts), match/switch 3 (10 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_vue_semantic/src/semantic_model/references.rs"},"region":{"startLine":1249}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9cb88af5a02d5ad978e24c76379cae6d2c1331c0b3974435a04fb4e5dcb18b1"}},{"ruleId":"D2","level":"warning","message":{"text":"OrganizeImports::diagnostic (cognitive 38): OrganizeImports::diagnostic has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (24 pts), match/switch 3 (7 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/assist/source/organize_imports.rs"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ef2a0797d29756fa00bd849804ffaa2ea369b895a57fa8c422e6acfacc4ab4"}},{"ruleId":"D2","level":"warning","message":{"text":"UnreachableRanges::propagate_ranges (cognitive 38): UnreachableRanges::propagate_ranges has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (32 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/no_unreachable.rs"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22121129f2f7c464a7262d3d4d3e8b5bba1c7f0df764db256803efbeebea067"}},{"ruleId":"D2","level":"warning","message":{"text":"UseHookAtTopLevel::run (cognitive 38): UseHookAtTopLevel::run has cognitive complexity 38 (threshold 15). Drivers by points: if/else 15 (27 pts), boolean chains 5, loops 2 (5 pts), match/switch 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/use_hook_at_top_level.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7a2d49a46c6967a3665bc9dd15f38c9abc436863d5a1af924bccbbf70b4118"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::complexity::no_playwright_useless_await::is_sync_expect_call (cognitive 38): biome_js_analyze::lint::complexity::no_playwright_useless_await::is_sync_expect_call has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (27 pts), match/switch 3 (6 pts), boolean chains 5 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/complexity/no_playwright_useless_await.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"955327c58bd41f53e0733a26a4f2b85088d7ece109b1418d73f86d81b53d72af"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::suspicious::no_misleading_character_class::diagnostic_regex_class (cognitive 38): biome_js_analyze::lint::suspicious::no_misleading_character_class::diagnostic_regex_class has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (29 pts), loops 2 (4 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/no_misleading_character_class.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f7d0ad7c7ac923201413048bd7ed4c0ac8f9cb73509ead0c0834329df34425"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_parser::syntax::function::is_parenthesized_arrow_function_expression_impl (cognitive 38): biome_js_parser::syntax::function::is_parenthesized_arrow_function_expression_impl has cognitive complexity 38 (threshold 15). Drivers by points: match/switch 7 (19 pts), if/else 10 (18 pts), boolean chains 1 (nesting depth added 20). 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/biome_js_parser/src/syntax/function.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a705a3a6a1e86a93f4df8206e6a1deffa9aa3510c1e69781113c1b65ae8b9c"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatMdInlineItemList::fmt_inside_list (cognitive 38): FormatMdInlineItemList::fmt_inside_list has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (33 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_formatter/src/markdown/lists/inline_item_list.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"42055c83f2ad0380093df5f9a989c40b00955ed511774aa9b21ae0c27e50bb0b"}},{"ruleId":"D2","level":"warning","message":{"text":"PackageJson::parse_pnpm_workspace_catalog (cognitive 38): PackageJson::parse_pnpm_workspace_catalog has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (31 pts), loops 2 (5 pts), match/switch 1 (2 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_package/src/node_js_package/package_json.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"e57c395400097a4948ba49e497edc0f68fd826fcf6b55c5947acb74d01c92b5f"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask_codegen::generate_css_baseline::extract_css_features (cognitive 38): xtask_codegen::generate_css_baseline::extract_css_features has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (33 pts), loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/generate_css_baseline.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"333bf84c4f202e3b8cab8fd2cc03d5518dc33fa7c1da22a3a3cc15cde2bede68"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_cli::runner::impls::finalizers::default::print_to_reporter (cognitive 37): biome_cli::runner::impls::finalizers::default::print_to_reporter has cognitive complexity 37 (threshold 15). Drivers by points: if/else 22 (33 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/runner/impls/finalizers/default.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42bc68f28a56a43f98038e5cc7ea60a942c9f9ea40560937c7adaa9696152a8"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_css_syntax::property_syntax::matcher::matches_component (cognitive 37): biome_css_syntax::property_syntax::matcher::matches_component has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (27 pts), loops 3 (7 pts), boolean chains 2, match/switch 1 (nesting depth added 22). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_syntax/src/property_syntax/matcher.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ea215df562fb32263d92eaca23b6cdc0e3b4efee15f33999848a54a534026e"}},{"ruleId":"D2","level":"warning","message":{"text":"LogicalAndChain::optional_chain_expression_nodes_from_negated_or (cognitive 37): LogicalAndChain::optional_chain_expression_nodes_from_negated_or has cognitive complexity 37 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 4 (13 pts), loops 3 (7 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/complexity/use_optional_chain.rs"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d2fbafcf0f82b885bb4fde8d092cd9533e0b7595535e152ce5489ff51a28cf"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::use_svelte_reactive_classes::is_exported_value (cognitive 37): biome_js_analyze::lint::nursery::use_svelte_reactive_classes::is_exported_value has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (29 pts), match/switch 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_svelte_reactive_classes.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9019a241cffd4268f6d0e694ea4a8f8b4a8e287b525e3334db8df8eff730de3"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::suspicious::no_parameters_only_used_in_recursion::traces_to_parameter (cognitive 37): biome_js_analyze::lint::suspicious::no_parameters_only_used_in_recursion::traces_to_parameter has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (35 pts), boolean chains 1, loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/no_parameters_only_used_in_recursion.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c54dc9067d2193ff9ade3d9e569f87df2513742f57a861716e49abc44721897"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_module_graph::db::queries::find_js_exported_symbol (cognitive 37): biome_module_graph::db::queries::find_js_exported_symbol has cognitive complexity 37 (threshold 15). Drivers by points: if/else 6 (18 pts), match/switch 4 (13 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/queries.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"0afdf0019acc0057298be03cbc6bcfd73a144d5c9868c134c19eda1184bef9a4"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_module_graph::db::queries::type_inference::calls::implementation::matched_parameter_types (cognitive 37): biome_module_graph::db::queries::type_inference::calls::implementation::matched_parameter_types has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (33 pts), boolean chains 2, loops 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/queries/type_inference/calls/implementation.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"023afc94aad455e0ca5042faed9934d8df84070cd834395651b58ce4905cf6d1"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_service::file_handlers::css::go_to::resolve_definition (cognitive 37): biome_service::file_handlers::css::go_to::resolve_definition has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 4 (12 pts), boolean chains 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/css/go_to.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"8846f61012f17e8c843da63e6694efa12e9dcbc116a7e5564922ee941cd890f3"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobalIds::assign_unique_symbols (cognitive 37): GlobalIds::assign_unique_symbols has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (26 pts), loops 3 (6 pts), match/switch 2 (5 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/generate_global_types/lower/ids.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"47aa6047cea3ec186286a76ba2781fc33851fc9f60d6a016498f3b8e55f28afa"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask_codegen::formatter::get_node_concept (cognitive 37): xtask_codegen::formatter::get_node_concept has cognitive complexity 37 (threshold 15). Drivers by points: match/switch 8 (23 pts), boolean chains 10, if/else 4 (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":"xtask/codegen/src/formatter.rs"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c1b7faab944ad0943e3c50b31572b18f3d90ec9ce07ec02d00fac5bfb0fdfd"}},{"ruleId":"D2","level":"warning","message":{"text":"RuleSelector::from_str (cognitive 36): RuleSelector::from_str has cognitive complexity 36 (threshold 15). Drivers by points: if/else 27 (36 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/biome_configuration/src/analyzer/mod.rs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbcb4d6df88474077a66bbc03f10025f9a004f162755c3679857475d4d4c7a3e"}},{"ruleId":"D2","level":"warning","message":{"text":"Function::evaluate (cognitive 36): Function::evaluate has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (24 pts), boolean chains 6, loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_atomic_updates.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"1249059b0f952b5f1d7c06d241b358f7b869f9c0d663fc0420d27cd177c10f83"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::correctness::use_exhaustive_dependencies::is_stable_binding (cognitive 36): biome_js_analyze::lint::correctness::use_exhaustive_dependencies::is_stable_binding has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (30 pts), match/switch 3 (6 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/biome_js_analyze/src/lint/correctness/use_exhaustive_dependencies.rs"},"region":{"startLine":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"d22fd80b5ee88fb28ecc8c4394857a900bf9f964ff60e99a5683b3fbedd51cfe"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::no_tanstack_query_void_query_fn::body_gives_undefined (cognitive 36): biome_js_analyze::lint::nursery::no_tanstack_query_void_query_fn::body_gives_undefined has cognitive complexity 36 (threshold 15). Drivers by points: if/else 5 (22 pts), match/switch 2 (7 pts), loops 3 (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/biome_js_analyze/src/lint/nursery/no_tanstack_query_void_query_fn.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"6168b3dbf373cf03be3bcb178f131d98e18528badb1fa2633062b0344fbbffd3"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::style::use_export_type::export_named_fix (cognitive 36): biome_js_analyze::lint::style::use_export_type::export_named_fix has cognitive complexity 36 (threshold 15). Drivers by points: if/else 17 (32 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_export_type.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea36e349bc75a5db6dba6cb6d20f01f18d24dbfbe5c7fe13141fe8ca7abcfb1"}},{"ruleId":"D2","level":"warning","message":{"text":"JsLexer::lex_token (cognitive 36): JsLexer::lex_token has cognitive complexity 36 (threshold 15). Drivers by points: if/else 16 (29 pts), boolean chains 4, match/switch 2 (3 pts) (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/biome_js_parser/src/lexer/mod.rs"},"region":{"startLine":2065}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab0c065b5fecf0fb636c4c8c7135e105711655258186f6ebb747ff0109adfb15"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_syntax::numbers::canonicalize_js_bigint_literal (cognitive 36): biome_js_syntax::numbers::canonicalize_js_bigint_literal has cognitive complexity 36 (threshold 15). Drivers by points: if/else 18 (26 pts), boolean chains 5, loops 3, match/switch 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/biome_js_syntax/src/numbers.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb23b8a66caea8e2dfffeb13d1c6004e1597bc68b4ece4537c711f04717a797b"}},{"ruleId":"D2","level":"warning","message":{"text":"Session::load_biome_configuration_file_internal (cognitive 36): Session::load_biome_configuration_file_internal has cognitive complexity 36 (threshold 15). Drivers by points: if/else 18 (21 pts), match/switch 6 (9 pts), loops 2 (4 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/biome_lsp/src/session.rs"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"29029f556e26dad36f18dc3074da9400b0ead1d367999a86d36dc88dbc829729"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatMdBlockList::fmt (cognitive 36): FormatMdBlockList::fmt has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (28 pts), boolean chains 3, match/switch 1 (3 pts), loops 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_formatter/src/markdown/lists/block_list.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc226b95e971c1fbc8f6eebbbe1aa8d38b4e6817318b857a901fd5a9266fa137"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_parser::syntax::inline::links::parse_inline_link_destination_tokens (cognitive 36): biome_markdown_parser::syntax::inline::links::parse_inline_link_destination_tokens has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (28 pts), loops 3 (4 pts), boolean chains 2, match/switch 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/biome_markdown_parser/src/syntax/inline/links.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad4dfbc741efb30bedab99d70aa165b8aa8f4b678c2e4692343f015a161082e1"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectScanComputer::compute (cognitive 36): ProjectScanComputer::compute has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (25 pts), loops 3 (7 pts), boolean chains 4 (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/biome_service/src/configuration.rs"},"region":{"startLine":1696}}}],"partialFingerprints":{"codehealthFindingId/v1":"724b1d44895432d57640f1639000da4a2560b6bd010c57f9c6d1070b2c359bd8"}},{"ruleId":"D2","level":"warning","message":{"text":"MigrationResults::advices (cognitive 35): MigrationResults::advices has cognitive complexity 35 (threshold 15). Drivers by points: if/else 17 (29 pts), match/switch 1 (3 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/execute/migrate/eslint_to_biome.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf6d40288d55dcb26e0c6bda3add09f4fbb0fe418021e25e5a20b88d03c0c5dd"}},{"ruleId":"D2","level":"warning","message":{"text":"StructFieldAttrs::try_from (cognitive 35): StructFieldAttrs::try_from has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (27 pts), match/switch 2 (6 pts), boolean chains 1, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_deserialize_macros/src/deserializable_derive/struct_field_attrs.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d543b30f7a4b7a1f9a2fce356174f5aacf237132c1003acba5a7b3da30aca8"}},{"ruleId":"D2","level":"warning","message":{"text":"NoFlatMapIdentity::run (cognitive 35): NoFlatMapIdentity::run has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (23 pts), match/switch 4 (12 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/complexity/no_flat_map_identity.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ae4c86e407e1f7de2b817cd99b1b06fa89ad493b8cbdc2e86a971af580d69cf"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::no_unsafe_return::expected_type_at (cognitive 35): biome_js_analyze::lint::nursery::no_unsafe_return::expected_type_at has cognitive complexity 35 (threshold 15). Drivers by points: if/else 19 (27 pts), match/switch 3 (5 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/biome_js_analyze/src/lint/nursery/no_unsafe_return.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af403749e9b6b0805b32622499da79238f760559e30cba8ac6f6b7b6adeb941"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::style::use_template::template_expression_from_binary_expression (cognitive 35): biome_js_analyze::lint::style::use_template::template_expression_from_binary_expression has cognitive complexity 35 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 3 (9 pts), match/switch 3 (8 pts), boolean chains 2 (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/biome_js_analyze/src/lint/style/use_template.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"e494e21e52fe20929f9ecaee6c231dab9c88600edbd948ae9a4b002d1ae90e27"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::suspicious::no_control_characters_in_regex::collect_control_characters (cognitive 35): biome_js_analyze::lint::suspicious::no_control_characters_in_regex::collect_control_characters has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (26 pts), match/switch 2 (5 pts), boolean chains 3, loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/no_control_characters_in_regex.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"edaa1cf57b3fbbc4ed2ba15a897b5cd5d844d86dd2958c8e28cf5457a389cfcc"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatJsAnyConditionalRule::should_extra_indent (cognitive 35): FormatJsAnyConditionalRule::should_extra_indent has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (26 pts), match/switch 5 (8 pts), loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/utils/conditional.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecca5406aaf31e11d0ed638689379121c7b602124f902d1c88fa3d1c09d81143"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_parser::syntax::class::parse_class_member_impl (cognitive 35): biome_js_parser::syntax::class::parse_class_member_impl has cognitive complexity 35 (threshold 15). Drivers by points: if/else 19 (31 pts), boolean chains 3, match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_parser/src/syntax/class.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"6232657738dd2ecf4032fe20cd00b81086c1d9a0bd0b5a06d08d0d6ff8ea9357"}},{"ruleId":"D2","level":"warning","message":{"text":"JsAstNode::update_field (cognitive 35): JsAstNode::update_field has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (26 pts), match/switch 3 (6 pts), boolean chains 3 (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/biome_js_runtime/src/ast.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d43db175f0dfcab528005665265f7ccd340fa039c8ddf36ead8d6e0107d588"}},{"ruleId":"D2","level":"warning","message":{"text":"JsModuleInfoCollector::infer_type (cognitive 35): JsModuleInfoCollector::infer_type has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (23 pts), match/switch 3 (9 pts), boolean chains 2, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/js_module_info/collector.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c11d478ef55f96a8b5a42f6b37ac08b30b2192212375b615fff004c86f5df4"}},{"ruleId":"D2","level":"warning","message":{"text":"JsModuleVisitor::visit_binding_pattern (cognitive 35): JsModuleVisitor::visit_binding_pattern has cognitive complexity 35 (threshold 15). Drivers by points: if/else 6 (22 pts), match/switch 3 (7 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 22). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/js_module_info/visitor.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"daf9c4f379882fe5b1b96c95048bebb9746cca92fe5a9ab54c3b3dc3b6a1c2f0"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfigurationExtendsLoader::collect_manifest_configs (cognitive 35): ConfigurationExtendsLoader::collect_manifest_configs has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (27 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/configuration.rs"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fad8bc6af6400d4ee0eff07fd2d188d3993727e899852c63467f2d7f6f69b95"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_vue_semantic::semantic_model::references::collect_template_references (cognitive 35): biome_vue_semantic::semantic_model::references::collect_template_references has cognitive complexity 35 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 5 (13 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_vue_semantic/src/semantic_model/references.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ced588af7fe833e2fc0ffacebef6fd7b562d5862901d5a11597c6b5495ead3c"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask_codegen::generate_schema::rename_references_in_object (cognitive 35): xtask_codegen::generate_schema::rename_references_in_object has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 5 (10 pts), boolean chains 2, 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":"xtask/codegen/src/generate_schema.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc21d115aa671dbe5c7095086b4e57b9bfd40d7848f8d16a35cf338517508edd"}},{"ruleId":"D2","level":"warning","message":{"text":"HtmlLexer::consume_restricted_single_text_expression (cognitive 34): HtmlLexer::consume_restricted_single_text_expression has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (23 pts), boolean chains 8, match/switch 1 (2 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_parser/src/lexer/mod.rs"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ef024b91bc31525a2084941cd8bd7c15199d861e0fcff2b788743a7e5fbf04"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::utils::function_return::invalid_returns (cognitive 34): biome_js_analyze::utils::function_return::invalid_returns has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (25 pts), loops 3 (5 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/utils/function_return.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a89126395dd24829f3274002fa3e3771ae8c315539e63b4477266e4ffd4b532"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_type_info::return_type_relation::is_nonunion_wider (cognitive 34): biome_js_type_info::return_type_relation::is_nonunion_wider has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (24 pts), match/switch 2 (5 pts), boolean chains 4, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/return_type_relation.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"f851b5e13cd6b0b5fb3198595b742e72cf19227eda176a0857e7d3a245d4d9b0"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatGfmTableRowWithOptions::fmt (cognitive 34): FormatGfmTableRowWithOptions::fmt has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (21 pts), match/switch 3 (9 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_formatter/src/gfm/auxiliary/table_row.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"827b6f4b3f4fcc85dadff0bea64699ffbde4ade8a0534e821b8c83b08a17cbfd"}},{"ruleId":"D2","level":"warning","message":{"text":"JsModuleInfoCollector::collect_exports_from (cognitive 34): JsModuleInfoCollector::collect_exports_from has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (26 pts), loops 2 (5 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/js_module_info/collector.rs"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ebee5aa516a7f64409ef64ef5b2042a9065cb1b174a961ce8896359d897a3d6"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatYamlDocument::fmt_fields (cognitive 34): FormatYamlDocument::fmt_fields has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (25 pts), boolean chains 4, loops 2 (4 pts), match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_yaml_formatter/src/yaml/auxiliary/document.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a9df2fe35034f9ab022837060ae97879fe0211ff093c4cffddfbad5e3fec832"}},{"ruleId":"D2","level":"warning","message":{"text":"AriaRoles::get_implicit_role (cognitive 33): AriaRoles::get_implicit_role has cognitive complexity 33 (threshold 15). Drivers by points: match/switch 9 (17 pts), if/else 8 (15 pts), boolean chains 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/biome_aria/src/roles.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"6843c74cecbf7e3959c98ceddf4faae79981af34edd2f18ef938f10b190210f0"}},{"ruleId":"D2","level":"warning","message":{"text":"GritNodePattern::execute (cognitive 33): GritNodePattern::execute has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (19 pts), match/switch 4 (11 pts), boolean chains 2, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_patterns/src/grit_node_patterns.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a85f4ac9fd888a2a3eb5e51320d2fc02e73f92836ce1989d187946f9a47b81a"}},{"ruleId":"D2","level":"warning","message":{"text":"SortableHtmlAttribute::category (cognitive 33): SortableHtmlAttribute::category has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 6 (16 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/biome_html_analyze/src/assist/source/use_sorted_attributes.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a2dc8920d3004ab2a97a5f47aeea22a8bab278b4631c68bad9b037df3ca00de"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::correctness::no_unreachable::traverse_cfg (cognitive 33): biome_js_analyze::lint::correctness::no_unreachable::traverse_cfg has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (23 pts), boolean chains 4, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/no_unreachable.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9808d6cc2936e29aafc375f7fae6fc73c379a1dcb3c172ad6ed9d6b02180bd8"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::use_vue_slots_as_functions::is_used_as_value (cognitive 33): biome_js_analyze::lint::nursery::use_vue_slots_as_functions::is_used_as_value has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (27 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_vue_slots_as_functions.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"df1e846835005af62ab254993f88eda509b56b92e3e5fe300ecdaa16637201ac"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_json_parser::syntax::parse_sequence (cognitive 33): biome_json_parser::syntax::parse_sequence has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 4 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_json_parser/src/syntax.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c941b47e39a3000edaa4dc1ee42d5c573185ded51bee4f6abbbdc7fc052498"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_parser::syntax::list::parse_continuation_block (cognitive 33): biome_markdown_parser::syntax::list::parse_continuation_block has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (23 pts), loops 2 (5 pts), boolean chains 4, 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/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":2935}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fef43a4dfa9dce16b9616cdc8730bde7ab74b1f370e0f11372162e691f6c7d5"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_module_graph::db::queries::find_jsdoc_for_exported_symbol (cognitive 33): biome_module_graph::db::queries::find_jsdoc_for_exported_symbol has cognitive complexity 33 (threshold 15). Drivers by points: if/else 4 (15 pts), match/switch 4 (12 pts), loops 2 (4 pts), boolean chains 2 (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/biome_module_graph/src/db/queries.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf08b6dd258b7984171638d5de791042ed53a73b74d4e33c0e1bd22ebaf28db6"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_service::file_handlers::javascript::go_to::resolve_binding (cognitive 33): biome_service::file_handlers::javascript::go_to::resolve_binding has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (29 pts), boolean chains 2, loops 1, match/switch 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/javascript/go_to.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d64934e435bed6f555fdd46706ed302f4a82177ad362ca3e46d23ed9d495060d"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_yaml_formatter::comments::handle_document_comment (cognitive 33): biome_yaml_formatter::comments::handle_document_comment has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (28 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_yaml_formatter/src/comments.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"94cb775ac61b07b34c4ad11949804cc3f598236822621089c400f57e642aee5c"}},{"ruleId":"D2","level":"warning","message":{"text":"NoVoidElementsWithChildren::action (cognitive 32): NoVoidElementsWithChildren::action has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (28 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/biome_js_analyze/src/lint/correctness/no_void_elements_with_children.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"685318f59e5e782f96dbe7e736a10949c8155304d066f13e5f75c69399861bed"}},{"ruleId":"D2","level":"warning","message":{"text":"UseNumberNamespace::action (cognitive 32): UseNumberNamespace::action has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 8 (15 pts) (nesting depth added 16). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_number_namespace.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"f324620d1caf93dd19493fbbea9cb19cbc3c88a06790bec3efd293cb464b4764"}},{"ruleId":"D2","level":"warning","message":{"text":"NoLeakedRender::run (cognitive 32): NoLeakedRender::run has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (20 pts), match/switch 3 (8 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/no_leaked_render.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"caa0e68df45f46c17e8a92d46b4d1a3815ee48abb0c616c77a6e28a9b93b24af"}},{"ruleId":"D2","level":"warning","message":{"text":"JsSuppressionAction::apply_inline_suppression (cognitive 32): JsSuppressionAction::apply_inline_suppression has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (27 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/suppression_action.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"444b99e47f3605a806f69db9860b47225b96936f8865dc8a5f66713fe84a7ee9"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::correctness::no_vue_ref_as_operand::track_to_refs_references (cognitive 32): biome_js_analyze::lint::correctness::no_vue_ref_as_operand::track_to_refs_references has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (28 pts), match/switch 1 (2 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/biome_js_analyze/src/lint/correctness/no_vue_ref_as_operand.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"2984be82621a87a3c81ea8b13a3f9ad54ab65636e9f6344d771e9dcc66aaf465"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::style::use_consistent_array_type::transform_array_element_type (cognitive 32): biome_js_analyze::lint::style::use_consistent_array_type::transform_array_element_type has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (24 pts), match/switch 4 (7 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/biome_js_analyze/src/lint/style/use_consistent_array_type.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f7e223b18ae09a62d444a485b7051fa431a8e2c74907967fa48b3dca6ac9bf"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::style::use_vue_multi_word_component_names::is_multi_word (cognitive 32): biome_js_analyze::lint::style::use_vue_multi_word_component_names::is_multi_word has cognitive complexity 32 (threshold 15). Drivers by points: if/else 5 (21 pts), match/switch 2 (6 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_vue_multi_word_component_names.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"e08a768b838ee82273d344ebd9393fe2731409a77f8986091f68ecad3f05db83"}},{"ruleId":"D2","level":"warning","message":{"text":"InferredType::object_spread_misuse (cognitive 32): InferredType::object_spread_misuse has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (21 pts), match/switch 3 (9 pts), boolean chains 1, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/inferred_type/spread_misuse.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea79efd49f353a56e10fe1a6f3dbe942c3bff00ebc072589b488f2309787957"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeSpanNormalization::fmt (cognitive 32): CodeSpanNormalization::fmt has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (26 pts), boolean chains 5, 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/biome_markdown_formatter/src/markdown/auxiliary/inline_code.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"929330dfbc78ce748dccdf55d73ce9b0321855830e4c53d739b4b9ff1fffa5eb"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatMdInlineItemList::fmt (cognitive 32): FormatMdInlineItemList::fmt has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (24 pts), boolean chains 5, match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_formatter/src/markdown/lists/inline_item_list.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bbcbaf4a16c49a29d364d4bd0d030ca9139c3db8fc6b070cb8cccb372c53d22"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_module_graph::db::queries::type_inference::calls::implementation::expanded_tuple_sequence (cognitive 32): biome_module_graph::db::queries::type_inference::calls::implementation::expanded_tuple_sequence has cognitive complexity 32 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 3 (9 pts), loops 3 (7 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/queries/type_inference/calls/implementation.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff7bb070e7c9cee3c4bcc5447652daa872d22f29527c94e8406241f88f0d9a4"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceServerWithDb::is_ignored_by_scanner (cognitive 32): WorkspaceServerWithDb::is_ignored_by_scanner has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 5 (8 pts), boolean chains 6 (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/biome_service/src/workspace/server.rs"},"region":{"startLine":1829}}}],"partialFingerprints":{"codehealthFindingId/v1":"6964b248654d0fe6d4b8609b4b79297d409d56e53a03beb8be567dcffd71258c"}},{"ruleId":"D2","level":"warning","message":{"text":"DisplayProfiles::fmt (cognitive 31): DisplayProfiles::fmt has cognitive complexity 31 (threshold 15). Drivers by points: if/else 20 (25 pts), boolean chains 5, loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_analyze/src/profiling.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dee7a54e95f537faee9193dc730527f45674e3f814de0d67ea07d467477ba77"}},{"ruleId":"D2","level":"warning","message":{"text":"DeriveInput::parse (cognitive 31): DeriveInput::parse has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (27 pts), boolean chains 2, 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/biome_deserialize_macros/src/deserializable_derive.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"38437d0229b0f33336f2e43e7e4d7c90ac5f978dc5316970d9f75cda64100209"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_diagnostics::display::frame::print_invisibles (cognitive 31): biome_diagnostics::display::frame::print_invisibles has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (23 pts), boolean chains 7, 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/biome_diagnostics/src/display/frame.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"0178d4effc2a55ec0caa451f16a1adc51a3336ab0c74c8bfdf92b73dd172d496"}},{"ruleId":"D2","level":"warning","message":{"text":"EmbeddedBindingsBuilder::visit_define_props_call (cognitive 31): EmbeddedBindingsBuilder::visit_define_props_call has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 3 (6 pts), boolean chains 3, 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/biome_embeds/src/visitor.rs"},"region":{"startLine":1503}}}],"partialFingerprints":{"codehealthFindingId/v1":"791fce6b30c778742cc7bc655c6192171ddce0dd4d725d1e3d7bddcd0ac4ab2d"}},{"ruleId":"D2","level":"warning","message":{"text":"NoNonoctalDecimalEscape::run (cognitive 31): NoNonoctalDecimalEscape::run has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (30 pts), loops 1 (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/no_nonoctal_decimal_escape.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c5b155fbfd21218f07fd1be5eb9a3f7cd38fd159325d273f50a9f172319efa"}},{"ruleId":"D2","level":"warning","message":{"text":"JsFormatSyntaxRewriter::visit_parenthesized (cognitive 31): JsFormatSyntaxRewriter::visit_parenthesized has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 6, loops 2 (4 pts), match/switch 3 (4 pts) (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/syntax_rewriter.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4389d5c8610363da7601be3f4639767e99a7906505a2f1e911663a63194cfb9"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_parser::syntax::stmt::parse_variable_declarator (cognitive 31): biome_js_parser::syntax::stmt::parse_variable_declarator has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 11, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_parser/src/syntax/stmt.rs"},"region":{"startLine":1366}}}],"partialFingerprints":{"codehealthFindingId/v1":"00b5f8d659c367e182ad3ef6b21edbc7f89e22630f136496682d2377476c8f5f"}},{"ruleId":"D2","level":"warning","message":{"text":"ProseItemCollector::collect (cognitive 31): ProseItemCollector::collect has cognitive complexity 31 (threshold 15). Drivers by points: if/else 4 (14 pts), loops 4 (12 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_formatter/src/words.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"93929858433122051b361089bd5a82eff16ad7fe79fe1620ae4cd00289c9a491"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_parser::syntax::header::parse_trailing_hashes (cognitive 31): biome_markdown_parser::syntax::header::parse_trailing_hashes has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 3 (7 pts), boolean chains 5 (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/biome_markdown_parser/src/syntax/header.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a89ad0e1e046b6245aedcf6dd3d15466297211d251909633824ea97cd8f6799"}},{"ruleId":"D2","level":"warning","message":{"text":"ResolutionCtx::resolve_promise_value_type (cognitive 31): ResolutionCtx::resolve_promise_value_type has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":1383}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d3bdc240f84d23b1091868eebe754a2eed9a53a9cbcb9af50ba3b5e15b050c5"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_package::node_semver::range::parse_version_string (cognitive 31): biome_package::node_semver::range::parse_version_string has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 6 (17 pts), if/else 10 (14 pts) (nesting depth added 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_package/src/node_semver/range.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ad16b6b54a658afbe9eab9d0555fb74a2c5316a0b5ac8a984e558f6a009626"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_tailwind_logic::syntax_service::is_class_configuration_value (cognitive 31): biome_tailwind_logic::syntax_service::is_class_configuration_value has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (26 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_tailwind_logic/src/syntax_service.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"4903680fd6dcbe090f85cecb42f93fc1d60bd088a11974c4e404fd85a8fbab68"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_vue_semantic::semantic_model::references::collect_script_references (cognitive 31): biome_vue_semantic::semantic_model::references::collect_script_references has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 4 (5 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_vue_semantic/src/semantic_model/references.rs"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad17874bdca743854e9b47ddde828217a8bb3c39ef61e969d80f6db3f3b579f"}},{"ruleId":"D2","level":"warning","message":{"text":"extract-utilities.extractFunctionalBranches (cognitive 31): extract-utilities.extractFunctionalBranches has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 4 (7 pts), ternaries 2 (7 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/tailwindcss-config-analyzer/src/v4/extract-utilities.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"266dd67ae22ed393c8a9eb811e92bd498e41b6a765dfd7f86a48b7ba701dc3f2"}},{"ruleId":"D2","level":"warning","message":{"text":"SummaryReporterVisitor::report_diagnostics (cognitive 30): SummaryReporterVisitor::report_diagnostics has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (22 pts), boolean chains 5, match/switch 1 (2 pts), loops 1 (nesting depth added 14). 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/biome_cli/src/reporter/summary.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d56c20cfd8bc86f2d51af582b6c086e9cdb34952298a12bbbc7d380cc8a275"}},{"ruleId":"D2","level":"warning","message":{"text":"OverridePattern::apply_to_configuration (cognitive 30): OverridePattern::apply_to_configuration has cognitive complexity 30 (threshold 15). Drivers by points: if/else 25 (27 pts), boolean chains 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_configuration/src/overrides.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c44cfefa401fe1f34f78e441df4034416786a99a6cd416110c96bda36c2608a"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_configuration_macros::group_struct::generate_group_struct (cognitive 30): biome_configuration_macros::group_struct::generate_group_struct has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (18 pts), loops 4 (7 pts), match/switch 1 (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/biome_configuration_macros/src/group_struct.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d35f428af280a304a552f94b7407152e433f3602eee7b259814d14cbf9a146d"}},{"ruleId":"D2","level":"warning","message":{"text":"CssLexer::consume_slash (cognitive 30): CssLexer::consume_slash has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (17 pts), match/switch 3 (7 pts), loops 2 (4 pts), boolean chains 2 (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/biome_css_parser/src/lexer/mod.rs"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe315ff0c03f77be69d34b0d9d304a98d47c63733b5062a71c02b3f7458651e8"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticEventExtractor::process_at_property (cognitive 30): SemanticEventExtractor::process_at_property has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (19 pts), match/switch 2 (8 pts), boolean chains 2, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_semantic/src/events.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c7888ee5a4f994c18437834d9e8833a82fec2d25523d558aa0790df20e7674"}},{"ruleId":"D2","level":"warning","message":{"text":"ResolvedSelector::normalize (cognitive 30): ResolvedSelector::normalize has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_semantic/src/semantic_model/model.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab790875d060f26c3dd40e33574750bcc2567968762988c885d84737976c61a"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_diagnostics::display::backtrace::print_backtrace (cognitive 30): biome_diagnostics::display::backtrace::print_backtrace has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (27 pts), loops 2 (3 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_diagnostics/src/display/backtrace.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ca46e538b2755d55d6a2d4c89a14c01d5eb3b104cf4fac8787ab50d8750d8a"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticEventExtractor::resolve_variables_references (cognitive 30): SemanticEventExtractor::resolve_variables_references has cognitive complexity 30 (threshold 15). Drivers by points: loops 8 (18 pts), if/else 5 (12 pts) (nesting depth added 17). 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/biome_graphql_semantic/src/events.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"f07de262fa4582087bc1aa2c72af36ab03b18abc4c7fd78faafbaa98a1fd50c9"}},{"ruleId":"D2","level":"warning","message":{"text":"NoUnreachable::diagnostic (cognitive 30): NoUnreachable::diagnostic has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 2 (6 pts), match/switch 2 (3 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/biome_js_analyze/src/lint/correctness/no_unreachable.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"30480a25c13fcfac671b711aeef46c23d381e7d4a5b6691e38db2fdc00b559f5"}},{"ruleId":"D2","level":"warning","message":{"text":"Function::check_writes (cognitive 30): Function::check_writes has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (22 pts), boolean chains 3, match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_atomic_updates.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"9af0f231257a0a61fa10db00fa763c804a0dd324c2d061e508d106c0f8b4e0ff"}},{"ruleId":"D2","level":"warning","message":{"text":"NoRedundantUseStrict::run (cognitive 30): NoRedundantUseStrict::run has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 2 (6 pts), match/switch 2 (4 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/biome_js_analyze/src/lint/suspicious/no_redundant_use_strict.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9de08dacbb5c45c5a0d6aca4a332235b62f296517ec88a1b25f6df7c4d7eb00"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::ast_utils::is_logical_identity (cognitive 30): biome_js_analyze::ast_utils::is_logical_identity has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (21 pts), match/switch 2 (5 pts), boolean chains 4 (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/biome_js_analyze/src/ast_utils.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a590f2c438c5255de163c8acc025d541ab5d4b6ce95ec549db448d743051d28"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::correctness::no_unreachable::analyze_fine (cognitive 30): biome_js_analyze::lint::correctness::no_unreachable::analyze_fine has cognitive complexity 30 (threshold 15). Drivers by points: loops 5 (15 pts), if/else 4 (13 pts), match/switch 1 (2 pts) (nesting depth added 20). 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/biome_js_analyze/src/lint/correctness/no_unreachable.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc4e67069c52d4f581b046483797bf1e664680ba1104d0699e3e4f72c8b3378e"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::suspicious::no_import_cycles::find_cycle (cognitive 30): biome_js_analyze::lint::suspicious::no_import_cycles::find_cycle has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (22 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/no_import_cycles.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b50d1d4bad104ea913eeabc9a3cecd3a0f7e3093f93455d3250afd072d96fa9"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::suspicious::no_react_forward_ref::fix_parameters (cognitive 30): biome_js_analyze::lint::suspicious::no_react_forward_ref::fix_parameters has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (19 pts), match/switch 4 (9 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/no_react_forward_ref.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"f28cfd15e39d4c510ddc818d2ed4a69e3f63f6f348c94b17595bee343661a9ee"}},{"ruleId":"D2","level":"warning","message":{"text":"AnyJsParameterList::try_merge (cognitive 30): AnyJsParameterList::try_merge has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 4, loops 2, match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_unified_type_signatures.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"696670b83556a548eb653309bdc424d2ce272cdfb2a4b35555801d089ff723b6"}},{"ruleId":"D2","level":"warning","message":{"text":"BiomeManifest::validate (cognitive 30): BiomeManifest::validate has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 6 (10 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_manifest/src/lib.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9bbd5e7df9395168fbb3406ecc2980c92b49dad598f0eb56c99bac05d729098"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_parser::syntax::header::header_content_source_len (cognitive 30): biome_markdown_parser::syntax::header::header_content_source_len has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 2 (6 pts), boolean chains 5 (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/biome_markdown_parser/src/syntax/header.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b4d36123f1db32e4665664d35fb7dbd5a7eb2e601fb3f7aad9c5fc997c9fa88"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_parser::syntax::inline::links::collect_link_text (cognitive 30): biome_markdown_parser::syntax::inline::links::collect_link_text 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/biome_markdown_parser/src/syntax/inline/links.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda0aca0d837ffe50234bcc127a16541c90fab9594e801adc31c6d87d9de77a6"}},{"ruleId":"D2","level":"warning","message":{"text":"OrganizeImports::run (cognitive 30): OrganizeImports::run has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (20 pts), loops 3 (8 pts), match/switch 1 (2 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_migrate/src/analyzers/organize_imports.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1fcb2c40a9b9328e3fb8857f8b9fcfc833621dfb626bb569c9aa045dfacbbb7"}},{"ruleId":"D2","level":"warning","message":{"text":"ResolutionCtx::infer_constructor_type_parameters (cognitive 30): ResolutionCtx::infer_constructor_type_parameters has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 5 (11 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":1276}}}],"partialFingerprints":{"codehealthFindingId/v1":"be105af004c4124820625a089b524ee5228b90e23cdc610c9df36342e68ebc98"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_service::file_handlers::css::fix_all (cognitive 30): biome_service::file_handlers::css::fix_all has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (22 pts), match/switch 3 (5 pts), loops 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/css.rs"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e5bce7fecaaa8ded1cdfedde94236d5e2392458e5477642123eec4f016e99f"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_service::file_handlers::html::go_to::resolve_binding_html (cognitive 30): biome_service::file_handlers::html::go_to::resolve_binding_html has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 2 (4 pts), match/switch 2 (4 pts), boolean chains 3 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/html/go_to.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c3060baab06bd3673eee8258271d765a1f2590a0cbedcc901dc5419add8d1d4"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_service::file_handlers::javascript::fix_all (cognitive 30): biome_service::file_handlers::javascript::fix_all has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (22 pts), match/switch 3 (5 pts), loops 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/javascript.rs"},"region":{"startLine":1569}}}],"partialFingerprints":{"codehealthFindingId/v1":"551eb06ffed96c111d0f210e1fc6616fddf517097df010dc31ed619b73e081ed"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatYamlVerbatimNode::fmt (cognitive 30): FormatYamlVerbatimNode::fmt has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 5 (7 pts), match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_yaml_formatter/src/verbatim.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"41873b2939c37d687c81722fd98dea2ea14666c5f7559d245c1bc1d4d69b4c75"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorConfig::from_str (cognitive 29): EditorConfig::from_str has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_configuration/src/editorconfig.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f0e0e9ff4874e20dd09717e5a9533ae8d18828ac26f10da5209ad660828463c"}},{"ruleId":"D2","level":"warning","message":{"text":"ControlFlowGraph::fmt (cognitive 29): ControlFlowGraph::fmt has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (25 pts), loops 3 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_control_flow/src/lib.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e292b7de8833d77248d223f50edd99f7890189445d1efb07e45a3346f7b81c6"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatHtmlElement::fmt_inner (cognitive 29): FormatHtmlElement::fmt_inner has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 17, if/else 11 (12 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_formatter/src/html/auxiliary/element.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"34082164f9d864fe9ea2867207c64181b84ae82697362d09c91958cd7cfeece6"}},{"ruleId":"D2","level":"warning","message":{"text":"UseValidForDirection::run (cognitive 29): UseValidForDirection::run has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 5, match/switch 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/biome_js_analyze/src/lint/correctness/use_valid_for_direction.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"90656df4c96d747190825bcb6aedfebc872b5fb2aeaefdb0d0e2934cb5ae7db2"}},{"ruleId":"D2","level":"warning","message":{"text":"UseSingleVarDeclarator::action (cognitive 29): UseSingleVarDeclarator::action has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (21 pts), loops 3 (7 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/biome_js_analyze/src/lint/style/use_single_var_declarator.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fadc5b44385b4be9b73c71bf6e1cc03fccb53c6e4989cd4016bc1469a3ecc02"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::no_useless_spread::inline_literal (cognitive 29): biome_js_analyze::lint::nursery::no_useless_spread::inline_literal has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 6, loops 3 (5 pts), match/switch 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_useless_spread.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd8a8005671a3bc4501712dfde1f3c9df7e36580e6d75e61f94ecb49e263fc0"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::use_vue_render_return::returns_value_on_every_path (cognitive 29): biome_js_analyze::lint::nursery::use_vue_render_return::returns_value_on_every_path has cognitive complexity 29 (threshold 15). Drivers by points: if/else 4 (16 pts), match/switch 2 (7 pts), loops 3 (5 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/biome_js_analyze/src/lint/nursery/use_vue_render_return.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8733e7d9a5fe465e614f4e0994c8e0c4b2d746833376fbf8409a936a64dad1b"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatJsDecoratorList::fmt (cognitive 29): FormatJsDecoratorList::fmt has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 2 (5 pts), match/switch 2 (5 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/js/lists/decorator_list.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"59009a528598029f084907875ef5ee90029ffa783a663c87209b3f1a124ab0f9"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_parser::syntax::link_block::is_valid_link_definition_lookahead (cognitive 29): biome_markdown_parser::syntax::link_block::is_valid_link_definition_lookahead has cognitive complexity 29 (threshold 15). Drivers by points: if/else 19 (24 pts), boolean chains 4, loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/link_block.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73b104cac951ac5990af47bc8a42173b1dcfecea99345efe5fc7676ca471471"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_parser::syntax::list::next_quoted_content_continues_same_list (cognitive 29): biome_markdown_parser::syntax::list::next_quoted_content_continues_same_list has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":1787}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c76b61530f55d5f3a543bb24d8c8888df035a09ff904e76822da33b4a596f81"}},{"ruleId":"D2","level":"warning","message":{"text":"ResolutionCtx::resolve_namespace_import_member_with_steps (cognitive 29): ResolutionCtx::resolve_namespace_import_member_with_steps has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (25 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/type_inference/qualifiers.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2235bcb02f714d6f4985af3288232003fa4339b254c10b8235f46a594430b0f"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceServerWithDb::fix_file_state (cognitive 29): WorkspaceServerWithDb::fix_file_state has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (25 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/workspace/server.rs"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dbb5fb89d01c9f36d37344f28a26a52e4d0c625b7fdb36ec1f21fa6c3f9373f"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_service::file_handlers::json::fix_all (cognitive 29): biome_service::file_handlers::json::fix_all has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (22 pts), match/switch 2 (4 pts), loops 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/json.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"26f30a3840e5043c46ee00d13fef25c6636fc0562b34388983cb782c01234109"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_tailwind_logic::use_tailwind_shorthand_classes::apply_auto_fix (cognitive 29): biome_tailwind_logic::use_tailwind_shorthand_classes::apply_auto_fix has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (23 pts), match/switch 1 (3 pts), loops 2, boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_tailwind_logic/src/use_tailwind_shorthand_classes.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"1226d719172c6d129be819b260f0370e12bf14f7c86a81f7a4354fe63f31f90d"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_vue_semantic::format_semantic_model::write_symbol (cognitive 29): biome_vue_semantic::format_semantic_model::write_symbol has cognitive complexity 29 (threshold 15). Drivers by points: if/else 17 (25 pts), loops 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_vue_semantic/src/format_semantic_model.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"39e09e820e59d4e09bddcb2490478852ed6b5e84c3e230bf1255eecc712969c5"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_vue_semantic::semantic_model::snippets::expression_shape (cognitive 29): biome_vue_semantic::semantic_model::snippets::expression_shape has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 7 (14 pts), if/else 4 (11 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_vue_semantic/src/semantic_model/snippets.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d14c03958dc35adbb475d3de4105e7e5804275a16b01baf88b85013ef957cd"}},{"ruleId":"D2","level":"warning","message":{"text":"YamlLexer::consume_plain_literal (cognitive 29): YamlLexer::consume_plain_literal has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_yaml_parser/src/lexer/mod.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"436fa2d7a65996ff8e394f18e4b3caf080eda249f62a1acac3ed6b8498357b66"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobalBuilder::try_lower_member (cognitive 29): GlobalBuilder::try_lower_member has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 7 (14 pts) (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":"xtask/codegen/src/generate_global_types/lower/generic.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"165dc55483da0c67ac44f08c5ce34e2f30aa3d19e0eb6b1d135cce398e303dfb"}},{"ruleId":"D2","level":"warning","message":{"text":"SanitizeAdapter::write_str (cognitive 28): SanitizeAdapter::write_str has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (22 pts), boolean chains 5, loops 1 (nesting depth added 14). 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/biome_console/src/write/termcolor.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb100bd90124269da6d9bcf65004e9e265e9bcbea09080886eb3ff020fee9e5d"}},{"ruleId":"D2","level":"warning","message":{"text":"NoDuplicateSelectors::run (cognitive 28): NoDuplicateSelectors::run has cognitive complexity 28 (threshold 15). Drivers by points: if/else 4 (13 pts), match/switch 3 (9 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_analyze/src/lint/suspicious/no_duplicate_selectors.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"72dcbab8dd83cb62a263ddb5bc9b91c60e7872bcc0c0812dddc7768f3dd80195"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_html_parser::lexer::vue_v_for_default_length (cognitive 28): biome_html_parser::lexer::vue_v_for_default_length has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 3 (8 pts), boolean chains 2, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_parser/src/lexer/mod.rs"},"region":{"startLine":2049}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b8333cfd32b6d9a375f58a7628e3ccf360599bcb2fe4bfabfa28308ed98859c"}},{"ruleId":"D2","level":"warning","message":{"text":"NoUnsafeReturn::run (cognitive 28): NoUnsafeReturn::run has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 6, match/switch 4 (5 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_unsafe_return.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5761509572b1b906db0e2a860beccc71cf95d8e6c1c1fb71637b7f1a21d64b2"}},{"ruleId":"D2","level":"warning","message":{"text":"UseExhaustiveSwitchCases::run (cognitive 28): UseExhaustiveSwitchCases::run has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 2, loops 2, match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_exhaustive_switch_cases.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"696d82d93fc6573b7e15efabcb848b9a60da57d8d86c6ab94e015704ebdcb09a"}},{"ruleId":"D2","level":"warning","message":{"text":"UseEnumInitializers::action (cognitive 28): UseEnumInitializers::action has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (20 pts), match/switch 2 (7 pts), loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_enum_initializers.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d3b4918133c4d5298688ddf5aebfb92e50ce6ad826e5c9b8f2dbe96b72efe7"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::use_explicit_type::is_allowed_in_untyped_expression (cognitive 28): biome_js_analyze::lint::nursery::use_explicit_type::is_allowed_in_untyped_expression has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 8, match/switch 2 (5 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_explicit_type.rs"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"e94a9e1adc030c4446703d7f53a32183e3ba216a2429eb887e451588d61fa1e2"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::style::no_useless_else::breaks_early (cognitive 28): biome_js_analyze::lint::style::no_useless_else::breaks_early has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (22 pts), loops 2 (4 pts), 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/biome_js_analyze/src/lint/style/no_useless_else.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff41c27c13bdc1b06dccbf3e263d19e70c53525a0a0c9b96bba2af263cc44f6e"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::style::use_import_type::named_import_type_fix (cognitive 28): biome_js_analyze::lint::style::use_import_type::named_import_type_fix has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (26 pts), loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_import_type.rs"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"125bb8683cc5c22ea0298659e3c842a9e838c09b8783771581f28614625489ac"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatTemplateElement::fmt (cognitive 28): FormatTemplateElement::fmt has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (18 pts), match/switch 6 (9 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/js/auxiliary/template_element.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"e51f400b0f58f2110c9221b3792ac0641349d82b6664fa679e3ce1f3c4a0c3eb"}},{"ruleId":"D2","level":"warning","message":{"text":"JsLexer::read_slash (cognitive 28): JsLexer::read_slash has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 2 (4 pts), match/switch 2 (4 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/biome_js_parser/src/lexer/mod.rs"},"region":{"startLine":1589}}}],"partialFingerprints":{"codehealthFindingId/v1":"2344522d24c1c8ffd84faeec17f1b9564230b223209a907b004e5c14b8b93cf6"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticEventExtractor::pop_scope (cognitive 28): SemanticEventExtractor::pop_scope has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 4 (9 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_semantic/src/events.rs"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"436cc837c7920c53d249d9aa272d8288fae59416618f4e434cf96dc18e202f48"}},{"ruleId":"D2","level":"warning","message":{"text":"BooleanCoercionVisitor::enter (cognitive 28): BooleanCoercionVisitor::enter has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 5 (10 pts), boolean chains 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/inferred_type/boolean_coercion.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"6373318bc4f4002d36217f71a44888c015d04786c7ef562d634767fe7082f0ab"}},{"ruleId":"D2","level":"warning","message":{"text":"InferredType::callable_type_with (cognitive 28): InferredType::callable_type_with has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (25 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/inferred_type.rs"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"6779c5ef91b0e771bfd3f266486bac9823efcb82f065d70044feae1244f06a0d"}},{"ruleId":"D2","level":"warning","message":{"text":"InferredType::try_switch_case_variants (cognitive 28): InferredType::try_switch_case_variants has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 5 (17 pts), if/else 4 (10 pts), loops 1 (nesting depth added 18). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/inferred_type.rs"},"region":{"startLine":1403}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa81862823b4e1c17e6447fd7bbf86f3234163379b58a64d9fdb9fd30884cb14"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_lsp::handlers::analysis::fix_all (cognitive 28): biome_lsp::handlers::analysis::fix_all has cognitive complexity 28 (threshold 15). Drivers by points: if/else 20 (21 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/handlers/analysis.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d83df82971883964b3403223d138026e2dd77448443feb68fa72519aefa4910"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatMdInlineItemList::fmt_fenced_code_block (cognitive 28): FormatMdInlineItemList::fmt_fenced_code_block has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 3 (8 pts), match/switch 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_formatter/src/markdown/lists/inline_item_list.rs"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7fb25e1646548a7eea5e647ebdf39d7e23f7f543b05f284d0387cad4c74d73"}},{"ruleId":"D2","level":"warning","message":{"text":"ProseItemList::outdented_setext_word_group (cognitive 28): ProseItemList::outdented_setext_word_group has cognitive complexity 28 (threshold 15). Drivers by points: if/else 4 (17 pts), loops 3 (8 pts), match/switch 1 (2 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/biome_markdown_formatter/src/words.rs"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"d71c9fd7eb30b7b645b1b610c2547e56ce193f9aab9899a72311b035cd772d85"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkdownLexer::is_after_block_quote_marker (cognitive 28): MarkdownLexer::is_after_block_quote_marker has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 4, loops 2, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/lexer/mod.rs"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab15f0756b9dd96e3ec95412d403d181e872f02f6f1fbb5efe9464af1aef55b3"}},{"ruleId":"D2","level":"warning","message":{"text":"HtmlRenderer::render (cognitive 28): HtmlRenderer::render has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (24 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/to_html.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"bebc67d03b344107c3d060c7d34af8977ea0c4bb9d5745d3095d44a1cad3c6a2"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_syntax::block_ext::line_start_column (cognitive 28): biome_markdown_syntax::block_ext::line_start_column has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 4 (7 pts), boolean chains 2, 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/biome_markdown_syntax/src/block_ext.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"c217fcb49cbf3ddf408c29e04307bbb8f30ccc1d67160a3485fd90fe17df72b6"}},{"ruleId":"D2","level":"warning","message":{"text":"ResolutionCtx::resolve_static_member_expression (cognitive 28): ResolutionCtx::resolve_static_member_expression has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 4, match/switch 2 (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/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":1646}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc304d4d1ce88c631c7dad633858158a3098127345b2ffdfedbc5550d0ea8ee6"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_module_graph::db::type_inference::inference_scc (cognitive 28): biome_module_graph::db::type_inference::inference_scc has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 4 (7 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/biome_module_graph/src/db/type_inference/mod.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"a681a1f04a69160269d823527e1dedb6612eb71407b840855684ea24248c6bd0"}},{"ruleId":"D2","level":"warning","message":{"text":"Case::convert (cognitive 28): Case::convert has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 6, match/switch 2 (5 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/biome_string_case/src/lib.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b8dae16cfa7910b2ed0705f9b6ca882cf281ad13500bcbd5a16123ee053b67"}},{"ruleId":"D2","level":"warning","message":{"text":"Collector::collect_macro (cognitive 28): Collector::collect_macro has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (21 pts), match/switch 2 (4 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_vue_semantic/src/semantic_model/component.rs"},"region":{"startLine":1961}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c0eba13d2036eb6d01a671c9fb214f6e0d82a4993dc2ceb51c56136ffcb81b2"}},{"ruleId":"D2","level":"warning","message":{"text":"YamlLexer::report_over_indented_leading_empty_line (cognitive 28): YamlLexer::report_over_indented_leading_empty_line has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 2 (3 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_yaml_parser/src/lexer/mod.rs"},"region":{"startLine":1515}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f61cd043a3d79ae1cf3455a9f689c5d08e628a064e1ce18a622e1bf8772297"}},{"ruleId":"D2","level":"warning","message":{"text":"NamingConventionSelection::selectors (cognitive 27): NamingConventionSelection::selectors has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (23 pts), match/switch 1 (2 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/biome_cli/src/execute/migrate/eslint_typescript.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b7248b6a233f198132563bc216aa1a27f7f23e27f70f58a3b8aa26675923be1"}},{"ruleId":"D2","level":"warning","message":{"text":"ConsoleTraversalSummary::fmt (cognitive 27): ConsoleTraversalSummary::fmt has cognitive complexity 27 (threshold 15). Drivers by points: if/else 16 (27 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/biome_cli/src/reporter/terminal.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"7740011cacfd6114ff5f205325b91925cace6618a201a58305fc9a0526d8cf8d"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_css_analyze::fonts::find_font_family (cognitive 27): biome_css_analyze::fonts::find_font_family has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 2, 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/biome_css_analyze/src/fonts.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f2edc2c896ea28a5e003eaa5ac304241cf5b224bf1f8eb16e063666ee4ddc3"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_css_formatter::utils::component_value_list::write_component_value_list (cognitive 27): biome_css_formatter::utils::component_value_list::write_component_value_list has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 2 (4 pts), boolean chains 2, match/switch 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_formatter/src/utils/component_value_list.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c8286e51525eb6f4c8d345f71470706ca11fe1977bca4ebc2232141d2a8b3c1"}},{"ruleId":"D2","level":"warning","message":{"text":"ContainerAttrs::try_from (cognitive 27): ContainerAttrs::try_from has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 3 (10 pts), boolean chains 4, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_deserialize_macros/src/deserializable_derive/container_attrs.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"c585e2aeb1b328ccd470ca202252adf4b0bb599a35d9fc9a21d41944353e6866"}},{"ruleId":"D2","level":"warning","message":{"text":"PrintAdvices::record_table (cognitive 27): PrintAdvices::record_table has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (18 pts), loops 3 (8 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_diagnostics/src/display.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"458f1a6ea1598698a6957e0f938dcf0dda860e2041ae266aab1cb65cc708b6d1"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_formatter::token::number::format_trimmed_number (cognitive 27): biome_formatter::token::number::format_trimmed_number has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 4 (8 pts), boolean chains 3, 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/biome_formatter/src/token/number.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d9cc21c2313f05dbfcb13385cef18e5934fb2e56ee29335b570ba5e4707bed5"}},{"ruleId":"D2","level":"warning","message":{"text":"GritExecContext::exec_step (cognitive 27): GritExecContext::exec_step has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (23 pts), loops 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/biome_grit_patterns/src/grit_context.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c14bde524ab8b2347349c6896f6f7e23845577b7497c4030538751a5f04bb0d"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_html_formatter::utils::srcset::parse_srcset (cognitive 27): biome_html_formatter::utils::srcset::parse_srcset has cognitive complexity 27 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 5 (10 pts), boolean chains 5 (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/biome_html_formatter/src/utils/srcset.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a4fa17c7dbbb4da2c8295a66bbae8b97fab2038683311ca2d61a38a501f8d14"}},{"ruleId":"D2","level":"warning","message":{"text":"UseExhaustiveDependencies::run (cognitive 27): UseExhaustiveDependencies::run has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 5 (6 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/use_exhaustive_dependencies.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"776338b4e71dfec5d0a297874e4b28d21ff274ea2094ab8351cacba3ad49e877"}},{"ruleId":"D2","level":"warning","message":{"text":"UseExportType::action (cognitive 27): UseExportType::action has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 4 (10 pts), match/switch 3 (5 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/biome_js_analyze/src/lint/style/use_export_type.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"62111a52162a856b3f066228c3c404632bb788eb1e68b7113621362df5c1281b"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::correctness::use_exhaustive_dependencies::get_expression_candidates (cognitive 27): biome_js_analyze::lint::correctness::use_exhaustive_dependencies::get_expression_candidates has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 2, 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/biome_js_analyze/src/lint/correctness/use_exhaustive_dependencies.rs"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d54b0d9040cf155301eb9df5d17d9a05316ad7fc4f4f5ef18eea269672c24b5"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::correctness::use_exhaustive_dependencies::is_stable_expression (cognitive 27): biome_js_analyze::lint::correctness::use_exhaustive_dependencies::is_stable_expression has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 3, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/use_exhaustive_dependencies.rs"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"f39de82f00400a2f8792f141b7388bbf877b68a0aea832b60656ed21b56e7a8d"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::suspicious::no_loop_func::get_containing_loop_node (cognitive 27): biome_js_analyze::lint::suspicious::no_loop_func::get_containing_loop_node has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (19 pts), match/switch 2 (6 pts), boolean chains 1, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/no_loop_func.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"428c644be6ff617a585e4be0f9b562467e5940171e8f82a133235117c7134dec"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatJsAnyConditionalRule::fmt (cognitive 27): FormatJsAnyConditionalRule::fmt has cognitive complexity 27 (threshold 15). Drivers by points: if/else 16 (18 pts), boolean chains 7, match/switch 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/utils/conditional.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5f22734097c1295ea7543f525e1613f1fd0424f8ffb94f2675b90277a5cfc10"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_formatter::comments::handle_class_comment (cognitive 27): biome_js_formatter::comments::handle_class_comment has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 7 (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/biome_js_formatter/src/comments.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"98786e5e38b5de32deafd00c821a7ebd5c2b46ea811042afb9c5d762cd637bc5"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkdownLexer::consume_thematic_break_or_emphasis (cognitive 27): MarkdownLexer::consume_thematic_break_or_emphasis has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 6 (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/biome_markdown_parser/src/lexer/mod.rs"},"region":{"startLine":1090}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6be6d329fb18ae05bf3381e336e5e6d933eb7eec5c577d8d134ad228c9e8d02"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_parser::syntax::thematic_break_block::parse_thematic_break_parts (cognitive 27): biome_markdown_parser::syntax::thematic_break_block::parse_thematic_break_parts has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 3, match/switch 1 (3 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/biome_markdown_parser/src/syntax/thematic_break_block.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e18834d787fcf3158a8d3f28afea170f8e351c1586022bdac944c4a71608487"}},{"ruleId":"D2","level":"warning","message":{"text":"Case::identify (cognitive 27): Case::identify has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 6 (17 pts), if/else 7, boolean chains 2, loops 1 (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_string_case/src/lib.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"82288d16938c65467fc0ca389c1fe0f317836fb57069680d1d09edc2257cb3c4"}},{"ruleId":"D2","level":"warning","message":{"text":"Collector::collect_setup_function (cognitive 27): Collector::collect_setup_function has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 4 (7 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/biome_vue_semantic/src/semantic_model/component.rs"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c270a764a4469d13d52044be43a1b49b4cde22baa57c6f9adc751984837d116"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_yaml_formatter::comments::handle_own_line_comment (cognitive 27): biome_yaml_formatter::comments::handle_own_line_comment has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 2, loops 2, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_yaml_formatter/src/comments.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"08feaefdd20752eca3f93e6f8a4b9cd9f06697818466f2e2fd0862911fbf67af"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask_codegen::generate_global_types::lower::overrides::lower_promise_globals (cognitive 27): xtask_codegen::generate_global_types::lower::overrides::lower_promise_globals has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (17 pts), loops 5 (6 pts), match/switch 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/generate_global_types/lower/overrides.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"c122922044fc3cf89426f73a0de7f6227b97d63e4cd93bae822e2c8fd8b40394"}},{"ruleId":"D2","level":"warning","message":{"text":"rules_check::check_rules (cognitive 27): rules_check::check_rules has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13, boolean chains 9, loops 3 (5 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/rules_check/src/lib.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"d135cbc6f316c979c01c61b3c6c2a75d3b136d50287539b0039eb4044641a779"}},{"ruleId":"D2","level":"warning","message":{"text":"Suppressions::suppresses (cognitive 26): Suppressions::suppresses has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 3 (8 pts), boolean chains 4, 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/biome_analyze/src/suppressions.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6b63b7a11ed1b0046e35e843a032dce164bf865ac472ae4091e8c936fd6e284"}},{"ruleId":"D2","level":"warning","message":{"text":"FlatConfigData::into_biome_config (cognitive 26): FlatConfigData::into_biome_config has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/execute/migrate/eslint_to_biome.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"b23e333b16a501c17c3e711a8acad9a90255ead5dd7e92e358ea4c9800413e71"}},{"ruleId":"D2","level":"warning","message":{"text":"DefaultFinalizer::finalize (cognitive 26): DefaultFinalizer::finalize has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 3, match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/runner/impls/finalizers/default.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"844209fac13d4dd7328e1be0d1e42098a0e703e7b05831692dd0b7cc2885f301"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_css_analyze::lint::correctness::no_invalid_grid_areas::check_grid_rows (cognitive 26): biome_css_analyze::lint::correctness::no_invalid_grid_areas::check_grid_rows has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 4 (7 pts), match/switch 1 (3 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/biome_css_analyze/src/lint/correctness/no_invalid_grid_areas.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"18fc71a4a7b507d5a7afcfc5d9b46c57f72e8778cfee87d4aa2186306631a091"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_deserialize::json::unescape_json_string (cognitive 26): biome_deserialize::json::unescape_json_string has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 4 (12 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/biome_deserialize/src/json.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"755c4367765c791655ac57657d245edb1cc0a27f3b72d8bc2a730ed2fb14b3a3"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_formatter::token::string::normalize_string (cognitive 26): biome_formatter::token::string::normalize_string has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (21 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_formatter/src/token/string.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bf34b66b17a7774afdbfc3b8c67d388d8a37b684058ef32b3949dd5fe6b3983"}},{"ruleId":"D2","level":"warning","message":{"text":"UseButtonType::run (cognitive 26): UseButtonType::run has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (25 pts), match/switch 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/a11y/use_button_type.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"e67ebe762cb2fe4b70b129a6bb8ab3b9897eb0d377e29f90289bcf23f3e26233"}},{"ruleId":"D2","level":"warning","message":{"text":"Accesses::add_binding (cognitive 26): Accesses::add_binding has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 3, loops 2, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_useless_assignment.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"c058018b8a6e34fef9ea72ff0da5a3239b1a5d9213b21da9d7420eb1f6660d7f"}},{"ruleId":"D2","level":"warning","message":{"text":"UseDestructuring::run (cognitive 26): UseDestructuring::run has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 3 (7 pts), boolean chains 3 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_destructuring.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0864372784e2ceca8a583ae1bc3336a49068c15e110c090b97e07b1c9cfcb47"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::frameworks::playwright::is_playwright_call_chain (cognitive 26): biome_js_analyze::frameworks::playwright::is_playwright_call_chain has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (21 pts), boolean chains 4, match/switch 1 (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/biome_js_analyze/src/frameworks/playwright.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce83c60f252592463faf50abe1796236315d9b82fd489c92362aaef7438a2d2b"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::suspicious::no_useless_escape_in_string::next_useless_escape (cognitive 26): biome_js_analyze::lint::suspicious::no_useless_escape_in_string::next_useless_escape has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (18 pts), boolean chains 4, match/switch 1 (3 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/no_useless_escape_in_string.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac024dd22ff5291d8bd58fe7c4d3eef54eb11e08efe57558150aa9b1125d73f4"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_parser::syntax::expr::parse_unary_expr (cognitive 26): biome_js_parser::syntax::expr::parse_unary_expr has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 4 (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/biome_js_parser/src/syntax/expr.rs"},"region":{"startLine":1866}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e4bcc217cfa2d5c306e02103e0c807c03e9ff5df10cfae343ce2bcf4b448e2e"}},{"ruleId":"D2","level":"warning","message":{"text":"InferredType::conditional_type (cognitive 26): InferredType::conditional_type has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (21 pts), match/switch 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/inferred_type.rs"},"region":{"startLine":1570}}}],"partialFingerprints":{"codehealthFindingId/v1":"427e829e61581ba092c0c7c642f84c23b50c947b06e655f1e5fbd35c1562eb5a"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatGfmTableDelimiterCell::fmt_fields (cognitive 26): FormatGfmTableDelimiterCell::fmt_fields has cognitive complexity 26 (threshold 15). Drivers by points: loops 4 (15 pts), if/else 7 (8 pts), match/switch 1 (3 pts) (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_formatter/src/gfm/auxiliary/table_delimiter_cell.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"091df886def33322c43b48364408563bd67ed952202e6d84e1e837062c977bbd"}},{"ruleId":"D2","level":"warning","message":{"text":"Includes::run (cognitive 26): Includes::run has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_migrate/src/analyzers/includes.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"7746a58d837066cf10dfd5e9500815227b93c207cc55f98601fa20103a24b364"}},{"ruleId":"D2","level":"warning","message":{"text":"State::to_includes (cognitive 26): State::to_includes has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 2 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_migrate/src/analyzers/includes.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"e647affad6b60f15a218efe11e6a3f463dac04f23ee5804c805bd93eabd5a787"}},{"ruleId":"D2","level":"warning","message":{"text":"CssModuleVisitor::visit (cognitive 26): CssModuleVisitor::visit has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 3, 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/biome_module_graph/src/css_module_info/visitor.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f28bf75b6697be11f7588b9467285c8d3dfb5f4a5ba1f0e690004f4fb25ad7"}},{"ruleId":"D2","level":"warning","message":{"text":"UseNamingConventionOptions::from (cognitive 26): UseNamingConventionOptions::from has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 3, loops 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/biome_cli/src/execute/migrate/eslint_typescript.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d162497d0d6d1f385c731d976c1edca66c4d97ba3e1af0ca3df67e29618aaa5"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatYamlBlockContent::fmt_fields (cognitive 26): FormatYamlBlockContent::fmt_fields has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 4 (6 pts), boolean chains 4, match/switch 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_yaml_formatter/src/yaml/auxiliary/block_content.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"436196ac2caafb412b5c53ccf40c83d4f9d06646c31cd5ce75910e77221c2444"}},{"ruleId":"D2","level":"warning","message":{"text":"YamlLexer::consume_flow_collection (cognitive 26): YamlLexer::consume_flow_collection has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_yaml_parser/src/lexer/mod.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cb50e2545bbd31ce2d637d5037d9aa24ea5528cdf6e5e2d9ce3a36c668dcf77"}},{"ruleId":"D2","level":"warning","message":{"text":"SymbolsMicrosoftTestCase::run (cognitive 26): SymbolsMicrosoftTestCase::run has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 3 (5 pts), boolean chains 3, loops 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":"xtask/coverage/src/symbols/msts.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"41296190fb386f90f39f4f07543f6c91cb484e36a38e3c5b7cccdd595b5ff6f0"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfigurationInspector::inspect_key (cognitive 25): ConfigurationInspector::inspect_key has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 5, 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/biome_cli/src/commands/inspect/config/configuration.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"54fd4736c2621438ccd1576ea6db9f7f772bdcb5a4621c5138042e86bb83da2b"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckstyleReporterVisitor::report_diagnostics (cognitive 25): CheckstyleReporterVisitor::report_diagnostics has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 2 (6 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/reporter/checkstyle.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"4220eceab0d533b1a6528bc6800cf8215e0340f545bd6028a76f93f246c1fe37"}},{"ruleId":"D2","level":"warning","message":{"text":"UseVueVForKey::run (cognitive 25): UseVueVForKey::run has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (18 pts), boolean chains 3, match/switch 1 (3 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/correctness/use_vue_v_for_key.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de4b93336d6a3534371829005d95598fe2b739413e7503f5fa2f143ce4d8d6d"}},{"ruleId":"D2","level":"warning","message":{"text":"HtmlSplitChunksIterator::next (cognitive 25): HtmlSplitChunksIterator::next has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 2 (6 pts), boolean chains 3, 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/biome_html_formatter/src/utils/children.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a935c625c91a932c2584e0bc3a69455db8fad04b8582ed17c3f0cd9fb6a57c"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::assist::source::use_sorted_interface_members::sort_interface_members_in_place (cognitive 25): biome_js_analyze::assist::source::use_sorted_interface_members::sort_interface_members_in_place has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 3 (4 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/assist/source/use_sorted_interface_members.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"a01831c93ce78be6a8290b05f6e528f8028c1b7236603bdfa8581c2dd3603588"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::complexity::no_redundant_default_export::collect_exports (cognitive 25): biome_js_analyze::lint::complexity::no_redundant_default_export::collect_exports has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/complexity/no_redundant_default_export.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"676204c3d071355bd3b6d9a47e3bed7a663cfd5808698b03576c08f66d8ab580"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::correctness::use_import_extensions::get_extensionless_import (cognitive 25): biome_js_analyze::lint::correctness::use_import_extensions::get_extensionless_import has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 6, match/switch 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/use_import_extensions.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2d1e5979743f1d3e8b88d0bf6c7d02c380c43ed29d357f7976e65fbfba5b0e7"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::no_single_promise_in_promise_methods::unwrapped_all_target (cognitive 25): biome_js_analyze::lint::nursery::no_single_promise_in_promise_methods::unwrapped_all_target has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 5 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_single_promise_in_promise_methods.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3018e70d5f10e74f7322f9b8ced771ad70e5cd13041a8de2b082b808251a47d"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::no_undeclared_classes::collect_class_names_from_expression (cognitive 25): biome_js_analyze::lint::nursery::no_undeclared_classes::collect_class_names_from_expression has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 5 (12 pts), if/else 3 (7 pts), loops 3 (6 pts) (nesting depth added 14). 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/biome_js_analyze/src/lint/nursery/no_undeclared_classes.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7739cc03579970c4905eccfbfee73dbb9c91d84f6357568fed272de2235e16a"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::use_object_from_entries::reduce_entry (cognitive 25): biome_js_analyze::lint::nursery::use_object_from_entries::reduce_entry has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_object_from_entries.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e9f1244f619540880fdfab75df45ee8e6c46eb644986be0c720ac66315f0282"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::style::use_literal_enum_members::is_constant_enum_expression (cognitive 25): biome_js_analyze::lint::style::use_literal_enum_members::is_constant_enum_expression has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (21 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_literal_enum_members.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b72f8f4b8f684afaa1cfdccf7f6759b6ad1b44b3091d499012f234a4a8c1328"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatTsIntersectionTypeElementList::fmt (cognitive 25): FormatTsIntersectionTypeElementList::fmt has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (22 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/biome_js_formatter/src/ts/lists/intersection_type_element_list.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5934695ae1fb1ce00a2c0f3d23fa1a66ee2f6107daa03e0ee39778d33c8652"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeDataTransformer::transform (cognitive 25): TypeDataTransformer::transform has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (15 pts), match/switch 4 (9 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/type_transform.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf89a88e79d21dca3869fc700750f8fd559d5284f52ff293e0139fc4e93d9d8"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_type_info::return_type_relation::compare_declared_return_type_owned (cognitive 25): biome_js_type_info::return_type_relation::compare_declared_return_type_owned has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 6 (14 pts), if/else 7 (8 pts), boolean chains 3 (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/biome_js_type_info/src/return_type_relation.rs"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"d871bcf524a7ad3b94df38a3a2c4edf77796ff854070ccfa41bb553b88803cad"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer::lex_slash (cognitive 25): Lexer::lex_slash has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 3 (7 pts), loops 2 (4 pts) (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/biome_json_parser/src/lexer/mod.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"e46f2cef602da9ea6c61129bc8917164ef8768c3dba011dfc7ea9ccdea39ce00"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_formatter::markdown::lists::inline_item_list::outdented_list_marker_lines (cognitive 25): biome_markdown_formatter::markdown::lists::inline_item_list::outdented_list_marker_lines has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (21 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_formatter/src/markdown/lists/inline_item_list.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"f13f2697d7419ccc3dd1baff63f9204d75219c26f8a1fe5c5ee6495a25a75587"}},{"ruleId":"D2","level":"warning","message":{"text":"ResolutionCtx::resolve_element_type (cognitive 25): ResolutionCtx::resolve_element_type has cognitive complexity 25 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 3 (8 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":2283}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0b0755bb793ab5087c206346aa6fadf735bcd1180a2ce9aaa12e19dd0748be"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_module_graph::db::type_inference::resolver::cyclic_dependency_ids (cognitive 25): biome_module_graph::db::type_inference::resolver::cyclic_dependency_ids has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 6 (9 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/type_inference/resolver.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9d4965bfd8dd2506a0c0f5904347bda719bbeda9b78731ad4aa089e51cbad0"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_react_compiler::prefilter::has_react_like_functions (cognitive 25): biome_react_compiler::prefilter::has_react_like_functions has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (19 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_react_compiler/src/prefilter.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"0007a3d4f99bf12aaeb4118187e23f108a439f4ea77fa721c6628385c453c048"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_service::workspace_types::instance_type (cognitive 25): biome_service::workspace_types::instance_type has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (20 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/workspace_types.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef0e4bcd43e65c33ee884e1a8c07ef7f855d1ffde55bcfab0c600e011177f263"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_tailwind_logic::use_tailwind_sorted_classes::sort_v4::resolve_named_branch (cognitive 25): biome_tailwind_logic::use_tailwind_sorted_classes::sort_v4::resolve_named_branch has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (20 pts), match/switch 2 (3 pts), boolean chains 1, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_tailwind_logic/src/use_tailwind_sorted_classes/sort_v4.rs"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"09eadeb713ce09104a0c5df1bdf4ca9e1baaa55c21e582a30b6cb66bf1bc113f"}},{"ruleId":"D2","level":"warning","message":{"text":"YamlLexer::consume_block_properties (cognitive 25): YamlLexer::consume_block_properties has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 3, match/switch 2 (3 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_yaml_parser/src/lexer/mod.rs"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb656f53f98ca1a54dab89e95084c7e454d7ee372ba8dcc6b87b2e95ef6640b"}},{"ruleId":"D2","level":"warning","message":{"text":"index.run (cognitive 25): index.run has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 3 (10 pts), if/else 7 (8 pts), error handling 3 (7 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":"packages/prettier-compare/src/index.tsx"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"28fbd2e29e26c268f851389e506aae97c4962e4f2f30e367b6abec7b95bac7b0"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckProcessFile::process_file (cognitive 24): CheckProcessFile::process_file has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/runner/impls/process_file/check.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"97a5c59bd5e335546cd8fd1a00972e41716f2e7ad107dcd25434c47ca4f8d6a2"}},{"ruleId":"D2","level":"warning","message":{"text":"EmbeddedBindingsBuilder::visit_svelte_html_root (cognitive 24): EmbeddedBindingsBuilder::visit_svelte_html_root has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (16 pts), boolean chains 3, match/switch 1 (3 pts), loops 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_embeds/src/visitor.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"473d4d6786858ec7ffaac0db1843adfbc162a6f03f36ac96ba21590ce51c3458"}},{"ruleId":"D2","level":"warning","message":{"text":"Printer::print_text (cognitive 24): Printer::print_text has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 2 (5 pts), match/switch 3 (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/biome_formatter/src/printer/mod.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7bbb01b8ace7c8e06e18ca3cb26abe4fca7af19de3f2c54e4bf733a657abf13"}},{"ruleId":"D2","level":"warning","message":{"text":"GritLexer::consume_name (cognitive 24): GritLexer::consume_name has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 5 (12 pts), if/else 7 (11 pts), loops 1 (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_parser/src/lexer/mod.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e75dd3c8f1726651df9cca00ade0eed8f1907063e80a64a44712fd922f3706"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_grit_patterns::pattern_compiler::auto_wrap::auto_wrap_pattern (cognitive 24): biome_grit_patterns::pattern_compiler::auto_wrap::auto_wrap_pattern has cognitive complexity 24 (threshold 15). Drivers by points: if/else 17 (23 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_patterns/src/pattern_compiler/auto_wrap.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad4552fb9fc180f8540f64a20e1bccd141d76698a0a0fa3c4b0fec3f1b5fc1b"}},{"ruleId":"D2","level":"warning","message":{"text":"UseOptionalChain::action (cognitive 24): UseOptionalChain::action has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 3 (7 pts), loops 2 (4 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/biome_js_analyze/src/lint/complexity/use_optional_chain.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5b20f3ca9215400200c24689c129464e173cc38029621c744b610114e14fd28"}},{"ruleId":"D2","level":"warning","message":{"text":"Accesses::live_before (cognitive 24): Accesses::live_before has cognitive complexity 24 (threshold 15). Drivers by points: loops 6 (11 pts), if/else 3 (9 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 12). 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/biome_js_analyze/src/lint/nursery/no_useless_assignment.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb19bd7be65a0b9d09c1a0ed10c72614392494edb63ab2e4e22bd33387d67387"}},{"ruleId":"D2","level":"warning","message":{"text":"NoVueSideEffectsInComputed::run (cognitive 24): NoVueSideEffectsInComputed::run has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 4 (6 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_vue_side_effects_in_computed.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"488212752f941413dacb6dea1f7debee4b0a7d962071e43c5b17c587593090b2"}},{"ruleId":"D2","level":"warning","message":{"text":"UseVueValidDefineProps::run (cognitive 24): UseVueValidDefineProps::run has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 2 (4 pts), boolean chains 2, 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/biome_js_analyze/src/lint/nursery/use_vue_valid_define_props.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff8df9e0da8875dd596cbbe8255f619c947525aa8de3f70b0837b0be8fe127f"}},{"ruleId":"D2","level":"warning","message":{"text":"UseConsistentObjectDefinitions::run (cognitive 24): UseConsistentObjectDefinitions::run has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 9 (16 pts), if/else 3 (8 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/biome_js_analyze/src/lint/style/use_consistent_object_definitions.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1f0b0ed4b6e52d026ed19184df95ecea7f87db1a64a845e3d33d8b54887268"}},{"ruleId":"D2","level":"warning","message":{"text":"UseVueDefineMacrosOrder::run (cognitive 24): UseVueDefineMacrosOrder::run has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_vue_define_macros_order.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4a266598e3fdc009f2b84947a3bc7e1c0cb93ca9d3a27ba39d4d6908246ed4d"}},{"ruleId":"D2","level":"warning","message":{"text":"NoConstantBinaryExpressions::run (cognitive 24): NoConstantBinaryExpressions::run has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (19 pts), match/switch 3 (5 pts) (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/biome_js_analyze/src/lint/suspicious/no_constant_binary_expressions.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c940ae8f924edcefb54ca8ce3f10411db38fe28be49a60ed0823459d5675cd4"}},{"ruleId":"D2","level":"warning","message":{"text":"MissingAwaitVisitor::visit (cognitive 24): MissingAwaitVisitor::visit has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 7, match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/use_await.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"9572f4c0428a3b53e814d0e0cb896dbd2beffd48ff468d16f8e0c3cb62a24266"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::complexity::no_playwright_useless_await::has_async_modifier (cognitive 24): biome_js_analyze::lint::complexity::no_playwright_useless_await::has_async_modifier has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (17 pts), boolean chains 3, match/switch 2 (3 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/biome_js_analyze/src/lint/complexity/no_playwright_useless_await.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"015fc07dc086a700ae1bdd6ebbb593ed299f026b952cd1bc127709fc3f3ad520"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::no_vue_side_effects_in_computed::find_mutation (cognitive 24): biome_js_analyze::lint::nursery::no_vue_side_effects_in_computed::find_mutation has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (22 pts), boolean chains 1, 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/biome_js_analyze/src/lint/nursery/no_vue_side_effects_in_computed.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd06f216656eb2ee89730cfefe6ad6dd2d3045c438839715577eabf8d5b5965"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::use_consistent_boolean_name::type_state (cognitive 24): biome_js_analyze::lint::nursery::use_consistent_boolean_name::type_state has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_consistent_boolean_name.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d85202b7ec124474d379fa6c854e96218fc23a91d34a7574e4ecea2ed17087"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::use_svelte_reactive_classes::find_mutation (cognitive 24): biome_js_analyze::lint::nursery::use_svelte_reactive_classes::find_mutation has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 5, 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/biome_js_analyze/src/lint/nursery/use_svelte_reactive_classes.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"19cc45d51b91c022b0adfdac87cb0041238871e9a5b28095d6ab85c47bf76760"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::security::no_secrets::calculate_entropy_with_case_and_classes (cognitive 24): biome_js_analyze::lint::security::no_secrets::calculate_entropy_with_case_and_classes has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/security/no_secrets.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bcc3e307c19fb5b00dc77dd6762ab70e952c718271539a1a1956bbcc65d4e27"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatClass::fmt (cognitive 24): FormatClass::fmt has cognitive complexity 24 (threshold 15). Drivers by points: if/else 18 (22 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/biome_js_formatter/src/utils/format_class.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"1965015503456f637f83494657a1a8a3a8825fb5cb0eb5f497694fa884e390d9"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_formatter::js::bindings::parameters::should_hug_function_parameters (cognitive 24): biome_js_formatter::js::bindings::parameters::should_hug_function_parameters has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 7 (14 pts), if/else 4 (7 pts), boolean chains 3 (nesting depth added 10). Most of this is not in the body itself: 9 of the 24 points are its own statements and the rest belongs to one function item inside it that branches (hug_formal_parameter). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/js/bindings/parameters.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"d46bb794d7525175d2fc034b3f742a19c9e4a175cfd7c325013bd715bdd1f767"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_formatter::js::expressions::call_arguments::write_grouped_arguments (cognitive 24): biome_js_formatter::js::expressions::call_arguments::write_grouped_arguments has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (19 pts), match/switch 4, boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/js/expressions/call_arguments.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69a6045f69d9715eb432338b1b8bebcab1520b225e3295e92d7f700f05cba05"}},{"ruleId":"D2","level":"warning","message":{"text":"JsLexer::lex_template (cognitive 24): JsLexer::lex_template has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (20 pts), match/switch 2 (3 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/biome_js_parser/src/lexer/mod.rs"},"region":{"startLine":2216}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d07f2b267efebb465129dcd032e771ad8be6d355e55e0baaa0dade8368b8848"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_parser::syntax::stmt::parse_for_head (cognitive 24): biome_js_parser::syntax::stmt::parse_for_head has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 5 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_parser/src/syntax/stmt.rs"},"region":{"startLine":1598}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3b3948643b05b31f76cef44b47a26a7ec7581aca34335ae528706cc9bf257f"}},{"ruleId":"D2","level":"warning","message":{"text":"InferredType::is_at_least_as_wide_as_object (cognitive 24): InferredType::is_at_least_as_wide_as_object has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (14 pts), match/switch 3 (8 pts), boolean chains 1, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/inferred_type.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcbfe04e4820fb2eb2cb2d73b0b52a2e8ded6bab2457e9c9bb9828c9a550e620"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_type_info::type_operations::mapped_type (cognitive 24): biome_js_type_info::type_operations::mapped_type has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 3 (5 pts), loops 2 (4 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/biome_js_type_info/src/type_operations.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d3b907f014ac8114bdeb75497f10896b9dc435afc2e4046bd3896fd7f92b65"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_type_info::type_operations::indexed_access (cognitive 24): biome_js_type_info::type_operations::indexed_access has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 3 (6 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/type_operations.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"401d0c8fffd928bea18223716ff5c6ddff7815ef4fbe673cf15c713983a5a49e"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer::lex_string_literal (cognitive 24): Lexer::lex_string_literal has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 6 (14 pts), if/else 2 (8 pts), boolean chains 1, loops 1 (nesting depth added 14). 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/biome_json_parser/src/lexer/mod.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c65a20b6a8239fc852390d297076c1cb1c4d5d9b01c0e1d808a21544b14977"}},{"ruleId":"D2","level":"warning","message":{"text":"LSPServer::setup_capabilities (cognitive 24): LSPServer::setup_capabilities has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16 (17 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/server.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"e031f09e6ab36631e2a23abeae2c4ad7718fdca7a826d486201a749dfa624430"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeSpanNormalization::shortest_unused_backtick_sequence_len (cognitive 24): CodeSpanNormalization::shortest_unused_backtick_sequence_len has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (14 pts), loops 3 (7 pts), match/switch 1 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_formatter/src/markdown/auxiliary/inline_code.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c840f2e21de8cb15b4c8a11598d57ad73d8668fcf90da1f892c9efeb39bffef"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_parser::syntax::scan_newline_in_inline_list (cognitive 24): biome_markdown_parser::syntax::scan_newline_in_inline_list has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 8 (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/biome_markdown_parser/src/syntax/mod.rs"},"region":{"startLine":1781}}}],"partialFingerprints":{"codehealthFindingId/v1":"20bc23532bedd70f024113193a7bfb0fbf304ad8f4241e3de6f936ae46ab0e52"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_parser::syntax::textual_looks_like_list_marker (cognitive 24): biome_markdown_parser::syntax::textual_looks_like_list_marker has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 7 (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/biome_markdown_parser/src/syntax/mod.rs"},"region":{"startLine":2095}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb277271aaa54efb66045ec482fd7926709c5cfe3fd0b3edc8bb237a3124b86b"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_parser::syntax::list::parse_bullet (cognitive 24): biome_markdown_parser::syntax::list::parse_bullet has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 6, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c8901bc0384f9c55196fb77b7f6ef9c0834719d62987c450526c05b764f59f"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_parser::to_html::line_start_column_of (cognitive 24): biome_markdown_parser::to_html::line_start_column_of has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 4 (7 pts), match/switch 2 (5 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/to_html.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"92e86f29f0c37f958540e3661a02bcb092bfde9e4f9bb8666fe8fa8e28ffef65"}},{"ruleId":"D2","level":"warning","message":{"text":"HtmlModuleVisitor::collect_js_imports (cognitive 24): HtmlModuleVisitor::collect_js_imports has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (20 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/html_module_info/visitor.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b1e644aac39d19f15df19101b8fa9e8b9a64415ea7b8785afc2a40fd795e622"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_module_graph::db::queries::js_scc::compute_sccs (cognitive 24): biome_module_graph::db::queries::js_scc::compute_sccs has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 6 (9 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/biome_module_graph/src/db/queries/js_scc.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"68392f4ecc586cff3e6fa699f1dee56d19e47945b4ff8d9c26e518f6ea38fa58"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_module_graph::db::queries::type_inference::calls::implementation::collect_callback_return_replacements (cognitive 24): biome_module_graph::db::queries::type_inference::calls::implementation::collect_callback_return_replacements has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (18 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 14). 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/biome_module_graph/src/db/queries/type_inference/calls/implementation.rs"},"region":{"startLine":1943}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7969b01bcad38e81d84de11ff1cf86b29c65eb5349cc223b55c86dc4f201a7b"}},{"ruleId":"D2","level":"warning","message":{"text":"ProcessLint::process_signal (cognitive 24): ProcessLint::process_signal has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 1 (4 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/mod.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d65979040ada6c417b0cc65846842faa3b09823f09a60880169e56ba427031b"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_service::scanner::scan_dependencies (cognitive 24): biome_service::scanner::scan_dependencies has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 6 (8 pts) (nesting depth added 12). Of this number, 21 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/scanner.rs"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab618f20f05730f0e17e015688934db6dfcbbf55bd60c4c9d268ef93545c7f03"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask_codegen::generate_global_types::source::parse_lib_entries (cognitive 24): xtask_codegen::generate_global_types::source::parse_lib_entries has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/generate_global_types/source.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"575a6353d963d8411451d8fe454bcc6ac1bb6a4394210e997e2f4824c1354df0"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_analyze::shared::class_dedup::find_duplicate_classes (cognitive 23): biome_analyze::shared::class_dedup::find_duplicate_classes has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 5 (7 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/biome_analyze/src/shared/class_dedup.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d2bfcf6b6972bc23f74fffc35134cc1e6258a6a8043610358faee2421497d4"}},{"ruleId":"D2","level":"warning","message":{"text":"InspectedConfigurationFiles::composite_sources (cognitive 23): InspectedConfigurationFiles::composite_sources has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/commands/inspect/config/configuration.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b5b324fb4746fcbd29ff64049813ec35ba2b980fd9a657891ec6d44c2f6eaa"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_cli::execute::migrate::eslint::load_eslint_extends_config (cognitive 23): biome_cli::execute::migrate::eslint::load_eslint_extends_config has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (21 pts), match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/execute/migrate/eslint.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"392b8e81970e6c0cdb6caec971fe023431c18a99c81aed20af3251cd90c8dc54"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_cli::service::read_task (cognitive 23): biome_cli::service::read_task has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 4 (11 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/biome_cli/src/service/mod.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"755831bc20dd37384af1ed848657ab2cf8434e9471c49814c41d1e0869d5b792"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_css_analyze::lint::style::no_descending_specificity::find_descending_selector (cognitive 23): biome_css_analyze::lint::style::no_descending_specificity::find_descending_selector has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 1, loops 1 (nesting depth added 12). 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/biome_css_analyze/src/lint/style/no_descending_specificity.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"380803dce17283968fc793b8f87b8193084c24affeea9cb8f6d1159c97bfa30b"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_css_formatter::utils::component_value_list::get_value_list_layout (cognitive 23): biome_css_formatter::utils::component_value_list::get_value_list_layout has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_formatter/src/utils/component_value_list.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d690d603f0695abf252f4711af54bc43389b5ab7b7aa0a9434c08f3899c5a0"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_glob::validate_glob (cognitive 23): biome_glob::validate_glob has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (19 pts), match/switch 1 (2 pts), boolean chains 1, 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/biome_glob/src/lib.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"2786cd9f923665d5197f2b5b77eca7aee3f34842e7602d35957dc8921b3b274d"}},{"ruleId":"D2","level":"warning","message":{"text":"GritLexer::consume_string_literal (cognitive 23): GritLexer::consume_string_literal has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 6 (14 pts), if/else 2 (8 pts), loops 1 (nesting depth added 14). 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/biome_grit_parser/src/lexer/mod.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"c77fb90bb03fd0e3bcfdc7eb7b621af40197314328be6f75cfe23d8fdb6d68d6"}},{"ruleId":"D2","level":"warning","message":{"text":"UseVueValidVSlot::run (cognitive 23): UseVueValidVSlot::run has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 4, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/nursery/use_vue_valid_v_slot.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"1675e2a1cf917cfbf6655094c4b6a6a3a404a5af34bf9c0c13390668d1ad1019"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_html_analyze::lint::a11y::no_label_without_control::has_nested_control (cognitive 23): biome_html_analyze::lint::a11y::no_label_without_control::has_nested_control has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (17 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/a11y/no_label_without_control.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea4c6c32defbdfb0e79289787f1574de3b73aebae6c7e5a3744d88ad0d6e99fb"}},{"ruleId":"D2","level":"warning","message":{"text":"UseValidAnchor::run (cognitive 23): UseValidAnchor::run has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/a11y/use_valid_anchor.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2fc8f5335ce846b26553cc486a5340d504d65776c9292cc9982d1d7c61a6ffa"}},{"ruleId":"D2","level":"warning","message":{"text":"CognitiveComplexityVisitor::on_enter (cognitive 23): CognitiveComplexityVisitor::on_enter has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (23 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/biome_js_analyze/src/lint/complexity/no_excessive_cognitive_complexity.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffbb7610d4c655649f9cd977a188d74a5ea39a8e36f5f31dad39c8e1fa4dc5c3"}},{"ruleId":"D2","level":"warning","message":{"text":"NoComponentHookFactories::run (cognitive 23): NoComponentHookFactories::run has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 4, 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/biome_js_analyze/src/lint/correctness/no_component_hook_factories.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"49469656382234dcd6f95878cf4e591c3932db7e0a73ee9b91d1e9b0eec6e2e2"}},{"ruleId":"D2","level":"warning","message":{"text":"UseInlineScriptId::run (cognitive 23): UseInlineScriptId::run has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 2 (6 pts), boolean chains 3, 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/biome_js_analyze/src/lint/correctness/use_inline_script_id.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"8275933260de8e085d8ffc38d0fdbce4cc8d399ed8a2834f0d67cbf9e4333653"}},{"ruleId":"D2","level":"warning","message":{"text":"UseBlockStatements::action (cognitive 23): UseBlockStatements::action has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 1 (3 pts), match/switch 2 (3 pts) (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_block_statements.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee49508a03f1f708b55d1ef8108b44d633d143de4fb5fbe7d4e4fabe5db1bd7"}},{"ruleId":"D2","level":"warning","message":{"text":"UseConsistentCurlyBraces::action (cognitive 23): UseConsistentCurlyBraces::action has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (19 pts), match/switch 3 (4 pts) (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_consistent_curly_braces.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b3617d1b34be527a46fdca6f42d0270fea1ccfd675bbd79265ee2d7b8f51dff"}},{"ruleId":"D2","level":"warning","message":{"text":"UseFilenamingConvention::diagnostic (cognitive 23): UseFilenamingConvention::diagnostic has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_filenaming_convention.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9228ac0c8ac18739e97f7b1c38da78340106bc3efbceb7eba493c9d7e8da295"}},{"ruleId":"D2","level":"warning","message":{"text":"NoCommentText::run (cognitive 23): NoCommentText::run has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (4 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/biome_js_analyze/src/lint/suspicious/no_comment_text.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d10b66ef31d8189e4a0612b171026ac7f0f4cb04f58b5bf8712f88c0604ef2"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::no_mismatched_map_key::collect_mismatches (cognitive 23): biome_js_analyze::lint::nursery::no_mismatched_map_key::collect_mismatches has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (20 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/biome_js_analyze/src/lint/nursery/no_mismatched_map_key.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"e145777a9fc66df3ce9c759b80d7c35ae73f9b34d61558b1edb801a9cdcc67a7"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::no_undeclared_classes::collect_class_names_from_expression_no_semantic (cognitive 23): biome_js_analyze::lint::nursery::no_undeclared_classes::collect_class_names_from_expression_no_semantic has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 5 (12 pts), loops 3 (6 pts), if/else 2 (5 pts) (nesting depth added 13). 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/biome_js_analyze/src/lint/nursery/no_undeclared_classes.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c2efd0749d54f630bcda4e1be90be70ef7fc64a43bc5fc4bee4a94591d64614"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::style::use_at_index::analyze_slice_element_access (cognitive 23): biome_js_analyze::lint::style::use_at_index::analyze_slice_element_access has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 3 (4 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_at_index.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"412e34aca392e065d92be12960c9f186bb428af0b5c40c411cbdf2f4c6670350"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_factory::utils::escape (cognitive 23): biome_js_factory::utils::escape has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (9 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/biome_js_factory/src/utils.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c157a7bcf4272a5c9d12361c8fb142ba5234d2bf251bc50735852c30a8babe"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_formatter::comments::handle_if_statement_comment (cognitive 23): biome_js_formatter::comments::handle_if_statement_comment has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 5, match/switch 1 (nesting depth added 7). Of this number, 20 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/comments.rs"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe9b1052be7b6a5b7c09c50fc4ada7e6cd68f84c375448d38b72c27a6960d52"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_formatter::js::expressions::arrow_function_expression::format_signature (cognitive 23): biome_js_formatter::js::expressions::arrow_function_expression::format_signature has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 2, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/js/expressions/arrow_function_expression.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"79559d49477c9174e9c6662cd5ef1cc9832cacc92d4ce4f11933bcb0cef5462a"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_formatter::js::expressions::call_arguments::is_relatively_short_argument (cognitive 23): biome_js_formatter::js::expressions::call_arguments::is_relatively_short_argument has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 4, match/switch 2 (4 pts) (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/js/expressions/call_arguments.rs"},"region":{"startLine":1109}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c83153c4168cea26329f7c71bccfef0b0273e75507aafedf76ca3fc7064bbf6"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticEventExtractor::resolve_references_in_scope (cognitive 23): SemanticEventExtractor::resolve_references_in_scope has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (18 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/biome_js_semantic/src/events.rs"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"a815b632a2cc89cf78d5cb0b4f3561f10f0f95de0bce6d459d178c7754e2ad9b"}},{"ruleId":"D2","level":"warning","message":{"text":"AssignabilityCheck::find_member (cognitive 23): AssignabilityCheck::find_member has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 6 (10 pts), if/else 8 (9 pts), boolean chains 3, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/type_relation.rs"},"region":{"startLine":2056}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4309c354853e6d53bde92c68c43d8de127e06235f83acfd6a734d481c729648"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_parser::syntax::parse_indent_code_block (cognitive 23): biome_markdown_parser::syntax::parse_indent_code_block has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/mod.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"572738787d50fab3d75953495dbdfd722df902b19d421c47e65bf5d091e71386"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_parser::syntax::list::handle_first_line_marker_only (cognitive 23): biome_markdown_parser::syntax::list::handle_first_line_marker_only has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 7, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":2126}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6e914f4b0834800c8d28b7c65d60470a7ec39b3c2282e38e25f5ee5fee43f3"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_react_compiler::convert_ast::modules::convert_export (cognitive 23): biome_react_compiler::convert_ast::modules::convert_export has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 4 (8 pts) (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/biome_react_compiler/src/convert_ast/modules.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"eedf7e6f50fe2bdd575ff88d8c1cd4d0d130e8add9c1d52910abf0042f3a99a0"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_react_compiler::convert_scope::convert_scope_info (cognitive 23): biome_react_compiler::convert_scope::convert_scope_info has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 7 (9 pts), match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_react_compiler/src/convert_scope.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24df431f712f42fd05d94157d63ced2c96df104c2b14572066e6b2443f00391"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_resolver::resolve_package_path (cognitive 23): biome_resolver::resolve_package_path has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 2 (6 pts) (nesting depth added 14). 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/biome_resolver/src/lib.rs"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"426e62f851236e212dfab8bf370c42c7e3ffeac34a050765d928edf48968da6e"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_ruledoc_utils::parse_rule_options (cognitive 23): biome_ruledoc_utils::parse_rule_options has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (18 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_ruledoc_utils/src/lib.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"1375942ffa4a6621f4f1162fd96110a50ceed769a2db4ff4bbb1f439fd40abf0"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask_coverage::results::emit_compare (cognitive 23): xtask_coverage::results::emit_compare has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 1 (3 pts), match/switch 1 (3 pts) (nesting depth added 12). Most of this is not in the body itself: 2 of the 23 points are its own statements and the rest belongs to 2 function items inside it that branch (diff_format, summary). 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":"xtask/coverage/src/results.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d684ec75228c00be9162a7b04336ad5700c858e201b3327e841e7e93bad576"}},{"ruleId":"D2","level":"warning","message":{"text":"RageConfiguration::fmt (cognitive 22): RageConfiguration::fmt has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 2 (5 pts), loops 1 (4 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/biome_cli/src/commands/rage.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"c47bc0b927154d370e8c611556f8898e653d66ab3edfb98ff694cf92af0a639d"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_css_analyze::assist::source::use_sorted_properties::contains_property_conflicts (cognitive 22): biome_css_analyze::assist::source::use_sorted_properties::contains_property_conflicts has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_analyze/src/assist/source/use_sorted_properties.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d92c4d825d820c6c91402a4df3d1d789234fc9682bd011af383e61d7feef11"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatCustomIdentifier::fmt (cognitive 22): FormatCustomIdentifier::fmt has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 7, 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/biome_css_syntax/src/property_syntax/data.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"40069102e4a3ec8ca5ddac93fb3fdc0ff7c5ba60d44748b5830048b1b8782cc7"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_deserialize::yaml::block_scalar::block_scalar_value (cognitive 22): biome_deserialize::yaml::block_scalar::block_scalar_value has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 5 (7 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/biome_deserialize/src/yaml/block_scalar.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba02fd55419d32281001557e68d2e326976d86ffaf2d52d01a8b42e738dc8f73"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_fs::fs::os::handle_any_file (cognitive 22): biome_fs::fs::os::handle_any_file has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (20 pts), match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_fs/src/fs/os.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"6202acb41207e61cfff387f48893057b5d2dc3bd58bbb0b32dddfb6a7552c484"}},{"ruleId":"D2","level":"warning","message":{"text":"GritLexer::consume_number (cognitive 22): GritLexer::consume_number has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 8 (20 pts), if/else 1, loops 1 (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_parser/src/lexer/mod.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f9ffde7a45822755e35f05ba7e5d4bb970c8fb7bb19fd58a76fdee705bb25e1"}},{"ruleId":"D2","level":"warning","message":{"text":"NoAriaHiddenOnFocusable::run (cognitive 22): NoAriaHiddenOnFocusable::run has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (19 pts), match/switch 1 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/a11y/no_aria_hidden_on_focusable.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c53ac723a79484749a7ad90306206e560f563e2b6d87029143750b8b3451c0d"}},{"ruleId":"D2","level":"warning","message":{"text":"NumberLiteral::try_from (cognitive 22): NumberLiteral::try_from has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 3 (6 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/complexity/use_simple_number_keys.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0cadecb3e193dcd89b9e88cf4df771f11edf3d2073446d3fafa44812d6d3d14"}},{"ruleId":"D2","level":"warning","message":{"text":"NoUnusedVariables::run (cognitive 22): NoUnusedVariables::run has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 10 (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/biome_js_analyze/src/lint/correctness/no_unused_variables.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"5673f7398ca80a2a47a522cb9d49e9e76d43e01c64dbb8a3dc229e43ff863f58"}},{"ruleId":"D2","level":"warning","message":{"text":"NoUselessSpread::run (cognitive 22): NoUselessSpread::run has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_useless_spread.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7731546322d7aebfa6b487ddc92f580e4530dbbe8f6523560bd5849f1700992"}},{"ruleId":"D2","level":"warning","message":{"text":"NoAwaitInLoops::run (cognitive 22): NoAwaitInLoops::run has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 5, match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/performance/no_await_in_loops.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7e139aeda108f7f61d21ad63c5a7da9b54cc2862a155fd3ced24f36057bc40f"}},{"ruleId":"D2","level":"warning","message":{"text":"NoInferrableTypes::run (cognitive 22): NoInferrableTypes::run has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 2 (6 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/biome_js_analyze/src/lint/style/no_inferrable_types.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"450559516beb6044193d01635122498ae3c439c22009f0d6ae07bb27f477ea05"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::no_eager_array_methods_in_loops::is_iterator_type (cognitive 22): biome_js_analyze::lint::nursery::no_eager_array_methods_in_loops::is_iterator_type has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (16 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_eager_array_methods_in_loops.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"60bdbdd8269f6b0bbdf8907558ddf580821abe8d2d10b7a50a4de993f7432f7b"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::suspicious::no_useless_regex_backrefs::get_issue (cognitive 22): biome_js_analyze::lint::suspicious::no_useless_regex_backrefs::get_issue has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/no_useless_regex_backrefs.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e5a2e74c0c9cd4f2db4a58ff0abfdfade83e9235dd626fcfa57f9f8a276fc35"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::utils::same_reference::is_same_reference (cognitive 22): biome_js_analyze::utils::same_reference::is_same_reference has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (16 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/utils/same_reference.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"b88f9bc2c934f8efac1fa16adc2e4c2088fbbaa78aedaeab7a82330e6dfe4157"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_parser::syntax::expr::parse_member_expression_rest (cognitive 22): biome_js_parser::syntax::expr::parse_member_expression_rest has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 2 (5 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/biome_js_parser/src/syntax/expr.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa06031637fd96d4c91be89f90d7c55be0091be0fef3a071da939f47881cc7e8"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_parser::syntax::function::parse_formal_parameter (cognitive 22): biome_js_parser::syntax::function::parse_formal_parameter has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_parser/src/syntax/function.rs"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"550590b03eb5a7ba1d53769b4288d58e8b46a7c6ac7b97d1ef67fb6d9551aae0"}},{"ruleId":"D2","level":"warning","message":{"text":"JsDeclarationKind::from_node (cognitive 22): JsDeclarationKind::from_node has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 3 (10 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/biome_js_semantic/src/semantic_model/binding.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"f050e81f4f973a6e7562ea0e723f9c349a1fc06d418127043057756c389d5c12"}},{"ruleId":"D2","level":"warning","message":{"text":"InferredType::function_returns_promise_with (cognitive 22): InferredType::function_returns_promise_with has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 2 (5 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/biome_js_type_info/src/inferred_type.rs"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"e96f835029d709944dd28eabc3683cfa345e49be44dcc3bf4ca415612765a377"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeMember::collect_class_members (cognitive 22): TypeMember::collect_class_members has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 4, match/switch 2 (3 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/local_inference.rs"},"region":{"startLine":2778}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b867f4912a1aafc08a9b79d9a0b800bb13d931c1365a316953866d8c83effda"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer::lex_number (cognitive 22): Lexer::lex_number has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 8 (20 pts), if/else 1, loops 1 (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_json_parser/src/lexer/mod.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"40eb7139654f6d512f65b94efb54c9afc20f9a897c38ca42fbfaeff95f54ee00"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_parser::inline_phase::validate_deferred_inlines (cognitive 22): biome_markdown_parser::inline_phase::validate_deferred_inlines has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 3 (5 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/inline_phase.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9dbe54637d236254b7f9eb73a59a7b162e393a0eb8fa0c8ac224e975b2a90a1"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_parser::syntax::list::blank_line_phase_after_prefix (cognitive 22): biome_markdown_parser::syntax::list::blank_line_phase_after_prefix has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 5 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":1962}}}],"partialFingerprints":{"codehealthFindingId/v1":"21734e728a675f491e18761b5b2723e06d2d3238127a55122d680521261d1a2b"}},{"ruleId":"D2","level":"warning","message":{"text":"CssPropertyTraversal::last_property_in_module_context_from (cognitive 22): CssPropertyTraversal::last_property_in_module_context_from has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 3 (7 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/css_module_info/traverse.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a24fef07599c082e2cadec938c9a2624ce916c7460a87deb9629fb73c56d04"}},{"ruleId":"D2","level":"warning","message":{"text":"ArgumentTypeCompatibility::argument_extends_local_parameter (cognitive 22): ArgumentTypeCompatibility::argument_extends_local_parameter has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (19 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/queries/type_inference/calls/implementation.rs"},"region":{"startLine":1383}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ac295659a4fbb12ab9d20c77d96c244094a5e3572d8fff78b8cf2ef584c2f33"}},{"ruleId":"D2","level":"warning","message":{"text":"ResolutionCtx::solve_flow (cognitive 22): ResolutionCtx::solve_flow has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (5 pts), match/switch 2 (5 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/type_inference/flow.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c524bb0c1b67236a4958fbd680aba6c3508e4e3f15c297b2ab217d13a8060e2"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_module_graph::db::queries::css::traverse_import_tree_for_html_classes (cognitive 22): biome_module_graph::db::queries::css::traverse_import_tree_for_html_classes has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (6 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/queries/css.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"c284e17caf4398c77b4a4e3e1ce59e90821d320e44d817d643375b33496f2c9e"}},{"ruleId":"D2","level":"warning","message":{"text":"AnalyzerJsPlugin::evaluate (cognitive 22): AnalyzerJsPlugin::evaluate has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (5 pts), match/switch 2 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_plugin_loader/src/analyzer_js_plugin.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2bbe4f490783db11fdd916b7a4c40067c65308f1f1833babe9c44e2afe1fee0"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_ruledoc_utils::analyzer::process_signal (cognitive 22): biome_ruledoc_utils::analyzer::process_signal has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 3 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_ruledoc_utils/src/analyzer.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef4730a281ce2aafd50e09c96b0a23de17a43e5b84dc41a33617785dfda9ef95"}},{"ruleId":"D2","level":"warning","message":{"text":"DisplayDomains::fmt (cognitive 22): DisplayDomains::fmt has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (7 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/biome_service/src/documentation/mod.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"843f4296683984dde6b962da79ddd2f0cb70f742637f9696d6b8d796a4a512a1"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_service::file_handlers::html::format_embedded (cognitive 22): biome_service::file_handlers::html::format_embedded has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 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/biome_service/src/file_handlers/html.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"a52465773a58730f32e37ce40ab6dac2b22a199bb28ac1a69303798f14125656"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_tailwind_logic::use_tailwind_sorted_classes::sort_v4::compile_custom_functional (cognitive 22): biome_tailwind_logic::use_tailwind_sorted_classes::sort_v4::compile_custom_functional has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 2 (5 pts), boolean chains 4, loops 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/biome_tailwind_logic/src/use_tailwind_sorted_classes/sort_v4.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd3e0cd769565c6f2322ac63d44cb7e9dff2ceb6bbbad694a39f37d686d21fa"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_yaml_formatter::flow_scalar::normalize_quotes (cognitive 22): biome_yaml_formatter::flow_scalar::normalize_quotes has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 4 (6 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/biome_yaml_formatter/src/flow_scalar.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4fcce302ba49aeb7fa6bed276ccf2a4c2f7935b4fefba4c306b017f59c72e7"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask_codegen::generate_global_types::lower::overrides::lower_error_constructor_signatures (cognitive 22): xtask_codegen::generate_global_types::lower::overrides::lower_error_constructor_signatures has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (14 pts), match/switch 2 (5 pts), loops 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/generate_global_types/lower/overrides.rs"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6914682b2135937468eb5668ad2b8adc28f7f3af8a8ce4c6c1d7188f86fa342"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask_codegen::generate_js_plugin_ast::generate_typescript (cognitive 22): xtask_codegen::generate_js_plugin_ast::generate_typescript has cognitive complexity 22 (threshold 15). Drivers by points: loops 6 (9 pts), if/else 3 (6 pts), match/switch 2 (6 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/generate_js_plugin_ast.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"805a68d76705566a8b2710201083593a484d2d17b0b0954c7a06f836c47cc1ca"}},{"ruleId":"D2","level":"warning","message":{"text":"RunningBiomeServer::fmt (cognitive 21): RunningBiomeServer::fmt has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 3 (8 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/commands/rage.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"627a0831cc9ce845c60a0ac8c0c509a3de8666e4b548dffb7fd759401489d01b"}},{"ruleId":"D2","level":"warning","message":{"text":"SelectorWalker::visit_selector (cognitive 21): SelectorWalker::visit_selector has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 4 (8 pts), loops 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_analyze/src/lint/nursery/no_excessive_selector_complexity.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"82f2686772fa89461fc546a9c2797be06f019f5017796281446ab1e3cd98ada1"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_css_analyze::lint::nursery::use_logical_properties::merge_longhands_violation (cognitive 21): biome_css_analyze::lint::nursery::use_logical_properties::merge_longhands_violation has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 5, 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/biome_css_analyze/src/lint/nursery/use_logical_properties.rs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"e056c72411e8401c0d5092b9fd57b5dfbb4caf816e1570eb4baa3081b4c1405c"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_css_analyze::lint::nursery::use_logical_properties::make_split_declaration (cognitive 21): biome_css_analyze::lint::nursery::use_logical_properties::make_split_declaration has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_analyze/src/lint/nursery/use_logical_properties.rs"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"a252ef83284b01ac5ab180fc901fdfe74a6ff11a6a31b2dc70aa8553d30b2457"}},{"ruleId":"D2","level":"warning","message":{"text":"EmbeddedBindingsBuilder::visit_js_import (cognitive 21): EmbeddedBindingsBuilder::visit_js_import has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_embeds/src/visitor.rs"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb4e8a917c1c3ca2d2c05379915f7455388ed3c274bcdbae4ba49c016186d55"}},{"ruleId":"D2","level":"warning","message":{"text":"GritTargetNode::matches_kinds_recursively_with (cognitive 21): GritTargetNode::matches_kinds_recursively_with has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 4, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_patterns/src/grit_target_node.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eae924c139bfc711138769d84a5f94a0e37b6f727d37f462c8e8ca748dc2afb"}},{"ruleId":"D2","level":"warning","message":{"text":"UsePlaywrightValidDescribeCallback::run (cognitive 21): UsePlaywrightValidDescribeCallback::run has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/use_playwright_valid_describe_callback.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c047f2ab556dc9abf2f1a57ada6781e2ebd247a26fda1224ce668997c7032d"}},{"ruleId":"D2","level":"warning","message":{"text":"UseVueMatchingComponentFileName::run (cognitive 21): UseVueMatchingComponentFileName::run has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_vue_matching_component_file_name.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeca6ce1533e3d7dec34dfad1735d27a2f341db059f32e0b235e5e6003586819"}},{"ruleId":"D2","level":"warning","message":{"text":"NoUselessEscapeInString::run (cognitive 21): NoUselessEscapeInString::run has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 2 (4 pts), loops 1 (2 pts) (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/no_useless_escape_in_string.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"a71a26750cf55b4d0aa219be8dceb2e1d779895490fff19ece9d9cedbf596514"}},{"ruleId":"D2","level":"warning","message":{"text":"UseGuardForIn::run (cognitive 21): UseGuardForIn::run has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 3 (7 pts) (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/use_guard_for_in.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea1d2924edf763c0c75f169b2e61d074593f4516e6814d7232b736a7b8d3b319"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::complexity::no_useless_return::is_tail_position (cognitive 21): biome_js_analyze::lint::complexity::no_useless_return::is_tail_position has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/complexity/no_useless_return.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c3f38c636776a4d774209eecf1b998bccdc618d5a5092a1cd572828a273fba"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::correctness::no_unreachable::exceeds_complexity_threshold (cognitive 21): biome_js_analyze::lint::correctness::no_unreachable::exceeds_complexity_threshold has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (14 pts), loops 2 (3 pts), match/switch 1 (3 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/biome_js_analyze/src/lint/correctness/no_unreachable.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d13a76176d5f13f7a8a74ef91f16c54f6d971534e54ab671106f622c35bf6e"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::correctness::use_qwik_method_usage::is_inside_component_or_hook (cognitive 21): biome_js_analyze::lint::correctness::use_qwik_method_usage::is_inside_component_or_hook has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/use_qwik_method_usage.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"07630fca9e769cc1cdf892688557e0fa365e07bf31d3fe414f75d006a4e6d70e"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::use_block_statement_over_iife::needs_function_scope (cognitive 21): biome_js_analyze::lint::nursery::use_block_statement_over_iife::needs_function_scope has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 4, match/switch 2 (4 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_block_statement_over_iife.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"645c8b34ae4ebfe81e3d5a7d1bbc6f89f71f5729db99ed257d601bc6d00d319b"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::suspicious::no_confusing_void_type::decide_void_type_context (cognitive 21): biome_js_analyze::lint::suspicious::no_confusing_void_type::decide_void_type_context has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (15 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/no_confusing_void_type.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"73adb1114a5cfc62f612e0ede4545015280712bb4cd3ff1e31283cf7d28e64e8"}},{"ruleId":"D2","level":"warning","message":{"text":"JsCallExpression::is_test_call_expression (cognitive 21): JsCallExpression::is_test_call_expression has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 4, 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/biome_js_syntax/src/expr_ext.rs"},"region":{"startLine":2175}}}],"partialFingerprints":{"codehealthFindingId/v1":"d70f52df17173a419328df3c7968beda5f7320cfd9a4b189f8334c687317daf3"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_syntax::parentheses::expression::binary_like_needs_parens (cognitive 21): biome_js_syntax::parentheses::expression::binary_like_needs_parens has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 4, match/switch 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_syntax/src/parentheses/expression.rs"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"730409289fb02a8ccf03b4dee68da7111bbe92385ea9c472dd4b489e8962092e"}},{"ruleId":"D2","level":"warning","message":{"text":"InferredType::boolean_coercion (cognitive 21): InferredType::boolean_coercion has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 3, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/inferred_type/boolean_coercion.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba61ec1a0b12c50818cfa8ceb3d5e0d155affbf7d8373dd0cd2970247a0ba17"}},{"ruleId":"D2","level":"warning","message":{"text":"InferredType::has_computed_member (cognitive 21): InferredType::has_computed_member has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (16 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/biome_js_type_info/src/inferred_type.rs"},"region":{"startLine":1715}}}],"partialFingerprints":{"codehealthFindingId/v1":"e29585b8e9aaffc579b5aa123774da8849fe03ebdb883a4e4b4dbf53a9773bf1"}},{"ruleId":"D2","level":"warning","message":{"text":"AssignabilityCheck::is_structurally_assignable (cognitive 21): AssignabilityCheck::is_structurally_assignable has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (10 pts), match/switch 3 (6 pts), boolean chains 3, loops 2 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/type_relation.rs"},"region":{"startLine":1783}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb556c0bbb40496526242e1c94f27175500db94c1117a32d06ab7255229fb9c"}},{"ruleId":"D2","level":"warning","message":{"text":"NoUntrustedLicenses::run (cognitive 21): NoUntrustedLicenses::run has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_json_analyze/src/lint/suspicious/no_untrusted_licenses.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"297c6176faa2f65faac2c13bb598e7a11984eb7426402c1ebbc83363dbf6f946"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_formatter::quote::block_list_has_quote_continuation (cognitive 21): biome_markdown_formatter::quote::block_list_has_quote_continuation has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (14 pts), loops 2 (5 pts), match/switch 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_formatter/src/quote.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb61733c3fcbbcb4096fda4d53ff4916a72e3e9af8dbbd9168d5fa596e41dc25"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_parser::syntax::inline::code_span::parse_inline_code (cognitive 21): biome_markdown_parser::syntax::inline::code_span::parse_inline_code has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 4, 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/biome_markdown_parser/src/syntax/inline/code_span.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e7471d25332e9b90aa4336fb06765feaa724cd6326e33fa4537efab2f2e738"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_parser::syntax::link_block::parse_link_destination (cognitive 21): biome_markdown_parser::syntax::link_block::parse_link_destination has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 4 (7 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/link_block.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdedb82bf3f6e1e45c22aff08e8179f6eaeff85e37d43efc4c6ec9581c22ad1e"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_parser::syntax::mdx::jsx_tag_pairing_diagnostics (cognitive 21): biome_markdown_parser::syntax::mdx::jsx_tag_pairing_diagnostics has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (5 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/mdx.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"e00dffd4a5cff2731c096e02b389e6f3af6b2eec90bbe410f0ea8c8b9df3a151"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_module_graph::html_module_info::visitor::collect_css_classes (cognitive 21): biome_module_graph::html_module_info::visitor::collect_css_classes has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (16 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/biome_module_graph/src/html_module_info/visitor.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"9abbc95e62ddb192bf7e56a1065e561d707cdc000ce4ff1089e4c36ca97eb53e"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_parser::event::process (cognitive 21): biome_parser::event::process has cognitive complexity 21 (threshold 15). Drivers by points: if/else 2 (8 pts), loops 3 (7 pts), match/switch 2 (6 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_parser/src/event.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b87267538769b32ac107f011711bfeeccd102bd3104bf4d42ce9820d8e5308"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectDb::get_file_features (cognitive 21): ProjectDb::get_file_features has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 7, loops 1 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/projects.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af1666acbbcfa94df3bb10ee43631e5a3bbf75a7a4e6744acbb1721ffd4184c"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceServerWithDb::resolve_binding_in_document_or_snippets (cognitive 21): WorkspaceServerWithDb::resolve_binding_in_document_or_snippets has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 4 (8 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/workspace/server.rs"},"region":{"startLine":1097}}}],"partialFingerprints":{"codehealthFindingId/v1":"00bdc1897207183315650236228f792b161126ac5c5fcc22a8f1befd3bebc548"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_vue_semantic::semantic_model::layout::visit_attribute (cognitive 21): biome_vue_semantic::semantic_model::layout::visit_attribute has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 5 (11 pts), if/else 3 (6 pts), loops 1 (4 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/biome_vue_semantic/src/semantic_model/layout.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdfc05a61d72bd64c112b6cf4460e0680659322e966d4dfa4d85433c15f9c109"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_vue_semantic::semantic_model::snippets::find_host (cognitive 21): biome_vue_semantic::semantic_model::snippets::find_host has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 3 (7 pts), boolean chains 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_vue_semantic/src/semantic_model/snippets.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1d66361bf0fc82a9fb5f06608c7b46893587b465abd2f07cf64ca2f92023b8"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask_coverage::ts::ts_microsoft::extract_metadata (cognitive 21): xtask_coverage::ts::ts_microsoft::extract_metadata has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/coverage/src/ts/ts_microsoft.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad848e905e6504ee62a192918c575f051417c51ab48215099169aa8980f0b0b2"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_analyze::utils::fix_separators (cognitive 20): biome_analyze::utils::fix_separators has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 3, match/switch 1 (3 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/biome_analyze/src/utils.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed94d994e0481cd875c70b9b3babc0224752c9784402388133b2e5cb1947454"}},{"ruleId":"D2","level":"warning","message":{"text":"RecessOrderMember::kind (cognitive 20): RecessOrderMember::kind has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 4 (8 pts) (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_analyze/src/assist/source/use_sorted_properties.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbde33cbd77b11372b560aedbf1afcd68d325e0282750fd609a6c3d13d2e366f"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_css_analyze::lint::nursery::use_logical_properties::collect_function_expression_violations (cognitive 20): biome_css_analyze::lint::nursery::use_logical_properties::collect_function_expression_violations has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_analyze/src/lint/nursery/use_logical_properties.rs"},"region":{"startLine":1626}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff8583a4f33e74869fceb19f3a71fc9d011d4010c9eff819f00b5965511ce3b0"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatCssDeclarationOrRuleList::fmt (cognitive 20): FormatCssDeclarationOrRuleList::fmt has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 3 (6 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_formatter/src/css/lists/declaration_or_rule_list.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae51a563aba27168278c1b0c2eee1eaafb91d370cb428ce9216bdc615bbb040"}},{"ruleId":"D2","level":"warning","message":{"text":"CommaGroupsWriter::write_next_group (cognitive 20): CommaGroupsWriter::write_next_group has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_formatter/src/utils/component_value_list/comma_groups.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea8a1c3884a26d9a2a9d249a1e1bd306338de33e0e186ba2d89dee47be394d03"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_css_formatter::utils::scss_interpolated_string::raw_interpolation::normalize_numbers_in_string_token (cognitive 20): biome_css_formatter::utils::scss_interpolated_string::raw_interpolation::normalize_numbers_in_string_token has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_formatter/src/utils/scss_interpolated_string/raw_interpolation.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"766ab0bd8827285941238e8b79b8ae9e8798c5c1ef6143aaf830e9b455796a21"}},{"ruleId":"D2","level":"warning","message":{"text":"PageAtRuleItemList::parse_element (cognitive 20): PageAtRuleItemList::parse_element has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_parser/src/syntax/at_rule/page.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"bab930951c85c064c7153ac7917f554e7b32fbb2a7ff28671faefe06b7e9beba"}},{"ruleId":"D2","level":"warning","message":{"text":"Encoder::encode (cognitive 20): Encoder::encode has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_syntax/src/property_syntax/parser.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c78d634811ba7a1595091e6d2d112be4c3c4a2fa8e0cc7957d860856523060"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_embeds::references::vue_directive_name_matches_reference_name (cognitive 20): biome_embeds::references::vue_directive_name_matches_reference_name has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_embeds/src/references.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e3a7c636c5efe26adcdfcf3ea9e9713ff2d39bb3f0ec90be774fee2bae2f4b"}},{"ruleId":"D2","level":"warning","message":{"text":"FitsMeasurer::fits_text (cognitive 20): FitsMeasurer::fits_text has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 2 (5 pts), loops 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/biome_formatter/src/printer/mod.rs"},"region":{"startLine":1565}}}],"partialFingerprints":{"codehealthFindingId/v1":"2faad6e0b6657a010760292425d1f20993abcffb008f12276e2c253ed88a83d9"}},{"ruleId":"D2","level":"warning","message":{"text":"GritQuery::find_matches (cognitive 20): GritQuery::find_matches has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (8 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/biome_grit_patterns/src/grit_query.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"10cfca6b6a238835e59c7ea4fc8c3369e091fe9401c90bc74546e47a27ef2bee"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_grit_patterns::linearization::linearize_binding (cognitive 20): biome_grit_patterns::linearization::linearize_binding has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 1 (4 pts), loops 2, 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/biome_grit_patterns/src/linearization.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"43dc1f2318d2f67beb3b5c329f14879e3f201c9d30adb681e89bf3ef6b82ce0e"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_html_analyze::lint::style::use_vue_hyphenated_attributes::extract_attribute_name (cognitive 20): biome_html_analyze::lint::style::use_vue_hyphenated_attributes::extract_attribute_name has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 5 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/style/use_vue_hyphenated_attributes.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0d53335353fcbe23b537b347792f6a8ed05a07c70f1a3d22be79e18c400755"}},{"ruleId":"D2","level":"warning","message":{"text":"NoEmptyCharacterClassInRegex::run (cognitive 20): NoEmptyCharacterClassInRegex::run has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 1 (2 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/biome_js_analyze/src/lint/correctness/no_empty_character_class_in_regex.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"40cefe5f5f33ad77fea89480d03469335b169ff14399b3a5fde1162f91521e9b"}},{"ruleId":"D2","level":"warning","message":{"text":"CharCaseIterator::next (cognitive 20): CharCaseIterator::next has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (6 pts), match/switch 2 (5 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/no_string_case_mismatch.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"b506877a1b67c1363731e512b522e866ab6ee0e6982b7dde933c30e286ae9dec"}},{"ruleId":"D2","level":"warning","message":{"text":"NoAstroConflictingSetDirectives::run (cognitive 20): NoAstroConflictingSetDirectives::run has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_astro_conflicting_set_directives.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d26d66f39c625ca23b287e2f2b7ebf16c4bf0abaa7e37e456fcbb9270817bd"}},{"ruleId":"D2","level":"warning","message":{"text":"NoTanstackQueryVoidQueryFn::run (cognitive 20): NoTanstackQueryVoidQueryFn::run has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 2 (5 pts) (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/biome_js_analyze/src/lint/nursery/no_tanstack_query_void_query_fn.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f099f83fe0ee7ce640ddf67d35ceb1f9e9d499ca14ee96e70ccd52d4436ba4c"}},{"ruleId":"D2","level":"warning","message":{"text":"Function::analyze (cognitive 20): Function::analyze has cognitive complexity 20 (threshold 15). Drivers by points: loops 5 (13 pts), if/else 1 (4 pts), match/switch 1 (3 pts) (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_atomic_updates.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"deea73684bdefb6bcf4780acfd962ee1eaf8120cf9eae1c339b022eab5bdaf1c"}},{"ruleId":"D2","level":"warning","message":{"text":"NoDangerouslySetInnerHtml::run (cognitive 20): NoDangerouslySetInnerHtml::run has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 1 (4 pts), match/switch 2 (3 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/biome_js_analyze/src/lint/security/no_dangerously_set_inner_html.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"01e62876e6526599d83de3bb0ace84b37269100c123d8d2a0e2c8105491474db"}},{"ruleId":"D2","level":"warning","message":{"text":"NoJsxLiterals::run (cognitive 20): NoJsxLiterals::run has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 2 (3 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/no_jsx_literals.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"5913b471637916027fff6d83dd8fe29c7202374d228156d15b0c032215dfefcd"}},{"ruleId":"D2","level":"warning","message":{"text":"UseConsistentArrowReturn::action (cognitive 20): UseConsistentArrowReturn::action has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 1 (3 pts), match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_consistent_arrow_return.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef3831331fc6e6c08ef3bd03c2f107a233e7dbcb8ed5583e79c6a1af7ee5f119"}},{"ruleId":"D2","level":"warning","message":{"text":"UseTrimStartEnd::action (cognitive 20): UseTrimStartEnd::action has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15 (16 pts), match/switch 3 (4 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_trim_start_end.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"03efb9690b485bd45e125a9e7c4fcf721cb2340692df5603d391ef602d0879a6"}},{"ruleId":"D2","level":"warning","message":{"text":"UseUnicodeRegex::action (cognitive 20): UseUnicodeRegex::action has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 4 (8 pts), boolean chains 1, match/switch 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/biome_js_analyze/src/lint/style/use_unicode_regex.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb87e5acc2f33009ea4828b7a84caa4898471a1ad22a55d35b9e8b4746be444"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::correctness::no_playwright_missing_await::has_expect_in_chain (cognitive 20): biome_js_analyze::lint::correctness::no_playwright_missing_await::has_expect_in_chain has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 2 (4 pts), boolean chains 2 (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/biome_js_analyze/src/lint/correctness/no_playwright_missing_await.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f5f1dddb1da3b4f31cf6d9b476c93b7297bf6abb601e92dfad7688b5dee41c9"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::correctness::no_playwright_missing_await::is_call_awaited_or_returned (cognitive 20): biome_js_analyze::lint::correctness::no_playwright_missing_await::is_call_awaited_or_returned has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 4, match/switch 2 (4 pts), 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/biome_js_analyze/src/lint/correctness/no_playwright_missing_await.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"337d8bb89b4a9c73b2e9ee00addbb56e9b3bb3ca0d09513fde5e2ee20ee3c9cc"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::no_useless_spread::splice (cognitive 20): biome_js_analyze::lint::nursery::no_useless_spread::splice has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_useless_spread.rs"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"c09ca0bced15e963d92201dcbb4124c0af1386a7cf6737af954788e2aa9fc7f5"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::use_object_from_entries::loop_object_statement (cognitive 20): biome_js_analyze::lint::nursery::use_object_from_entries::loop_object_statement has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 4, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_object_from_entries.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0a62fe72188646d75a3e2eb1a2360c1a814ad88e3d1dee01598859bb792eeb8"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::suspicious::no_then_property::process_js_export_named_clause (cognitive 20): biome_js_analyze::lint::suspicious::no_then_property::process_js_export_named_clause has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 2 (4 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/no_then_property.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"31585f0d69dbb00ec21355d05a1e6555b07cbcc1eec2668a8644de9a533e3de6"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::suspicious::no_vue_arrow_func_in_watch::extract_watcher_handler (cognitive 20): biome_js_analyze::lint::suspicious::no_vue_arrow_func_in_watch::extract_watcher_handler has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/no_vue_arrow_func_in_watch.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c73e87a4b5d8dd38770dc5acc43879dbceda6f594caef9c8dd74c1d500f9ab"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::services::semantic_class::collect_references_from_arrow_function (cognitive 20): biome_js_analyze::services::semantic_class::collect_references_from_arrow_function has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/services/semantic_class.rs"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e439defc81178cf67f6d8ed68aab80666ff4d6657c23b49b265e8295c135cce"}},{"ruleId":"D2","level":"warning","message":{"text":"JsLexer::read_number (cognitive 20): JsLexer::read_number has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 2 (5 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/biome_js_parser/src/lexer/mod.rs"},"region":{"startLine":1398}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c57817e2179ae49bb675d005ddba5bec0dd4479a2aef64d837c5cf0ea5786db"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_parser::syntax::expr::parse_call_expression_rest (cognitive 20): biome_js_parser::syntax::expr::parse_call_expression_rest has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_parser/src/syntax/expr.rs"},"region":{"startLine":1752}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ac5b052f1b0a6d00f46a91a96af82bb91bbf72722fc4f420bc758dc0e478382"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_parser::syntax::stmt::parse_statement (cognitive 20): biome_js_parser::syntax::stmt::parse_statement has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 7, match/switch 3 (5 pts) (nesting depth added 5). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_parser/src/syntax/stmt.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f487dae90abfefe60ea47bca360b7df81434766e731c8fa2c4a1b3f0099c68"}},{"ruleId":"D2","level":"warning","message":{"text":"JsSemanticModel::init (cognitive 20): JsSemanticModel::init has cognitive complexity 20 (threshold 15). Drivers by points: if/else 20. 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/biome_js_runtime/src/semantic.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad893c438b7131126e0950d5e15899581700f93e4b38189b55d5b21f03a8cc3e"}},{"ruleId":"D2","level":"warning","message":{"text":"JsAssignmentExpression::needs_parentheses (cognitive 20): JsAssignmentExpression::needs_parentheses has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 4 (10 pts), if/else 2 (5 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_syntax/src/parentheses/expression.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30db2930157d9c6458071ba9740094587aa656d17bd95d8994583309c15be88"}},{"ruleId":"D2","level":"warning","message":{"text":"AssignabilityCheck::is_assignable_with_bare_infer (cognitive 20): AssignabilityCheck::is_assignable_with_bare_infer has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (9 pts), match/switch 4 (9 pts), loops 2 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/type_relation.rs"},"region":{"startLine":1145}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f846873309ea2755da4d7199bdf8f05e303273d67f7e2d87e8d7657c11d7c8"}},{"ruleId":"D2","level":"warning","message":{"text":"AssignabilityCheck::are_parameters_assignable (cognitive 20): AssignabilityCheck::are_parameters_assignable has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 6 (8 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/type_relation.rs"},"region":{"startLine":1578}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae116ec89d4a96012a75380a0f3e823ae42e9c757964b6eb803aa81c75de3a0"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_type_info::narrowing::narrow_type (cognitive 20): biome_js_type_info::narrowing::narrow_type has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/narrowing.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"8efeb86598aa8970c6fca1bd92749083e3c78cfbf60706ca882f781082595162"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_type_info::type_operations::keyof (cognitive 20): biome_js_type_info::type_operations::keyof has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (5 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/type_operations.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"c12b5a595207bd57ab29513fe9b20c2cc0a2aaf9d782be3bd8861694058f7012"}},{"ruleId":"D2","level":"warning","message":{"text":"Session::register_capabilities (cognitive 20): Session::register_capabilities has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/session.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb2f81f24dc327b6fe8d360deb20c872dcbd3837c5bd1b469233493fa386bad6"}},{"ruleId":"D2","level":"warning","message":{"text":"Session::update_diagnostics_for_document (cognitive 20): Session::update_diagnostics_for_document has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (16 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/session.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54dfa26d35a7dbd402eb9b21bf24b0d212a5421b50b776f468e5bcd0f5ae67"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatLiteralLines::fmt (cognitive 20): FormatLiteralLines::fmt has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (5 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_formatter/src/shared.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ee69088b0b8ee600b223ede6a364913cb43e7837bdcbc3673d756d5941b85c"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_parser::syntax::is_quote_only_blank_line_from_source (cognitive 20): biome_markdown_parser::syntax::is_quote_only_blank_line_from_source has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 2 (4 pts), loops 3, 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/biome_markdown_parser/src/syntax/mod.rs"},"region":{"startLine":1648}}}],"partialFingerprints":{"codehealthFindingId/v1":"436cc39811ab4003b7bd6373ac9666b074db19341e5fb8e5794d68d68ca3fdc6"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_parser::to_html::strip_paragraph_indent (cognitive 20): biome_markdown_parser::to_html::strip_paragraph_indent has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/to_html.rs"},"region":{"startLine":1411}}}],"partialFingerprints":{"codehealthFindingId/v1":"619f08ba0276815a6200fb78d696b458cf0b702dbf9f834f38fc6432f0c1d9e6"}},{"ruleId":"D2","level":"warning","message":{"text":"ResolutionCtx::resolve_typeof_expression (cognitive 20): ResolutionCtx::resolve_typeof_expression has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 3 (5 pts), boolean chains 3 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed624c0e7107ad274cf2fd9e3a5af6497f77228b795daf18628bb9299a63705"}},{"ruleId":"D2","level":"warning","message":{"text":"UpwardTraversal::next_item (cognitive 20): UpwardTraversal::next_item has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (13 pts), if/else 1 (5 pts), match/switch 1 (2 pts) (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/traverse.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"746b72e02559d707d11ce7cda819823dfbcbbf82913057320732c0d156242f9c"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_module_graph::db::queries::type_inference::calls::implementation::required_structural_member_names (cognitive 20): biome_module_graph::db::queries::type_inference::calls::implementation::required_structural_member_names has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/queries/type_inference/calls/implementation.rs"},"region":{"startLine":1522}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59f2c28c1ff7512aa31eef25337faaaea53a2024c072766a8db13686e86a2af"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_package::node_semver::range::parse_hyphen_range (cognitive 20): biome_package::node_semver::range::parse_hyphen_range has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 9 (19 pts), if/else 1 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_package/src/node_semver/range.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf1ff331545d5ba299efa07cf40fce051956a5737eee01fb0f3e6cdb0c2ae11a"}},{"ruleId":"D2","level":"warning","message":{"text":"PreorderMatching::next (cognitive 20): PreorderMatching::next has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_rowan/src/cursor/node.rs"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"e70b7cc552e5e9a825bd4f4e335b9518ee5279dad759d2747c64098107d056a8"}},{"ruleId":"D2","level":"warning","message":{"text":"RawLanguageSyntaxFactory::make_syntax (cognitive 20): RawLanguageSyntaxFactory::make_syntax has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 3, match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_rowan/src/raw_language.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c4855a8213a7e635d553a1843314b5526343da4265d81b3f3c1cdc870eda0a5"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_rule_options::no_restricted_imports::get_context_for_import_call (cognitive 20): biome_rule_options::no_restricted_imports::get_context_for_import_call has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 2 (7 pts), loops 2 (3 pts) (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/biome_rule_options/src/no_restricted_imports.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4a355cf1878a4347805918abb27bfe1c9eb11db759867c2b11c05593eb88dcb"}},{"ruleId":"D2","level":"warning","message":{"text":"Watcher::handle_notify_event (cognitive 20): Watcher::handle_notify_event has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 5 (10 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/biome_service/src/scanner/watcher.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"51f446e312028ba35b5a521b1e3d2e1628830290442dc3333790be0b8e2b2b97"}},{"ruleId":"D2","level":"warning","message":{"text":"Collector::collect_runtime_props (cognitive 20): Collector::collect_runtime_props has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (4 pts), match/switch 2 (4 pts) (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_vue_semantic/src/semantic_model/component.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e39a348eaaf1e9e030ae97dfbb4acfb4490d85b4c04bdbe9615817d28a13332"}},{"ruleId":"D2","level":"warning","message":{"text":"Collector::runtime_prop_detail (cognitive 20): Collector::runtime_prop_detail has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 5 (13 pts), if/else 3 (6 pts), loops 1 (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_vue_semantic/src/semantic_model/component.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"1014a0e0d2bb15fbeea005a6337e4cbb493825120de923c4c3d2f9f1173bb37c"}},{"ruleId":"D2","level":"warning","message":{"text":"Collector::collect_computed_option (cognitive 20): Collector::collect_computed_option has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 3 (10 pts), if/else 3 (5 pts), loops 2 (5 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/biome_vue_semantic/src/semantic_model/component.rs"},"region":{"startLine":1457}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a6579e2d7cf15ad7b9c894ca9446b54311530a1db7bc14d092469ced7b59387"}},{"ruleId":"D2","level":"warning","message":{"text":"FlowSequenceEntryList::parse_element (cognitive 20): FlowSequenceEntryList::parse_element has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_yaml_parser/src/parser/flow.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"577ad5300f8464828c82e37f91cfbfd7c8fd92e8584a8c34af9f8ffce37d10e2"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask_codegen::generate_schema::rename_references_in_schema (cognitive 20): xtask_codegen::generate_schema::rename_references_in_schema has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (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":"xtask/codegen/src/generate_schema.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8969d3588cecb2f53a8c5d6baca6eaf409d244640396208a334f91450310571"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask_coverage::runner::run_test_suite (cognitive 20): xtask_coverage::runner::run_test_suite has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (5 pts), loops 3, boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/coverage/src/runner.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"df5541f8c33162ebec39f72bbfcb973d095d0a9667ea923e3c0cfb487bc25f4b"}},{"ruleId":"D2","level":"warning","message":{"text":"watch.createWatcher (cognitive 20): watch.createWatcher has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (11 pts), error handling 5 (6 pts), loops 2, boolean chains 1 (nesting depth added 2). None of this is in the body itself: all 20 points belong to 8 function items inside it that branch (a function literal at line 120, visitDirectory, handleWatcherEvent, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/prettier-compare/src/watch.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca80a92db5afdf86de82ed53af7b4c990466b3f8919cccb9c04d38cf46fb6b4"}},{"ruleId":"D2","level":"warning","message":{"text":"App.App (cognitive 20): App.App has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 8, ternaries 2 (5 pts), if/else 4, error handling 2 (3 pts) (nesting depth added 4). Of this number, 10 points are the body\u0027s own statements and 10 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":"packages/prettier-compare/src/components/App.tsx"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c220cd5adfd52149d5dae5deb3a24adf251e33772b78341c0c3eef86b97918f"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_analyze::to_analyzer_suppressions (cognitive 19): biome_analyze::to_analyzer_suppressions has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_analyze/src/lib.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb50be2141ca7db53e36510dbefadf3daf0aa9019fa4e6743d478751f715ca91"}},{"ruleId":"D2","level":"warning","message":{"text":"InspectedConfigurationFiles::indexed_source (cognitive 19): InspectedConfigurationFiles::indexed_source has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 2, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/commands/inspect/config/configuration.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f56ac6bc7563b30476d107f4e6a35aae89baa9e4bc3b70818f1a9a144bed70"}},{"ruleId":"D2","level":"warning","message":{"text":"LintAssistProcessFile::process_std_in (cognitive 19): LintAssistProcessFile::process_std_in has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 5 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/runner/impls/process_file/lint_and_assist.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b892982de75f4be84fd0bf8292f9466d8669e899ff13dfb3f3e26a56469a70f"}},{"ruleId":"D2","level":"warning","message":{"text":"OverridePattern::try_from (cognitive 19): OverridePattern::try_from has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/execute/migrate/prettier.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebfd892c70375419fcd7b4e5f3e86dd53fde226cd182728e3d2425f5ddbf0b82"}},{"ruleId":"D2","level":"warning","message":{"text":"NoDuplicateAtImportRules::run (cognitive 19): NoDuplicateAtImportRules::run has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_analyze/src/lint/suspicious/no_duplicate_at_import_rules.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"58bee1270524f5cb981faa74e2ee0b248f864a308286256887bb682b55910da6"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_embeds::data::vue_directive_name_matches_option_name (cognitive 19): biome_embeds::data::vue_directive_name_matches_option_name has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_embeds/src/data.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e4fca3f2d1b8455202558b6749f1727df0a51836af1953ada0bd7f0ad18547b"}},{"ruleId":"D2","level":"warning","message":{"text":"DiffReport::print (cognitive 19): DiffReport::print has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 4 (8 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/biome_formatter_test/src/diff_report.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"58dbb0e97724d54ee2384a02e0335744df0db2e111a3510ae80ba12f03b44613"}},{"ruleId":"D2","level":"warning","message":{"text":"UseSortedTypeFields::run (cognitive 19): UseSortedTypeFields::run has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (18 pts), match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_graphql_analyze/src/assist/source/use_sorted_type_fields.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b2d1d6f8e26ea8449f396b694a36d2937a268a0fab754538bf54fe886f7ba1b"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatGraphqlVerbatimNode::fmt (cognitive 19): FormatGraphqlVerbatimNode::fmt has cognitive complexity 19 (threshold 15). Drivers by points: loops 5 (9 pts), if/else 8, match/switch 1 (2 pts) (nesting depth added 5). 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/biome_graphql_formatter/src/verbatim.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"aafc7eda2aac528238c9474d3af26e9ae6d57cfb6aa2add55c06e4f69f725336"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatGraphqlVerbatimNode::fmt (cognitive 19): FormatGraphqlVerbatimNode::fmt has cognitive complexity 19 (threshold 15). Drivers by points: loops 5 (9 pts), if/else 8, match/switch 1 (2 pts) (nesting depth added 5). 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/biome_grit_formatter/src/verbatim.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"0930047804b8a9a7dee57041e441e49d6319bd8eb6befea1b0b52cb7e8da292b"}},{"ruleId":"D2","level":"warning","message":{"text":"GritLexer::consume_comment_or_slash (cognitive 19): GritLexer::consume_comment_or_slash has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 3 (7 pts), loops 2 (4 pts) (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/biome_grit_parser/src/lexer/mod.rs"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"9be0e1af353c5471a6adca4c213322dde14678db3e10a8e0e00add14de07fe77"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_grit_patterns::grit_built_in_functions::distinct_fn (cognitive 19): biome_grit_patterns::grit_built_in_functions::distinct_fn has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (5 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/biome_grit_patterns/src/grit_built_in_functions.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"d61895c10b393b0bd71ba04fdbdc41fd448ce22a1b688a47b1c87f3398906294"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_grit_patterns::pattern_compiler::snippet_compiler::node_from_tree (cognitive 19): biome_grit_patterns::pattern_compiler::snippet_compiler::node_from_tree has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_patterns/src/pattern_compiler/snippet_compiler.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"188b003923b399c85dff45f3f9f99a6b68d6d0be839fc19aa1684a970b9dd581"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_html_analyze::lint::a11y::use_heading_content::has_accessible_content (cognitive 19): biome_html_analyze::lint::a11y::use_heading_content::has_accessible_content has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 5, match/switch 2 (3 pts) (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/a11y/use_heading_content.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a3aa8bb9fbceea02c9e11b2e40e618becab3d65a4367a0c9c012137878ae18"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatHtmlVerbatimNode::fmt (cognitive 19): FormatHtmlVerbatimNode::fmt has cognitive complexity 19 (threshold 15). Drivers by points: loops 5 (9 pts), if/else 8, match/switch 1 (2 pts) (nesting depth added 5). 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/biome_html_formatter/src/verbatim.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"b131929cdf8e4dd5774902fb8426f6de514bcaa2c03889386b942413984f86fd"}},{"ruleId":"D2","level":"warning","message":{"text":"HtmlAttributeList::find_multiple_attributes_by_name (cognitive 19): HtmlAttributeList::find_multiple_attributes_by_name has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_syntax/src/attribute_ext.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e77c310989484e380c1d8227ac24a03c7161d8f23cf2ee66d5ba6541e46402d"}},{"ruleId":"D2","level":"warning","message":{"text":"NoAdjacentSpacesInRegex::run (cognitive 19): NoAdjacentSpacesInRegex::run has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/complexity/no_adjacent_spaces_in_regex.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f4f4f83f8740d692483752ed3fe1cde94e5217db1ff39b113fb4b19564f6184"}},{"ruleId":"D2","level":"warning","message":{"text":"LogicalAndChain::cmp_chain (cognitive 19): LogicalAndChain::cmp_chain has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 5 (11 pts), if/else 4 (7 pts), loops 1 (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/complexity/use_optional_chain.rs"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e1dbcac23af4470538c7b9b3534b869e98cda4261e36bcfcbf35c5db45c9119"}},{"ruleId":"D2","level":"warning","message":{"text":"NoUnusedPrivateClassMembers::action (cognitive 19): NoUnusedPrivateClassMembers::action has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 1 (3 pts), boolean chains 2, match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/no_unused_private_class_members.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"4853011c4e36554f231ed9e64cc6975a8bd28eb7a2f3d6af814e5265f3409623"}},{"ruleId":"D2","level":"warning","message":{"text":"NoVoidElementsWithChildren::run (cognitive 19): NoVoidElementsWithChildren::run has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (15 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/biome_js_analyze/src/lint/correctness/no_void_elements_with_children.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f143e8b8751da455b85200f3d25f9006bb5b235ce2e35e3f41c66ec555c3c4"}},{"ruleId":"D2","level":"warning","message":{"text":"NonTransparentLeaves::next (cognitive 19): NonTransparentLeaves::next has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (18 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/biome_js_analyze/src/lint/nursery/no_misleading_return_type/analysis.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4bc6bec9be50bf0e64d038ebbaf7f9832e1282fc3bc0d0ba2be03766200f727"}},{"ruleId":"D2","level":"warning","message":{"text":"UseAccessorPairs::run (cognitive 19): UseAccessorPairs::run has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (4 pts), match/switch 2 (4 pts) (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_accessor_pairs.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f14f866002f3d5063e7b0fc06dee49aeb8af8608f815da070537f5247f30acc"}},{"ruleId":"D2","level":"warning","message":{"text":"UseConsistentFunctionStyle::run (cognitive 19): UseConsistentFunctionStyle::run has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (7 pts), match/switch 3 (6 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_consistent_function_style.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"316b5cf868785205494a5195fef7ecc01519b7323f9492b8b67ab31fe0811a6b"}},{"ruleId":"D2","level":"warning","message":{"text":"UseExplicitReturnType::run (cognitive 19): UseExplicitReturnType::run has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 1, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_explicit_return_type.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"af07c608e5db46ee4704e46d103def1ee11d6385f05a8397529faad21e4ce4aa"}},{"ruleId":"D2","level":"warning","message":{"text":"NoBarrelFile::run (cognitive 19): NoBarrelFile::run has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (16 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/biome_js_analyze/src/lint/performance/no_barrel_file.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ccc27db2d4b51ec25a98aabd857dfed168cb944ce80064c2bbeab30426e8d8f"}},{"ruleId":"D2","level":"warning","message":{"text":"UseImportType::diagnostic (cognitive 19): UseImportType::diagnostic has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 3 (8 pts), match/switch 2 (3 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/biome_js_analyze/src/lint/style/use_import_type.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ba3703980aa1c9e5b018c384c8b5fad141e51c0d887b9f12febb28388fc111"}},{"ruleId":"D2","level":"warning","message":{"text":"ReactComponentInfo::from_function (cognitive 19): ReactComponentInfo::from_function has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/react/components.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"4328392041c89cc5ba05d69062876afa52748473289ee53428f6a60d1abeb439"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::no_misleading_return_type::analysis::collect_block_returns (cognitive 19): biome_js_analyze::lint::nursery::no_misleading_return_type::analysis::collect_block_returns has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_misleading_return_type/analysis.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba907b73db03080d1cfd291af8aeff34a3efae9b02a6c3eb777ca71eb8ce1a4"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::use_explicit_return_type::ancestor_has_return_type (cognitive 19): biome_js_analyze::lint::nursery::use_explicit_return_type::ancestor_has_return_type has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 4, loops 1, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_explicit_return_type.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"e217e315b2bf877a065df30e19400a8e8b35b45bbd396823c00149920e1857d6"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::use_vue_valid_default_prop::check_default (cognitive 19): biome_js_analyze::lint::nursery::use_vue_valid_default_prop::check_default has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, match/switch 3 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_vue_valid_default_prop.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"8622884bb24f400899b745504f0b884beeaf509823c062f178c9d0aaee85824f"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatTsTypeArguments::fmt_fields (cognitive 19): FormatTsTypeArguments::fmt_fields has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 4, match/switch 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/ts/expressions/type_arguments.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"b399883ef7f9af7a7f915d12f3256fe2dc8efdb0523a48b9b5083cafbe650721"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatBinaryLikeOperatorAndRight::fmt (cognitive 19): FormatBinaryLikeOperatorAndRight::fmt has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/utils/format_binary_like_expression.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e84a9bb1295d808fdf61c539b767f9345b3c19f85f9248d7412cf821fcf4ab"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatJsVerbatimNode::fmt (cognitive 19): FormatJsVerbatimNode::fmt has cognitive complexity 19 (threshold 15). Drivers by points: loops 5 (9 pts), if/else 8, match/switch 1 (2 pts) (nesting depth added 5). 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/biome_js_formatter/src/verbatim.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"e20d7aed3aaa2aea28ea767525ab5d60f472aaca580b6b98dbdcb4f289889f02"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_formatter::utils::assignment_like::is_poorly_breakable_member_or_call_chain (cognitive 19): biome_js_formatter::utils::assignment_like::is_poorly_breakable_member_or_call_chain has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 4 (7 pts), loops 2, boolean chains 1 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/utils/assignment_like.rs"},"region":{"startLine":1178}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4d755c988d319de2681261ac98cd0584df06eec616538ac1ffc1733431f17a"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_parser::syntax::function::parse_function (cognitive 19): biome_js_parser::syntax::function::parse_function has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 4 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_parser/src/syntax/function.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"e140f271a7fa859797d5555ee770ae4f3b125811e71a3c1a81625519f5d42f42"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_parser::syntax::object::parse_object_member (cognitive 19): biome_js_parser::syntax::object::parse_object_member has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 5, match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_parser/src/syntax/object.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41c44e1cf8e2874ad75a5161d583ed2509f262976c5e76fba12dfb896b47452"}},{"ruleId":"D2","level":"warning","message":{"text":"AnyJsExpression::contains_a_test_pattern (cognitive 19): AnyJsExpression::contains_a_test_pattern has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 7 (17 pts), if/else 2 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_syntax/src/expr_ext.rs"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d6ae2d3b3a09c8888b09f2717f9db86e42d151ab83a5d3b1ed2792b36080e49"}},{"ruleId":"D2","level":"warning","message":{"text":"InferredType::has_index_signature (cognitive 19): InferredType::has_index_signature has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 2 (5 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/biome_js_type_info/src/inferred_type.rs"},"region":{"startLine":1237}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a4c489ab71bee930953adacb25180319d4ecf7f80618c34693e479d87ad7bb"}},{"ruleId":"D2","level":"warning","message":{"text":"StringificationAnalyzer::analyze (cognitive 19): StringificationAnalyzer::analyze has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 3 (9 pts), if/else 4 (8 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/stringification.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ec9ef7d8679da5fd6d42d6be5dd2b957eb86cc9750e95e90173d1effa1f94b"}},{"ruleId":"D2","level":"warning","message":{"text":"AssignabilityCheck::is_tuple_assignable (cognitive 19): AssignabilityCheck::is_tuple_assignable has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 5, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/type_relation.rs"},"region":{"startLine":1428}}}],"partialFingerprints":{"codehealthFindingId/v1":"3db29a1a889252be1a43c3e3cf20961df542e3100294b4dfba18cd71f3ed2442"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatJsonVerbatimNode::fmt (cognitive 19): FormatJsonVerbatimNode::fmt has cognitive complexity 19 (threshold 15). Drivers by points: loops 5 (9 pts), if/else 8, match/switch 1 (2 pts) (nesting depth added 5). 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/biome_json_formatter/src/verbatim.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b16955e9949162038062f2939c30624faece966d203e007dc72cd05ae391d5"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatMdListMarkerPrefix::fmt_fields (cognitive 19): FormatMdListMarkerPrefix::fmt_fields has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (11 pts), loops 3 (6 pts), boolean chains 1, match/switch 1 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_formatter/src/markdown/auxiliary/list_marker_prefix.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"1856d65084cbd6d388b9bc69f45ab96a158bc97931955f9e4653602e0f87355d"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatMdInlineItemList::fmt_prose_preserve (cognitive 19): FormatMdInlineItemList::fmt_prose_preserve has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_formatter/src/markdown/lists/inline_item_list.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6aa6c34167134b575f75558c706628d804ddf8410ae41537ab26c198daf9dff"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_parser::syntax::inline::code_span::is_at_list_marker_after_newline (cognitive 19): biome_markdown_parser::syntax::inline::code_span::is_at_list_marker_after_newline has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 4, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/inline/code_span.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ddbe7db9cbd1491c74bb21d33a7a73ffaed5dba56f928da8cbe29e0c4ad0254"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_parser::syntax::inline::html::is_email_autolink (cognitive 19): biome_markdown_parser::syntax::inline::html::is_email_autolink has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 5, loops 3 (4 pts), match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/inline/html.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"68d0746b6d41a6af1df0a82fa2f5be2f9285086f60a1da6d6656b9cd9d589036"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_parser::syntax::inline::links::lookahead_reference_common (cognitive 19): biome_markdown_parser::syntax::inline::links::lookahead_reference_common has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/inline/links.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee15800647755f892001c04b301f56a580cce44fa6d68df08ccb5028fb3b01a3"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_parser::syntax::list::compute_marker_indent (cognitive 19): biome_markdown_parser::syntax::list::compute_marker_indent has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 1 (3 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"947b3c0929aaa3ad6d3586e81909cedd56865a281166ab7adb87adbef01b459a"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_parser::syntax::list::parse_indent_code_block_in_list_first_line (cognitive 19): biome_markdown_parser::syntax::list::parse_indent_code_block_in_list_first_line has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (16 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/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":3102}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa97a7e5c38e5cc18592c53a505e55b2cec6eead67d8ff33dfb8494e7c45897"}},{"ruleId":"D2","level":"warning","message":{"text":"ResolutionCtx::rest_object_from_type (cognitive 19): ResolutionCtx::rest_object_from_type has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 2 (5 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/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":2523}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b05b0b83ec346b607cf12d4e56b34a36946b39a5241551f84ce4d7cfa0535f1"}},{"ruleId":"D2","level":"warning","message":{"text":"GuardFunctions::guard (cognitive 19): GuardFunctions::guard has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 5 (8 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/js_module_info/flow/guards.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"c49c71fdd939a865c0160e2257e7e5bcb9b065ea2c7abe7c8a0abb25d6309ed2"}},{"ruleId":"D2","level":"warning","message":{"text":"FlowRootScanner::enter (cognitive 19): FlowRootScanner::enter has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/js_module_info/flow/scanner.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab1f672e1dee9808efe20946dce9b46d962ab1981c19a8ed46adc7c9c927f41"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_module_graph::db::queries::css::is_class_used_in_component_tree (cognitive 19): biome_module_graph::db::queries::css::is_class_used_in_component_tree has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/queries/css.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef7aceb046a579fb7c9e907930dca44419b9712247f7919c48a4b8e32d3350e6"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_module_graph::db::queries::type_inference::calls::implementation::lists_every_member (cognitive 19): biome_module_graph::db::queries::type_inference::calls::implementation::lists_every_member has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/queries/type_inference/calls/implementation.rs"},"region":{"startLine":1582}}}],"partialFingerprints":{"codehealthFindingId/v1":"dec13ab9700ebdb7294d4cfcdef113e605aaa35539d92eaf76063e842567ef6a"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_module_graph::js_module_info::flow::guards::condition_step (cognitive 19): biome_module_graph::js_module_info::flow::guards::condition_step has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 3 (5 pts), loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/js_module_info/flow/guards.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"74edb151893207f3d85b2abeab27cdcbbadfe169005cc303e56a96097b80d163"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_resolver::resolve_dependency (cognitive 19): biome_resolver::resolve_dependency has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 2 (5 pts), loops 3 (4 pts) (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_resolver/src/lib.rs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a808059cdd58f8345713f3bfa19044167924f4bb9bcc25257837db68a38f76"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeBlock::from_str (cognitive 19): CodeBlock::from_str has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (16 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_ruledoc_utils/src/codeblock.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"7521a37d4e83cd176b74b56b6825f66d1b83e31d9664a6b5fa6f12befc551026"}},{"ruleId":"D2","level":"warning","message":{"text":"VcsIgnoredPatterns::is_ignored (cognitive 19): VcsIgnoredPatterns::is_ignored has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 1 (3 pts), match/switch 2 (3 pts) (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/settings.rs"},"region":{"startLine":1477}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0d7e5bd66e2532458ab9973ec210757d2d9f5b420e60db20c67c2c31c24834d"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceServerWithDb::process_file (cognitive 19): WorkspaceServerWithDb::process_file has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 9, if/else 7 (9 pts), match/switch 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/workspace/server.rs"},"region":{"startLine":3591}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd7767421b8cb5dd9f5d2822bfb7e661b0a05787642282708135b868f12f37c9"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_service::file_handlers::javascript::go_to::resolve_import_definition (cognitive 19): biome_service::file_handlers::javascript::go_to::resolve_import_definition has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 5 (9 pts) (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/javascript/go_to.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7cea7f26a88888bee97b15cd43d8ee6412882f213474cdfda4168547e54dca8"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_ungrammar::lexer::advance (cognitive 19): biome_ungrammar::lexer::advance has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 6 (15 pts), loops 2 (4 pts) (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_ungrammar/src/lexer.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a80b91165b4f1720f09cad0656e327bc807bc9c2e424db496fa5d55d9c6550"}},{"ruleId":"D2","level":"warning","message":{"text":"Collector::collect_type_emits (cognitive 19): Collector::collect_type_emits has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 3 (7 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/biome_vue_semantic/src/semantic_model/component.rs"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"533409d7d838e945aa1d7a49c1858d468bc8c1127d37d1ee83a117c12524523e"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask_codegen::generate_configuration::generate_for_groups (cognitive 19): xtask_codegen::generate_configuration::generate_for_groups has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (14 pts), loops 2 (3 pts), match/switch 2 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/generate_configuration.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf1f5415e215c50f291c43c32b1cbe36f72705a0f8f563f445a8a1eda19d1cc"}},{"ruleId":"D2","level":"warning","message":{"text":"RuleSignal::actions (cognitive 18): RuleSignal::actions has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 4, match/switch 1 (3 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_analyze/src/signals.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"103f6c2e54bf9a197fe38c887100e5f28b64b9c30e45be4c9cf3045b02d0ab62"}},{"ruleId":"D2","level":"warning","message":{"text":"RangeSuppressions::push_suppression (cognitive 18): RangeSuppressions::push_suppression has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 3 (7 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_analyze/src/suppressions.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"a84c3a4534b12abb0ee68de9d0c8435df750f767571d9d2ad025f564281e4cf6"}},{"ruleId":"D2","level":"warning","message":{"text":"LintAssistProcessFile::process_file (cognitive 18): LintAssistProcessFile::process_file has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 5 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/runner/impls/process_file/lint_and_assist.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad5535655a7bfca918c0435db7fe54d3ac909740dd203c357158346b0795c24"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_cli::service::unix::purge_old_sockets_in (cognitive 18): biome_cli::service::unix::purge_old_sockets_in has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 3 (5 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/service/unix.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad4e48ffba2fea512fe8c34fd69113db4cef0573d587381bea1b77e66693c518"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_css_analyze::lint::nursery::use_logical_properties::collect_value_violations (cognitive 18): biome_css_analyze::lint::nursery::use_logical_properties::collect_value_violations has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_analyze/src/lint/nursery/use_logical_properties.rs"},"region":{"startLine":1540}}}],"partialFingerprints":{"codehealthFindingId/v1":"f35259983cb28d030d5b800c780b7cd08937add732cba9995e945fe77b95a4c2"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_css_parser::syntax::at_rule::supports::parse_scss_interpolated_supports_in_parens (cognitive 18): biome_css_parser::syntax::at_rule::supports::parse_scss_interpolated_supports_in_parens has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_parser/src/syntax/at_rule/supports/mod.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe1aacd4a71df5bf8a4ec00b0e74fe41b3029798191acba206401384cd8f1ba"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_deserialize_macros::deserializable_derive::generate_deserializable_struct (cognitive 18): biome_deserialize_macros::deserializable_derive::generate_deserializable_struct has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (14 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_deserialize_macros/src/deserializable_derive.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b6ef6df7c358b885f1ed00c73d5ec0bb21d7ba75e00e16f3236d0a84876ff8"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_diagnostics::display::diff::process_diff_ops (cognitive 18): biome_diagnostics::display::diff::process_diff_ops has cognitive complexity 18 (threshold 15). Drivers by points: if/else 2 (6 pts), loops 3 (6 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_diagnostics/src/display/diff.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"b077228f4e306c2398dd4c7df44e58ee4d9f813b78489b53f1f1032692df8d33"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_diagnostics::display::diff::print_short_diff (cognitive 18): biome_diagnostics::display::diff::print_short_diff has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (8 pts), loops 4 (6 pts), match/switch 3 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_diagnostics/src/display/diff.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"2681d5e2f4750eb61b99a737cfbe1287c0b63f61e4721d451ca68d1fa1835da1"}},{"ruleId":"D2","level":"warning","message":{"text":"EmbeddedBindingsBuilder::visit_js_source_snippet (cognitive 18): EmbeddedBindingsBuilder::visit_js_source_snippet has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (7 pts), match/switch 2 (6 pts), boolean chains 4, 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/biome_embeds/src/visitor.rs"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a78ac36aabbb47a8a9176cb19b3ed2551f735554c557836c2b62a400d893bfc"}},{"ruleId":"D2","level":"warning","message":{"text":"CommentsBuilderVisitor::flush_comments (cognitive 18): CommentsBuilderVisitor::flush_comments has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 1 (3 pts), boolean chains 2, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_formatter/src/comments/builder.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"581c59f57a5debe045f801b235267166f65fe62f2375ed07f3e197e28f55efaf"}},{"ruleId":"D2","level":"warning","message":{"text":"TransformSourceMap::map_markers (cognitive 18): TransformSourceMap::map_markers has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (4 pts), match/switch 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_formatter/src/source_map.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea9aacca46989668570ac13e10419cc408e39649c9f487eff72c5a9743747084"}},{"ruleId":"D2","level":"warning","message":{"text":"GritLexer::consume_backtick_snippet (cognitive 18): GritLexer::consume_backtick_snippet has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 2 (8 pts), loops 1 (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_parser/src/lexer/mod.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"249eb37a1f27965058698956e8e2bf40365b944718ec7778d76e83edb73e37a0"}},{"ruleId":"D2","level":"warning","message":{"text":"GritQuery::execute_optimized (cognitive 18): GritQuery::execute_optimized has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_patterns/src/grit_query.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b2e38709aa192a7b652fae523b1548ebfa2abb32ab3a7121592694472a8795"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatHtmlAttributeInitializerClause::fmt_fields (cognitive 18): FormatHtmlAttributeInitializerClause::fmt_fields has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 3 (6 pts), boolean chains 2 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_formatter/src/html/auxiliary/attribute_initializer_clause.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf0f129187daad31530f97123a8d97ff9ee492c66daa05b46349ba5b62146f4d"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_html_formatter::html::auxiliary::string::requote (cognitive 18): biome_html_formatter::html::auxiliary::string::requote has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 2, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_formatter/src/html/auxiliary/string.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f17fcfeae81787e9b88bb17faba7186f251712543bec1a5e30278f961e017fe"}},{"ruleId":"D2","level":"warning","message":{"text":"HtmlLexer::consume_tag_name (cognitive 18): HtmlLexer::consume_tag_name has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 6, loops 1, 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/biome_html_parser/src/lexer/mod.rs"},"region":{"startLine":1258}}}],"partialFingerprints":{"codehealthFindingId/v1":"41ceb2f5286ca133749f913ae5b8f150283979d05ba6a84cb487076dfc18132a"}},{"ruleId":"D2","level":"warning","message":{"text":"UseValidLang::run (cognitive 18): UseValidLang::run has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 2 (6 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/a11y/use_valid_lang.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"2175c6685951ea685cbfd108b49e483f819e1c21afe71505a5d8818661e6ef71"}},{"ruleId":"D2","level":"warning","message":{"text":"NoExtraBooleanCast::run (cognitive 18): NoExtraBooleanCast::run has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/complexity/no_extra_boolean_cast.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"948472f7f318d03f297f496d716c9872e80b6005ee06c85b26f5cd5ad2c12fec"}},{"ruleId":"D2","level":"warning","message":{"text":"UnusedLabelVisitor::visit (cognitive 18): UnusedLabelVisitor::visit has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 3, match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/no_unused_labels.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"6757f91c360fceedb457f41aba856352460db4c8b75b566b50c18a3aab5d1e96"}},{"ruleId":"D2","level":"warning","message":{"text":"NoSvelteUselessDerivedBy::run (cognitive 18): NoSvelteUselessDerivedBy::run has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 3 (5 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/biome_js_analyze/src/lint/nursery/no_svelte_useless_derived_by.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c5ad377bef5f14a043dd62abe8090d469c2d4afcb520356c04839ee48030f2"}},{"ruleId":"D2","level":"warning","message":{"text":"UseIteratorZip::run (cognitive 18): UseIteratorZip::run has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, loops 2, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_iterator_zip.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecebc911ffefeb993e85a3676b812a12394a6acf110f67b579617611b15d7926"}},{"ruleId":"D2","level":"warning","message":{"text":"NoDelete::run (cognitive 18): NoDelete::run has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (18 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/biome_js_analyze/src/lint/performance/no_delete.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"48aa6910712227b64cc66a7e413de4614ac24cc07bfde0f77b6d8d22456ce390"}},{"ruleId":"D2","level":"warning","message":{"text":"ReactComponentInfo::from_declaration (cognitive 18): ReactComponentInfo::from_declaration has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/react/components.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"2057a093a7780a7dce4649274a7a8ffdbedbc91f92d253cbf5c6dcb3933c1e18"}},{"ruleId":"D2","level":"warning","message":{"text":"ThisScopeVisitor::visit (cognitive 18): ThisScopeVisitor::visit has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 2, match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/services/semantic_class.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"5188df6a0c5c8cea5e6e3d8aedccd9bbcc48027f8b29a4266739018449905dea"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::frameworks::vue::vue_setup::filter_map_vue_setup_calls_after_await (cognitive 18): biome_js_analyze::frameworks::vue::vue_setup::filter_map_vue_setup_calls_after_await has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 2 (3 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/frameworks/vue/vue_setup.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7bd705ee6bedfef94486b2dc4b1242c0446ee95d3080ca99ff8062dc39da428"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::a11y::no_label_without_control::has_nested_control (cognitive 18): biome_js_analyze::lint::a11y::no_label_without_control::has_nested_control has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (12 pts), match/switch 2 (5 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/biome_js_analyze/src/lint/a11y/no_label_without_control.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c2f772d1805d76b2ffe2304fffc5a67796390b2f2fe30c7f2664bf18c107ad"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::correctness::no_unused_variables::suggested_fix_if_unused (cognitive 18): biome_js_analyze::lint::correctness::no_unused_variables::suggested_fix_if_unused has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/no_unused_variables.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"8027f1cbdeb757c3b20b1f8aeeca98e4cab60ee47bcef9bbb9b54b732a4d2c7a"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::correctness::use_qwik_loader_location::is_exported (cognitive 18): biome_js_analyze::lint::correctness::use_qwik_loader_location::is_exported has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (4 pts), loops 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/biome_js_analyze/src/lint/correctness/use_qwik_loader_location.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc300e6d4774de85066e53a6b58d4d489b66e640fa3681e3b472d474cfaa32dc"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::no_array_sort_for_min_max::sort_direction (cognitive 18): biome_js_analyze::lint::nursery::no_array_sort_for_min_max::sort_direction has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, match/switch 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_array_sort_for_min_max.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f87ef083fb05aafa279007ccc97cdd5eb831779939f6aedd8e003079619073"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::no_misleading_return_type::analysis::misleading_suggestion (cognitive 18): biome_js_analyze::lint::nursery::no_misleading_return_type::analysis::misleading_suggestion has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9, boolean chains 7, match/switch 1 (2 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_misleading_return_type/analysis.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d77b13aabf7138dae99a3d6f9d390df7c351e5aac17c74e77dae5a87b7930ce"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::use_tailwind_sorted_classes::sort::sort_classes (cognitive 18): biome_js_analyze::lint::nursery::use_tailwind_sorted_classes::sort::sort_classes has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_tailwind_sorted_classes/sort.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ddeee9f2374343c1de18648dc988152a3407005c1cf49bfd9be748503a7733"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::use_vue_separate_static_class::collect_static_object_keys (cognitive 18): biome_js_analyze::lint::nursery::use_vue_separate_static_class::collect_static_object_keys has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 2 (6 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_vue_separate_static_class.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"70996e5a739c701ef567d880420addf505e4800ef94fa7ea76abdcdaf29fd5da"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::use_vue_valid_define_emits::find_define_emits_calls (cognitive 18): biome_js_analyze::lint::nursery::use_vue_valid_define_emits::find_define_emits_calls has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (4 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/biome_js_analyze/src/lint/nursery/use_vue_valid_define_emits.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"e992b4808ae9859649e517323cf8ddda1bc0938cbca990ea83bf8851b3bdb19f"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::style::use_destructuring::should_suggest_destructuring (cognitive 18): biome_js_analyze::lint::style::use_destructuring::should_suggest_destructuring has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 1, match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_destructuring.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9298e6dfe4c6ff727375957891d1416a3b67e9814975c92d70f8ca5852892cd"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::suspicious::no_unnecessary_conditions::check_comparison_necessity (cognitive 18): biome_js_analyze::lint::suspicious::no_unnecessary_conditions::check_comparison_necessity has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 5 (9 pts), if/else 5 (7 pts), boolean chains 2 (nesting depth added 6). 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/biome_js_analyze/src/lint/suspicious/no_unnecessary_conditions.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d0a14d21aa01310dde9ef08033ab06c5b8f50f6069c071b9738314eb5e7a028"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::services::semantic_class::handle_assignment_expression (cognitive 18): biome_js_analyze::services::semantic_class::handle_assignment_expression has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 2 (6 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/services/semantic_class.rs"},"region":{"startLine":1200}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e31e5d3ca304ce944c5ce4453dbd1926e5ffec6cbbcad1a8358bdd5244800bf"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::suppression_action::make_indentation_from_jsx_element (cognitive 18): biome_js_analyze::suppression_action::make_indentation_from_jsx_element has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/suppression_action.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"33abc4214c1f3861d03bfc2aee39c4778d48b6ec6de45eec48c6b064dc262fa5"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatJsCallArguments::fmt_fields (cognitive 18): FormatJsCallArguments::fmt_fields has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 4 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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/biome_js_formatter/src/js/expressions/call_arguments.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"3578e3db135ab2d4c04e0986dd016aac449f6cfb75a1a23ab04b8b897b942cba"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_formatter::comments::handle_parameter_comment (cognitive 18): biome_js_formatter::comments::handle_parameter_comment has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 1, match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/comments.rs"},"region":{"startLine":1255}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f3e206890ca7d86b2a77f62e70671af14e3c0963356a066611dc504f3069d7d"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_formatter::js::expressions::call_arguments::should_group_last_argument (cognitive 18): biome_js_formatter::js::expressions::call_arguments::should_group_last_argument has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/js/expressions/call_arguments.rs"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed15e13a76eaab9723b43aa7399bdf2bba21026d998b32085094638ed1420f42"}},{"ruleId":"D2","level":"warning","message":{"text":"JsExecContext::load_rules (cognitive 18): JsExecContext::load_rules has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_runtime/src/context.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"654d068a072b1bead17744a640c90a8198ee2d9524eaf3c045938fddf9685937"}},{"ruleId":"D2","level":"warning","message":{"text":"JsxAttributeList::find_by_names (cognitive 18): JsxAttributeList::find_by_names has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_syntax/src/jsx_ext.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf81da06566823d53442cca57802f4a75cbb64e0b8853c01df292735aed55dd"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeData::conditional_type_shallow (cognitive 18): TypeData::conditional_type_shallow has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 4 (8 pts), boolean chains 1 (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/interned_types.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbef994f90723b9332ae2d9ca2ab38c40107bc3cefcf299156f3529391900b69"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeData::from_any_ts_type (cognitive 18): TypeData::from_any_ts_type has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 9 (18 pts) (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/local_inference.rs"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b219394e7a2e6df1093eab80645c9d541042efcfd6c4af8b9c9a5b21dc65f43"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeMember::members_from_class_member_list (cognitive 18): TypeMember::members_from_class_member_list has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/local_inference.rs"},"region":{"startLine":2742}}}],"partialFingerprints":{"codehealthFindingId/v1":"08a26d2b65cfe7e190a64437c64eb92fa35650af2339e9fbc39487c28fb58939"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_json_analyze::assist::source::use_sorted_package_json::sorters::prettier_config::transform (cognitive 18): biome_json_analyze::assist::source::use_sorted_package_json::sorters::prettier_config::transform has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4, loops 2 (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/biome_json_analyze/src/assist/source/use_sorted_package_json/sorters/prettier_config.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"159714bcd587af132e53b5da90c4c2cdff80b59913b07bafd1414e38e601397c"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_parser::syntax::classify_quote_break_after_newline (cognitive 18): biome_markdown_parser::syntax::classify_quote_break_after_newline has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 8, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/mod.rs"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5296d603979a0f838ced7e06845848cabfdeb6831ec5c6a75526390e96d2cbc"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_parser::syntax::header::parse_header_content (cognitive 18): biome_markdown_parser::syntax::header::parse_header_content has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/header.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc54cc49036fd9aa09dba632d443cd79fd361ec9e65d023b2c0c25331b614fb4"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_parser::syntax::inline::code_span::matching_code_span_closer (cognitive 18): biome_markdown_parser::syntax::inline::code_span::matching_code_span_closer has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/inline/code_span.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee7d36eab060b4f3496315bf3a91a9288bf73e41e6c8ff8451ac5f5846cc256"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_parser::syntax::inline::html::parse_html_attribute_value (cognitive 18): biome_markdown_parser::syntax::inline::html::parse_html_attribute_value has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (6 pts), boolean chains 2, match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/inline/html.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5514b9a431f6fe1e56ca75196c6a1eb20dbbef1c41bc9946cf53bb7ea62959b"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_parser::syntax::link_block::parse_title_content (cognitive 18): biome_markdown_parser::syntax::link_block::parse_title_content has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 3 (6 pts), boolean chains 4 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/link_block.rs"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc1574ced314518b7dd04d2ca4a78fff735ab5a65fa0aa43a5d6f7929ceb1861"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_parser::syntax::list::parse_bullet_list_item (cognitive 18): biome_markdown_parser::syntax::list::parse_bullet_list_item has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (16 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/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41cdc9c7681a70f9bf0bda7285a6178658fab782c8a7f31092da73ae0cbf70c"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_migrate::analyzers::tailwind_options::take_tailwind_options (cognitive 18): biome_migrate::analyzers::tailwind_options::take_tailwind_options has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (7 pts), match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_migrate/src/analyzers/tailwind_options.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"86c24c27532b1454c4944b1e6e1d382cff6364aa2f8e632f1390a46c2fc2b991"}},{"ruleId":"D2","level":"warning","message":{"text":"ResolutionCtx::conditional_type (cognitive 18): ResolutionCtx::conditional_type has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":2957}}}],"partialFingerprints":{"codehealthFindingId/v1":"e81d6d463b4c63bc167f363edcc11d5a638bc356cb3df9d10bff0bce32095fd0"}},{"ruleId":"D2","level":"warning","message":{"text":"ResolutionCtx::resolve_export_name_result_from_tables (cognitive 18): ResolutionCtx::resolve_export_name_result_from_tables has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 2 (3 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/type_inference/imports.rs"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade457c913052719111efce577a09e149ca6cbb313b499380b9808d56f1d9b16"}},{"ruleId":"D2","level":"warning","message":{"text":"ParseSeparatedList::parse_list (cognitive 18): ParseSeparatedList::parse_list has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 5, 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/biome_parser/src/parse_lists.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dcce93345073ae2a31d3afb930c343a1a73b389c8d459c9617841a7e8ce809a"}},{"ruleId":"D2","level":"warning","message":{"text":"SyntaxNode::edge_token (cognitive 18): SyntaxNode::edge_token has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (9 pts), match/switch 3 (6 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_rowan/src/cursor/node.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"af542cc03c04700fa0d1bb2eba601aa304d01513dbc5982d2e8424a73f6e9251"}},{"ruleId":"D2","level":"warning","message":{"text":"ImportSourceKind::from_source (cognitive 18): ImportSourceKind::from_source has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 5 (12 pts), if/else 2 (4 pts), loops 1 (2 pts) (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_rule_options/src/organize_imports/import_source.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"841e2c7629810e93a817afa3e4c433f5c45468f7aa181404d3be637641faf0b8"}},{"ruleId":"D2","level":"warning","message":{"text":"ProcessFixAll::collect_signal (cognitive 18): ProcessFixAll::collect_signal has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 2 (3 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/mod.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"b210e845a3797dee0f1098a68b500dbf1087695b3c874a3b5a359176a6b1f3d3"}},{"ruleId":"D2","level":"warning","message":{"text":"Settings::apply_configuration (cognitive 18): Settings::apply_configuration has cognitive complexity 18 (threshold 15). Drivers by points: if/else 17, boolean chains 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/settings.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe3f19cf536fcf69c8acc487949bcce68867506e2c9626b5378cf5580242a3c"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceServerWithDb::go_to_definition (cognitive 18): WorkspaceServerWithDb::go_to_definition has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/workspace/server.rs"},"region":{"startLine":4353}}}],"partialFingerprints":{"codehealthFindingId/v1":"e761944ed21f7da5db0f4579b07e8e47ad042d8d7eb9371208f3521af3d53cfd"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_service::file_handlers::graphql::fix_all (cognitive 18): biome_service::file_handlers::graphql::fix_all has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 2 (4 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/graphql.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"dace6033fc4111bab4a65de48133a21ef624b461006ab1dd6b298ac1e37a4264"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_service::file_handlers::html::fix_all (cognitive 18): biome_service::file_handlers::html::fix_all has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 2 (4 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/html.rs"},"region":{"startLine":1366}}}],"partialFingerprints":{"codehealthFindingId/v1":"869e7b7f67f5a180ffa134789f8f423c7e3bacd2a626e5213029daf227c54229"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_service::file_handlers::md::fix_all (cognitive 18): biome_service::file_handlers::md::fix_all has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 2 (4 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/md.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"f387153efaad9d2e3531d209febfd55b1742baa81cc32d2a033eddc58f0668a3"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_service::file_handlers::yaml::fix_all (cognitive 18): biome_service::file_handlers::yaml::fix_all has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 2 (4 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/yaml.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f715bdeeebc0cf86346687ecaef64dc69f56525c82b5ea140a8730d0494aa26"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_tailwind_logic::no_tailwind_restricted_classes::restricted_classes (cognitive 18): biome_tailwind_logic::no_tailwind_restricted_classes::restricted_classes has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_tailwind_logic/src/no_tailwind_restricted_classes.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dfb0bd4d29cf206e1890e810435494036ef6650d6b3eec454d3b1c90c36c90e"}},{"ruleId":"D2","level":"warning","message":{"text":"Collector::collect_component_call (cognitive 18): Collector::collect_component_call has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, match/switch 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_vue_semantic/src/semantic_model/component.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b5eaa12dfaf531f3a0f751f0ffd1f6ef64a5f96b9860bd7889039df57739f19"}},{"ruleId":"D2","level":"warning","message":{"text":"Collector::collect_setup_statements (cognitive 18): Collector::collect_setup_statements has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_vue_semantic/src/semantic_model/component.rs"},"region":{"startLine":1833}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8261d3929a873103358903e2646435d7a3ac94c938e3da34bb0abbbf0ee63fa"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask_codegen::move_rule::plan_rule_moves (cognitive 18): xtask_codegen::move_rule::plan_rule_moves has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (12 pts), loops 3 (6 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/move_rule.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3ffbae6eee34b2d69b400a652efb4ad4121aeae728e8050ab56f061834964a0"}},{"ruleId":"D2","level":"warning","message":{"text":"SummaryReporter::test_completed (cognitive 18): SummaryReporter::test_completed has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (5 pts), boolean chains 1, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/coverage/src/reporters.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"efda1ec0ee031017547247241f848b88ee75ee6a8a99f9d1235b5352f3e825bf"}},{"ruleId":"D2","level":"warning","message":{"text":"extract-utilities.addKeywordBranches (cognitive 18): extract-utilities.addKeywordBranches has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (16 pts), 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":"packages/tailwindcss-config-analyzer/src/v4/extract-utilities.ts"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"64079347c38ccad7f8db99311cbbda221148517a7e30007f2d27474def8254fa"}},{"ruleId":"D2","level":"warning","message":{"text":"parseAriaSpec (cognitive 18): parseAriaSpec has cognitive complexity 18 (threshold 15). Drivers by points: other 15, loops 3. 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":"packages/aria-data/generate-aria-data.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b975fe113d9802f47743f91a4329296c6612a2926eb080793fa793da1f163ba"}},{"ruleId":"D2","level":"warning","message":{"text":"InspectionDiagnostic::source_advices (cognitive 17): InspectionDiagnostic::source_advices has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 3 (4 pts), loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/commands/inspect.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"37130837fc0b1f128a451b9bd7d4f80f39f0f3095d94222fa230f0ef5f240c59"}},{"ruleId":"D2","level":"warning","message":{"text":"StylelintMigrationResults::advices (cognitive 17): StylelintMigrationResults::advices has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 1 (3 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/execute/migrate/stylelint_to_biome.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"165f29e3f93d29280095c69bb9803efdc7e734934b653d801f865fbf45d94293"}},{"ruleId":"D2","level":"warning","message":{"text":"ScssStringScanner::scan_body (cognitive 17): ScssStringScanner::scan_body has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_parser/src/lexer/scan_cursor.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"a90ce41a04eb55423f958d5673be1ce2efda4abdb933218333c55eb525b4bd95"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_css_syntax::number_ext::scan_css_number (cognitive 17): biome_css_syntax::number_ext::scan_css_number has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_syntax/src/number_ext.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb122b7661fe36a3b7225433896e3e562a47b5574b1509ba31e4286129c96c3e"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_diagnostics::display::print_file_location (cognitive 17): biome_diagnostics::display::print_file_location has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 1, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_diagnostics/src/display.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"0babaa6cca167b3e5b744501d8a8610a85aa27b47ca8f67d80b2883e00de70b0"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_diagnostics::display::diff::process_diff_lines (cognitive 17): biome_diagnostics::display::diff::process_diff_lines has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_diagnostics/src/display/diff.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c2b3ca7017cacc60880025541b6e66bd9597acf26312f1b8dfcb9ef284bbb9"}},{"ruleId":"D2","level":"warning","message":{"text":"CommentsBuilderVisitor::normalize_placement_into_formatted_tree (cognitive 17): CommentsBuilderVisitor::normalize_placement_into_formatted_tree has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 3 (5 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/biome_formatter/src/comments/builder.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58db033910d71e78b9fde875e119e7982e55bf038ec7685c97e023555bd96e0"}},{"ruleId":"D2","level":"warning","message":{"text":"CommentsBuilder::add_comment (cognitive 17): CommentsBuilder::add_comment has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 5 (12 pts), if/else 2 (5 pts) (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_formatter/src/comments/builder.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"c294555ac31386c7beef34df777bab74d0f094f26c9d75cc20bb3ed24bbfe458"}},{"ruleId":"D2","level":"warning","message":{"text":"FileSystem::auto_search_files_with_predicate (cognitive 17): FileSystem::auto_search_files_with_predicate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_fs/src/fs.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"c03f4fc3542baf9b440b3b78c658f251e72a5e3248361cbf342a85f0d8c89551"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_grit_patterns::pattern_compiler::node_like_compiler::node_pattern_from_node_with_name_and_kind (cognitive 17): biome_grit_patterns::pattern_compiler::node_like_compiler::node_pattern_from_node_with_name_and_kind has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 2 (4 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_patterns/src/pattern_compiler/node_like_compiler.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"850963ed05756d8c55afeaef6b755a6ee9ff371d13a0de8a5276f4840debccd7"}},{"ruleId":"D2","level":"warning","message":{"text":"NoAstroConflictingSetDirectives::run (cognitive 17): NoAstroConflictingSetDirectives::run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/nursery/no_astro_conflicting_set_directives.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"be332600351d0f44c6cdea3d750723578439ccdc6a466fe89427cd8381b34768"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatHtmlVerbatimElementChildren::fmt (cognitive 17): FormatHtmlVerbatimElementChildren::fmt has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_formatter/src/verbatim.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"9318c813407276daf2601a5f3035cebf5f2222c4ae796a8c19adff844104678e"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_html_formatter::utils::srcset::is_valid_non_negative_float (cognitive 17): biome_html_formatter::utils::srcset::is_valid_non_negative_float has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_formatter/src/utils/srcset.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"deff440fb57ddc683db3af944c40f7d06093c6e3bff9023860f07b8fa5698906"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_html_parser::syntax::parse_attribute (cognitive 17): biome_html_parser::syntax::parse_attribute has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 5, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_parser/src/syntax/mod.rs"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b0f529100f18b953e775df4ef2f3887e0a7f4fca777a6e678bff03f99b604d"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpressionExt::is_number (cognitive 17): ExpressionExt::is_number has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 3, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/complexity/no_implicit_coercions.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"6486e87149c0d7771f17634705f6608e62e8f74a61af988ad7ae76cecb663402"}},{"ruleId":"D2","level":"warning","message":{"text":"UseArrowFunction::run (cognitive 17): UseArrowFunction::run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/complexity/use_arrow_function.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ad4a6acae716cbc392209d891dd7b1a73c52d5ba4771339896109db0da9717"}},{"ruleId":"D2","level":"warning","message":{"text":"UseJsonImportAttributes::run (cognitive 17): UseJsonImportAttributes::run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/use_json_import_attributes.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59374f0248d82c76fdeef54cb7374ef498734b11fbd2fcfd3f1c2ab120d2886"}},{"ruleId":"D2","level":"warning","message":{"text":"NoUndeclaredClasses::run (cognitive 17): NoUndeclaredClasses::run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 2 (3 pts), boolean chains 1, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_undeclared_classes.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"50c72a40f781db14a6c7ce76aa82c392ec221c68e60492bad8e215446615c9fd"}},{"ruleId":"D2","level":"warning","message":{"text":"SpliceReplacement::from_arguments (cognitive 17): SpliceReplacement::from_arguments has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_useless_splice.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d029cfc4a6befde76a70194b5d78675db2d550a57eb51066072d4d09ad51867"}},{"ruleId":"D2","level":"warning","message":{"text":"FlattenedArguments::next (cognitive 17): FlattenedArguments::next has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_flat_math_min_max.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b211cb018281c30b3a000ea6ac11490ea831e2c5584546d9754692f49e88db2"}},{"ruleId":"D2","level":"warning","message":{"text":"NoNonNullAssertion::action (cognitive 17): NoNonNullAssertion::action has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/no_non_null_assertion.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"822e19d27514bc5cb5b4306ec62b154d3c251799fe891f4311c4867af0c65ef7"}},{"ruleId":"D2","level":"warning","message":{"text":"NoParameterAssign::run (cognitive 17): NoParameterAssign::run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 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/biome_js_analyze/src/lint/style/no_parameter_assign.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa50d42902f765b39808f20f1eb27e868604d91432516816a87c55658d43b7fd"}},{"ruleId":"D2","level":"warning","message":{"text":"UseConsistentObjectDefinitions::action (cognitive 17): UseConsistentObjectDefinitions::action has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 3 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_consistent_object_definitions.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a654d6d113d2300292aff7fe7c3eb9ee1d1d58abd353b0164524b0f238f8e28"}},{"ruleId":"D2","level":"warning","message":{"text":"NoDuplicateElseIf::run (cognitive 17): NoDuplicateElseIf::run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/no_duplicate_else_if.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e628b98537273fed7e8dbe71ca89c19567afa363305daa274d2e2b85457b60b"}},{"ruleId":"D2","level":"warning","message":{"text":"NoPlaywrightNetworkidle::run (cognitive 17): NoPlaywrightNetworkidle::run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/no_playwright_networkidle.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1d3081a85d78336f7faa8cc651f4cbe821d214bd1fe39dfe24c97e8bedc555c"}},{"ruleId":"D2","level":"warning","message":{"text":"NoUnknownAttribute::run (cognitive 17): NoUnknownAttribute::run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/no_unknown_attribute.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e65d2121d6e46c2028313aca2bcd72c290e1b5d5f9c30501bcb1148b4dd278b"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::complexity::use_optional_chain::extract_optional_chain_like_typeof (cognitive 17): biome_js_analyze::lint::complexity::use_optional_chain::extract_optional_chain_like_typeof has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (7 pts), match/switch 3 (5 pts), boolean chains 4, loops 1 (nesting depth added 4). Of this number, 10 points are the body\u0027s own statements and 7 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/complexity/use_optional_chain.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f4b5ccae65e0797802104562c27122ad7d42d7f78c2c717fcd6a7b2dd2169a"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::correctness::no_unused_imports::is_unused (cognitive 17): biome_js_analyze::lint::correctness::no_unused_imports::is_unused has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 7 (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/biome_js_analyze/src/lint/correctness/no_unused_imports.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"66584ca641609ba445a5808d4b8fc6f20c901b32bf3bf08f43d0afc76d797a26"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::no_misleading_return_type::analysis::unwrap_type_wrappers (cognitive 17): biome_js_analyze::lint::nursery::no_misleading_return_type::analysis::unwrap_type_wrappers has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), match/switch 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_misleading_return_type/analysis.rs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcea48844527a5fa8034534769e57287cbe6e63c34aecd9df4cc3fe814dcddf3"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::no_useless_recursion::enclosing_function (cognitive 17): biome_js_analyze::lint::nursery::no_useless_recursion::enclosing_function has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_useless_recursion.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bed613edcefdac1412cb46faaaf50292914031c324a325efec01e9017d503c4"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::no_useless_spread::array_copy (cognitive 17): biome_js_analyze::lint::nursery::no_useless_spread::array_copy has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_useless_spread.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c01b73bbf611acf2953fadde387108ed460e96fcbd3328a6aa3afcca103821e"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::use_explicit_return_type::handle_any_function (cognitive 17): biome_js_analyze::lint::nursery::use_explicit_return_type::handle_any_function has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 4 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_explicit_return_type.rs"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc1acdc1b154ef3b254679e7e6907afd81802bcf4521329a0372c8acd1f0036"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::style::use_numeric_separators::analyze_number_chunk (cognitive 17): biome_js_analyze::lint::style::use_numeric_separators::analyze_number_chunk has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 5, 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/biome_js_analyze/src/lint/style/use_numeric_separators.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb9d162ee7fe5dc7413592a4d5fb65e09268e402649d174952e6ce46c0926ce"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::utils::parse_package_name (cognitive 17): biome_js_analyze::utils::parse_package_name has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/utils.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"b877248064b7f22731cb8beb7ce05ab2025316daf2903422e82139892d94dd83"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_control_flow::nodes::is_truthy_literal (cognitive 17): biome_js_control_flow::nodes::is_truthy_literal has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 2 (4 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_control_flow/src/nodes.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f3070282f4de3eb16045126211642676c9941d7aa73d5ee2ab38fa6c332ad2"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatTypeVariant::fmt (cognitive 17): FormatTypeVariant::fmt has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/ts/lists/union_type_variant_list.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61dbd4b4480df049babae9793a6748361b13c73f8644ddc5f0ca412dbe71351"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleArgument::is_simple_call_like_expression (cognitive 17): SimpleArgument::is_simple_call_like_expression has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/utils/member_chain/simple_argument.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea62b6552cbbb08348e87988e46c24cad85d0da33dd684fb01c0bb889871c54d"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_formatter::comments::handle_import_named_clause_comments (cognitive 17): biome_js_formatter::comments::handle_import_named_clause_comments has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (14 pts), boolean chains 2, match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/comments.rs"},"region":{"startLine":1457}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c52a2dd3106111341c623f645a705ca5034f34132f4fdfcd261b837bb0aaeea"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_formatter::js::expressions::array_expression::should_break (cognitive 17): biome_js_formatter::js::expressions::array_expression::should_break has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/js/expressions/array_expression.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f5f6b15cc985078f0e33fb6a18ecc28a14478dfa3b2c2d9dc6960cfe396245"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_formatter::utils::assignment_like::should_break_after_operator (cognitive 17): biome_js_formatter::utils::assignment_like::should_break_after_operator has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 3 (7 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/utils/assignment_like.rs"},"region":{"startLine":985}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dfd1fdbdcdf81587900595bb39eaa13e9a584180b330c38057a2ea3be471b54"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_formatter::utils::assignment_like::is_short_argument (cognitive 17): biome_js_formatter::utils::assignment_like::is_short_argument has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 4 (12 pts), if/else 3, boolean chains 2 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/utils/assignment_like.rs"},"region":{"startLine":1270}}}],"partialFingerprints":{"codehealthFindingId/v1":"9093e3293a6f72d8554748adb226f3145b05da5b2360377f2122fce3741b17b2"}},{"ruleId":"D2","level":"warning","message":{"text":"JsLexer::read_zero (cognitive 17): JsLexer::read_zero has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_parser/src/lexer/mod.rs"},"region":{"startLine":1290}}}],"partialFingerprints":{"codehealthFindingId/v1":"6260205d57fcba012fe683f97a78dc2af6d8b20d7872753ebdd58e1e85fe9d30"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_parser::syntax::class::eat_class_heritage_clause (cognitive 17): biome_js_parser::syntax::class::eat_class_heritage_clause has cognitive complexity 17 (threshold 15). Drivers by points: if/else 2 (8 pts), match/switch 3 (8 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_parser/src/syntax/class.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d2eb92f75715a05b7a966d9876e32cb30aaa6a71581d3b035efa1770142e7d"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_parser::syntax::module::specifier_metadata (cognitive 17): biome_js_parser::syntax::module::specifier_metadata has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 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/biome_js_parser/src/syntax/module.rs"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6022bfa09a0a96e7460471bb5a94a20b923491d32ed827055a675433cb05adb"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_syntax::unescape::decode_unicode_escape (cognitive 17): biome_js_syntax::unescape::decode_unicode_escape has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_syntax/src/unescape.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"c29ecf3e0deadb67f22d4b983be308140781f2b3ccc97b117d2e0bc2a0d173af"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_type_info::narrowing::narrow_non_union (cognitive 17): biome_js_type_info::narrowing::narrow_non_union has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 4 (5 pts), boolean chains 2 (nesting depth added 6). 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/biome_js_type_info/src/narrowing.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"6289f9f60bf9aef13e324728e84c52fbc0f59ba6d691cce8f78ac5390984837d"}},{"ruleId":"D2","level":"warning","message":{"text":"NoJsonUnsafeValues::run (cognitive 17): NoJsonUnsafeValues::run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_json_analyze/src/lint/nursery/no_json_unsafe_values.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe1d31580f0efb7356d7cbb52d6314f4690938ec5fb3c693c21e6bf01fb213e"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_json_analyze::assist::source::use_sorted_package_json::sorters::scripts::get_all_script_values (cognitive 17): biome_json_analyze::assist::source::use_sorted_package_json::sorters::scripts::get_all_script_values has cognitive complexity 17 (threshold 15). Drivers by points: if/else 2 (8 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_json_analyze/src/assist/source/use_sorted_package_json/sorters/scripts.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f9ac3319ea348a0561904c02870a888bd8aee38ec684d1a61427db02a5eed5"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_parser::syntax::break_for_list_interrupt_after_inline_newline (cognitive 17): biome_markdown_parser::syntax::break_for_list_interrupt_after_inline_newline has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 7, if/else 5 (7 pts), loops 2 (3 pts) (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/biome_markdown_parser/src/syntax/mod.rs"},"region":{"startLine":1283}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1853e2ea7baa0d87bccdefb4dcb4d7e5b171e91de5e08ce597d082519799b6c"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_parser::syntax::inline_list_source_len (cognitive 17): biome_markdown_parser::syntax::inline_list_source_len has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4, 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/biome_markdown_parser/src/syntax/mod.rs"},"region":{"startLine":1736}}}],"partialFingerprints":{"codehealthFindingId/v1":"6253c835e1073a982dcf66e9c3d21f2ee6adacfabf77e41656505dd8cae991f4"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_parser::syntax::quote::is_thematic_break_candidate_text (cognitive 17): biome_markdown_parser::syntax::quote::is_thematic_break_candidate_text 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/biome_markdown_parser/src/syntax/quote.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4ce4ef6b4e30e206d8043aea55627ace62508cda6a5dc1d81ce9cc52f07a71"}},{"ruleId":"D2","level":"warning","message":{"text":"IgnoreScanner::action (cognitive 17): IgnoreScanner::action has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 3 (8 pts) (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_migrate/src/analyzers/ignore_scanner.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbff4f3a68625d6dc1b02b9310309e37da439143d1b759b9e3fd0bd79ad6242a"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_migrate::analyzers::includes::to_biome_glob (cognitive 17): biome_migrate::analyzers::includes::to_biome_glob has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_migrate/src/analyzers/includes.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6abdd8bc9b17b8c2aa6676d7efe84e4e4bd192b8aa88f5780b12110086d2891"}},{"ruleId":"D2","level":"warning","message":{"text":"ArgumentTypeCompatibility::argument_extends_parameter (cognitive 17): ArgumentTypeCompatibility::argument_extends_parameter has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/queries/type_inference/calls/implementation.rs"},"region":{"startLine":1468}}}],"partialFingerprints":{"codehealthFindingId/v1":"76740320c6c15b77317ef88d242712c1c1d102e2639df3deee77f479b1ab70e4"}},{"ruleId":"D2","level":"warning","message":{"text":"ResolutionCtx::resolve_const_argument (cognitive 17): ResolutionCtx::resolve_const_argument has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 3, match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f7fca8541fa8434f818e408ffe8e5c591ddffc6460bf1119c567e653ad0cd2f"}},{"ruleId":"D2","level":"warning","message":{"text":"JsModuleVisitor::collect_info (cognitive 17): JsModuleVisitor::collect_info has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/js_module_info/visitor.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd0dc6e527e33206b89740bf242769986e6b31b097b9aef6d87ab46517191caf"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_module_graph::js_module_info::flow::guards::comparison_step (cognitive 17): biome_module_graph::js_module_info::flow::guards::comparison_step has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 4 (8 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/js_module_info/flow/guards.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3995323c36386a08b508fa1091a37aa4cb0e6db9cece35f5ddbf1eceab4202c"}},{"ruleId":"D2","level":"warning","message":{"text":"BatchMutation::remove_js_variable_declarator (cognitive 17): BatchMutation::remove_js_variable_declarator has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/utils/batch.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"670c7fc90baf0d6c11a1c9c99e40da7c004a8c439b7fa5c28f413f5c051e33c0"}},{"ruleId":"D2","level":"warning","message":{"text":"GreenChunks::next (cognitive 17): GreenChunks::next has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (14 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/biome_rowan/src/syntax_node_text.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e430df6aba363d21a60c4a08e54fd5de13bcb22e187b0a534ca1ac0e8e01fa"}},{"ruleId":"D2","level":"warning","message":{"text":"AnalyzerVisitorBuilder::finish (cognitive 17): AnalyzerVisitorBuilder::finish has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 4 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/mod.rs"},"region":{"startLine":2611}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b57a5b0fa29b1e24c85386b9c6f5f20620ecfe003caf0c3fe61c7aa824d162"}},{"ruleId":"D2","level":"warning","message":{"text":"OverrideSettingPattern::apply_overrides_to_js_format_options (cognitive 17): OverrideSettingPattern::apply_overrides_to_js_format_options has cognitive complexity 17 (threshold 15). Drivers by points: if/else 17. 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/biome_service/src/settings.rs"},"region":{"startLine":2096}}}],"partialFingerprints":{"codehealthFindingId/v1":"189120f7d9e5ae3d491322e5d039fd71f3d5b6514c1dbba6aa805cf4c2528e17"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceServerWithDb::change_file (cognitive 17): WorkspaceServerWithDb::change_file has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 3 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/workspace/server.rs"},"region":{"startLine":3454}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d5c16f85047fefb25839c75039b4da37124077ebef7b63e6d55933d5726803e"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_service::configuration::load_user_config (cognitive 17): biome_service::configuration::load_user_config has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/configuration.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"9214254708e3a1ebc9211932edb2734086484e5b3ac6d333437625488e78bbb5"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_tailwind_logic::use_tailwind_sorted_classes::sort_v4_variants::variant_key_from_segments (cognitive 17): biome_tailwind_logic::use_tailwind_sorted_classes::sort_v4_variants::variant_key_from_segments has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 3 (7 pts) (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/biome_tailwind_logic/src/use_tailwind_sorted_classes/sort_v4_variants.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"7674464dfc29a3efc0a2b1bd600f438962c45b593ebc65db387746b83ba683f1"}},{"ruleId":"D2","level":"warning","message":{"text":"Collector::run (cognitive 17): Collector::run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 3, loops 1, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_vue_semantic/src/semantic_model/component.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff37be947e38b7ca5ab58cbd7ac32204f6494818e0807f55cfc4a9a4cf65ec9"}},{"ruleId":"D2","level":"warning","message":{"text":"Collector::collect_runtime_emits (cognitive 17): Collector::collect_runtime_emits has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_vue_semantic/src/semantic_model/component.rs"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c76bfc98058ec3d400b2b3f8bbebd77b58c317638da2ec3f2546927ae35a071"}},{"ruleId":"D2","level":"warning","message":{"text":"GitRepo::open (cognitive 17): GitRepo::open has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (10 pts), match/switch 2 (5 pts), loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/formatter.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a29ad34b929d5f7b22e231d4783a907b7fa64763f7d722e1d71c9ea8057545f"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobalBuilder::try_lower_type (cognitive 17): GlobalBuilder::try_lower_type has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (7 pts), match/switch 3 (6 pts), loops 2 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/generate_global_types/lower/generic.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e494751191e67682ed41ae0c86c42242733322553b57ac679cbd916a295a19"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask_codegen::generate_global_types::lower::overrides::lower_disposable_global (cognitive 17): xtask_codegen::generate_global_types::lower::overrides::lower_disposable_global has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (3 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/generate_global_types/lower/overrides.rs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"96fafae3836c2c900de1fba2dba60cbe6e7eaca42d2e2d5b2a8d6ff1f211198e"}},{"ruleId":"D2","level":"warning","message":{"text":"generate-aria-data.parseConcept (cognitive 17): generate-aria-data.parseConcept has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 4, ternaries 2 (4 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/aria-data/generate-aria-data.js"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"54b119803406c20a2856190c792c6553c5ca21e149985838d891b6c378badcf1"}},{"ruleId":"D2","level":"warning","message":{"text":"plainOutput.printComparison (cognitive 17): plainOutput.printComparison has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (7 pts), ternaries 1 (4 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/prettier-compare/src/plainOutput.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aa233474ac6e4210aac5a99da9ef609bfe11b8baa0ac0bd99cb113806c4c75f"}},{"ruleId":"D2","level":"warning","message":{"text":"SarifReporterVisitor::report_diagnostics (cognitive 16): SarifReporterVisitor::report_diagnostics has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (16 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/reporter/sarif.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"336ebc454067959a1b78e18426b2509c76895755208703daa5d3f66b4ef999bf"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_css_analyze::lint::correctness::no_unmatchable_anb_selector::is_unmatchable (cognitive 16): biome_css_analyze::lint::correctness::no_unmatchable_anb_selector::is_unmatchable has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 7 (15 pts), boolean chains 1 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_analyze/src/lint/correctness/no_unmatchable_anb_selector.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"daf39f31727fde8e7709ca43dac0897facf21d2605e3213a75a94759c303771e"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_css_analyze::lint::suspicious::no_useless_escape_in_string::next_useless_escape (cognitive 16): biome_css_analyze::lint::suspicious::no_useless_escape_in_string::next_useless_escape has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (10 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_analyze/src/lint/suspicious/no_useless_escape_in_string.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d0e55a1c38cdfbb1517c8a40c7b0e89588d39edf71b6191027027d13f66ee0"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatScssEachMultiValueHeader::fmt (cognitive 16): FormatScssEachMultiValueHeader::fmt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 3 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_formatter/src/scss/auxiliary/each_header.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"83a3a9933652de9495352109db279f47b4592a9cb42f1189f1c21378a6c72f0c"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatCssVerbatimNode::fmt (cognitive 16): FormatCssVerbatimNode::fmt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, loops 4 (6 pts), match/switch 1 (2 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_formatter/src/verbatim.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"214e1949ee8e3618328acc12dd1ae5d14dd08659ec07aa0bfe29086fe4b13e54"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_css_formatter::utils::scss_include_comments::place_map_separator_comment (cognitive 16): biome_css_formatter::utils::scss_include_comments::place_map_separator_comment has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 6 (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/biome_css_formatter/src/utils/scss_include_comments.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5551a347b2edc5eb3ffa9d56df5a454e9143f1e26d9418dfd24568255db194c"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_css_parser::syntax::property::unicode_range::parse_unicode_range (cognitive 16): biome_css_parser::syntax::property::unicode_range::parse_unicode_range has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_parser/src/syntax/property/unicode_range.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"012fb03459598f8feb4085740a5fbf398afb30664ce73a2635721747cc88e3d9"}},{"ruleId":"D2","level":"warning","message":{"text":"Encoder::consume_type (cognitive 16): Encoder::consume_type has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_syntax/src/property_syntax/parser.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a807ec4dbf9a522b2c6a75180ba1364ed716563c1e3f618aab1da663260e5f"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_css_syntax::property_syntax::matcher::matches_scss_component (cognitive 16): biome_css_syntax::property_syntax::matcher::matches_scss_component has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 3, loops 1 (2 pts), match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_syntax/src/property_syntax/matcher.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6ec403f09ce4e638718a0eca0f6691ed7622d8d6ccf2656875671defba905a"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_formatter::buffer::clean_interned (cognitive 16): biome_formatter::buffer::clean_interned has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 2 (4 pts), loops 1 (3 pts) (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_formatter/src/buffer.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f2a601f34433b426a4d50a216fcb94a58bc021ed14fb2eea726ed18f5809809"}},{"ruleId":"D2","level":"warning","message":{"text":"MemoryTraversalScope::evaluate (cognitive 16): MemoryTraversalScope::evaluate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 1 (3 pts), loops 2, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_fs/src/fs/memory.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b7df5967cebbfe54c6d796a5d26d935e2d109a89430f0b3602975b96d22858"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_grit_parser::parser::parse_version (cognitive 16): biome_grit_parser::parser::parse_version has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 1 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_parser/src/parser/mod.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d0f248560a6baf7653728f16b7c15d96b774d17a54fe0367c1921f1a716089"}},{"ruleId":"D2","level":"warning","message":{"text":"UseVueValidVOn::run (cognitive 16): UseVueValidVOn::run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/correctness/use_vue_valid_v_on.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"54eeb45a2469a9a7467c193b6dee3fe30fb9c7af63731d81bbf732c3e19b6302"}},{"ruleId":"D2","level":"warning","message":{"text":"NoVueUselessTemplateAttributes::run (cognitive 16): NoVueUselessTemplateAttributes::run has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 2 (5 pts), boolean chains 4, if/else 2 (4 pts), 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/biome_html_analyze/src/lint/nursery/no_vue_useless_template_attributes.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"487e4b4f8d0500d1ca39f12ddf41960368cdf267f7c4b8c1fdfd33ea1a5eb830"}},{"ruleId":"D2","level":"warning","message":{"text":"UseConsistentBlockLang::run (cognitive 16): UseConsistentBlockLang::run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 2, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/nursery/use_consistent_block_lang.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e189b7dbf8b6c11f00ff2c6ffb4d672581322e28d3be3a4c3e1c646d3a39c2"}},{"ruleId":"D2","level":"warning","message":{"text":"HtmlCommentStyle::place_comment (cognitive 16): HtmlCommentStyle::place_comment has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 5 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_formatter/src/comments.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d0cba44b672f4e4eace8e8190fdb5ba61317077ad0306839471e7ef1eb933f"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatHtmlOpeningElement::fmt_dangling_comments (cognitive 16): FormatHtmlOpeningElement::fmt_dangling_comments has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 4, 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/biome_html_formatter/src/html/auxiliary/opening_element.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c61bfdc834e63df044f12367c3d9ea64f3fd227eb575c5f847eca19d620ae5f"}},{"ruleId":"D2","level":"warning","message":{"text":"HtmlLexer::next_token (cognitive 16): HtmlLexer::next_token has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (13 pts), if/else 3 (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/biome_html_parser/src/lexer/mod.rs"},"region":{"startLine":1804}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c7cd7adbd12bbe7244edffbfe153a9d8c392fb232a34cd9c82783eed111547"}},{"ruleId":"D2","level":"warning","message":{"text":"CognitiveComplexityVisitor::on_leave (cognitive 16): CognitiveComplexityVisitor::on_leave has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/complexity/no_excessive_cognitive_complexity.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"0862bbf089e414453797fbd5090c782ec83aec62784e8317e0f94c7577cde40b"}},{"ruleId":"D2","level":"warning","message":{"text":"NoUselessConstructor::run (cognitive 16): NoUselessConstructor::run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/complexity/no_useless_constructor.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"427508814aa15e77e4d3187a87d91a377827ed0af41fe299bc8368fbc813a321"}},{"ruleId":"D2","level":"warning","message":{"text":"NoQwikUseVisibleTask::run (cognitive 16): NoQwikUseVisibleTask::run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/no_qwik_use_visible_task.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"305b95d585528e5bb1cff3c649437ea51a5fce4661aa48890f1576a2a361966b"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingPatterIterator::next_binding (cognitive 16): BindingPatterIterator::next_binding has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 6 (14 pts), if/else 2 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/no_solid_destructured_props.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"e92ac2dec2cc77a49f54af6a20c6ee0986513a5c627f6f304e3975abe1b821c4"}},{"ruleId":"D2","level":"warning","message":{"text":"NoUndeclaredDependencies::run (cognitive 16): NoUndeclaredDependencies::run has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 5 (8 pts) (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/no_undeclared_dependencies.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5a167faf8b9d8503442e96302512ba858fd4bdedc4027f2e8d51faa0d874de0"}},{"ruleId":"D2","level":"warning","message":{"text":"NoUnusedImports::run (cognitive 16): NoUnusedImports::run has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (8 pts), if/else 3 (7 pts), boolean chains 1 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/no_unused_imports.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"09b8195617c757598470c0337a7d7393c35c40515d8958e787053f0a1208ea4d"}},{"ruleId":"D2","level":"warning","message":{"text":"UseBigintLiterals::action (cognitive 16): UseBigintLiterals::action has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 6 (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/biome_js_analyze/src/lint/nursery/use_bigint_literals.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f80464485203771d5e3818e99529a55c309ada8aefc3799b799084d29ff07a"}},{"ruleId":"D2","level":"warning","message":{"text":"UseSimplifiedBooleanReturn::action (cognitive 16): UseSimplifiedBooleanReturn::action has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 4 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_simplified_boolean_return.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1227f9044160ed915db422ddf7e1628d14a63979e668e6c61020a2b89e0844d"}},{"ruleId":"D2","level":"warning","message":{"text":"NoJsxPropsBind::run (cognitive 16): NoJsxPropsBind::run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 3 (6 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/biome_js_analyze/src/lint/performance/no_jsx_props_bind.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"a34e603d57cc405da638f263ae20591001275fa920af98e5d09cbfc4ca6d670e"}},{"ruleId":"D2","level":"warning","message":{"text":"ErrorType::get_error_message (cognitive 16): ErrorType::get_error_message has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 3 (5 pts) (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_at_index.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d71f956e7f97d53741053862038757bb2ff206885b2048fb65f0f68124ac4c2"}},{"ruleId":"D2","level":"warning","message":{"text":"UseExplicitLengthCheck::run (cognitive 16): UseExplicitLengthCheck::run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_explicit_length_check.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f214286eb6a83d5e3cd3df1a51e6a574422bdf3a426bb8f1842e3b258477b9"}},{"ruleId":"D2","level":"warning","message":{"text":"NoArrayIndexKey::run (cognitive 16): NoArrayIndexKey::run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/no_array_index_key.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"db8659ab0ed3b9827a7326162da96e75b66b4f1c8b943c0b1dcfb263fd938f6d"}},{"ruleId":"D2","level":"warning","message":{"text":"NoDuplicateJsxProps::run (cognitive 16): NoDuplicateJsxProps::run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/no_duplicate_jsx_props.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb80713feb807cc3ebd141382a6d5229fccc24419c4749bef0925031594e887"}},{"ruleId":"D2","level":"warning","message":{"text":"NoMisplacedAssertion::run (cognitive 16): NoMisplacedAssertion::run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/no_misplaced_assertion.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d49441ed1507469140cb512a68442e3f8cfefc7f0add6fc9b49ab4bd960c67"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::frameworks::is_framework_api_reference (cognitive 16): biome_js_analyze::frameworks::is_framework_api_reference has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 2 (5 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/biome_js_analyze/src/frameworks/mod.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d56f310266edbdda5d20ac3d2bc003144e993eb3f4272e79521ff68a1fac61"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::frameworks::playwright::is_expect_expression (cognitive 16): biome_js_analyze::frameworks::playwright::is_expect_expression has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), boolean chains 4, match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/frameworks/playwright.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"9097e73b8221f0886486d82f2f8b0e483d4c26f57bf42d1d089215ad29136572"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::complexity::use_math_min_max::contains_bigint (cognitive 16): biome_js_analyze::lint::complexity::use_math_min_max::contains_bigint has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/complexity/use_math_min_max.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"03c180b24ed97c08676f6f97f743cb0a25446136c99c47c84b4575f890735d0d"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::correctness::no_precision_loss::is_precision_lost_in_base_other (cognitive 16): biome_js_analyze::lint::correctness::no_precision_loss::is_precision_lost_in_base_other has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 2 (3 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/no_precision_loss.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"5645be4cb0652926235efcb57d76a1bd06754e9e9748b4e16d7bdb7b43f6b043"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::no_array_sort_for_min_max::has_optional_chain_element (cognitive 16): biome_js_analyze::lint::nursery::no_array_sort_for_min_max::has_optional_chain_element has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_array_sort_for_min_max.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce9600dfd0e7b3a665d27389bc022aeb7e64db1fb212644d0b7ea76b1f6a521"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::no_map_spread::is_ignored_array (cognitive 16): biome_js_analyze::lint::nursery::no_map_spread::is_ignored_array has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 3 (4 pts), boolean chains 2, loops 1 (nesting depth added 6). 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/biome_js_analyze/src/lint/nursery/no_map_spread.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bbe5a96ac6b66abf08e878c98f006491cbfbe563fa618002855a29ee23f35ac"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::no_null::is_allowed_argument (cognitive 16): biome_js_analyze::lint::nursery::no_null::is_allowed_argument has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (6 pts), boolean chains 5, match/switch 3 (5 pts) (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/biome_js_analyze/src/lint/nursery/no_null.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb361344caa0690b186e9325a529fcaebfe0a6de3a47f34a60bbae43eb5f2b0"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::no_unsafe_return::expected_return_type (cognitive 16): biome_js_analyze::lint::nursery::no_unsafe_return::expected_return_type has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 4 (6 pts) (nesting depth added 5). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_unsafe_return.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"027c5339112e458cf23b5e2131a843d7ab2342187ea10b64d8bb5e0dc2ce4cd7"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::nursery::use_promise_reject_errors::could_be_error (cognitive 16): biome_js_analyze::lint::nursery::use_promise_reject_errors::could_be_error has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_promise_reject_errors.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ba21ef8be50c0eeffb457ffeef1446f52907eedb2ccffe8d44d63f70e5bad5"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::style::use_numeric_separators::format_numeric_literal (cognitive 16): biome_js_analyze::lint::style::use_numeric_separators::format_numeric_literal has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), match/switch 2 (6 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_numeric_separators.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c1d03588d3e5fc0f67afcf16ba37dac2c29ad871330b3b759ddc33b3ea508a0"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::suspicious::no_duplicate_parameters::traverse_binding (cognitive 16): biome_js_analyze::lint::suspicious::no_duplicate_parameters::traverse_binding has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 6 (13 pts), if/else 1 (3 pts) (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/no_duplicate_parameters.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"46495f2503a76db73eb02759d0e4358a31b5c04fbe0a6eb64ff0c87579ccff10"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::suspicious::no_misleading_character_class::diagnostic_regex_pattern (cognitive 16): biome_js_analyze::lint::suspicious::no_misleading_character_class::diagnostic_regex_pattern has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (6 pts), match/switch 2 (6 pts), loops 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/no_misleading_character_class.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"44850a61ef451388e49d8c6a1807ee2ac7e8bbf1d8a9de3c4a81426953ff333a"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::lint::suspicious::no_then_property::process_js_method_object_member (cognitive 16): biome_js_analyze::lint::suspicious::no_then_property::process_js_method_object_member has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 1 (3 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/no_then_property.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"917ddb4d8c023dc0a04db63ae0fd11ac5035e17ad32fde80bfb6055c82ba7972"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::services::semantic_class::collect_references_from_property_initializer (cognitive 16): biome_js_analyze::services::semantic_class::collect_references_from_property_initializer has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/services/semantic_class.rs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"a02842cb35815d7a6a25b4f1484938c7df092adf90b1d2a97c257a0e4ae7ec62"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_analyze::shared::late_event_handler::classify_type_name (cognitive 16): biome_js_analyze::shared::late_event_handler::classify_type_name has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/shared/late_event_handler.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"636edb9ed323db0429cd0bea4be47daf58f82e71f7ea482ef464c0c5499221f1"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatJsArrowFunctionExpression::fmt_fields (cognitive 16): FormatJsArrowFunctionExpression::fmt_fields has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/js/expressions/arrow_function_expression.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"e836ea312323b617a819ad90a6b586e7c7fc50cb857d790e3ea230419650f131"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrowFunctionLayout::for_arrow (cognitive 16): ArrowFunctionLayout::for_arrow has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), match/switch 2 (5 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/biome_js_formatter/src/js/expressions/arrow_function_expression.rs"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"028d04768dee3219b7b8083ce91eed22f7893f2759c52e166cca255dab68a2f1"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatJsImportNamedClause::fmt_fields (cognitive 16): FormatJsImportNamedClause::fmt_fields has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/js/module/import_named_clause.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b98d6058d0273c06d056df43354671ae7592f6c0c33e1c46d3d123b249b484d"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatTsInterfaceDeclaration::fmt_fields (cognitive 16): FormatTsInterfaceDeclaration::fmt_fields has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/ts/declarations/interface_declaration.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"672c3ffeb72e5e1909040f30af7918122c9915d2840081a835c497fe94e517e5"}},{"ruleId":"D2","level":"warning","message":{"text":"MemberChain::fmt (cognitive 16): MemberChain::fmt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 3, 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/biome_js_formatter/src/utils/member_chain/mod.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d3e1ad74c580e88766d8b48d6e55ddb4bf3cb6effe792962b1efa7859f38b9e"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_formatter::js::expressions::call_arguments::can_group_expression_argument (cognitive 16): biome_js_formatter::js::expressions::call_arguments::can_group_expression_argument has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 5 (12 pts), boolean chains 4 (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/js/expressions/call_arguments.rs"},"region":{"startLine":1178}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f5fd516bab80c8ba602dc610ce7c875b8438d2f51be99addf68018d2fb510cc"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_formatter::utils::array::write_array_node (cognitive 16): biome_js_formatter::utils::array::write_array_node has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 2 (6 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/utils/array.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f60e695fbc000ab58cc4cba2ae2fd46658ee214221bc6cc5acac9519cff2b4"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_parser::syntax::expr::parse_call_arguments (cognitive 16): biome_js_parser::syntax::expr::parse_call_arguments has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, 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/biome_js_parser/src/syntax/expr.rs"},"region":{"startLine":1083}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba65f00bb4f9a667385b6a06ab7a98cc00647346b5ef1fcb6ddeb571e65fdeeb"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_parser::syntax::expr::parse_primary_expression (cognitive 16): biome_js_parser::syntax::expr::parse_primary_expression has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_parser/src/syntax/expr.rs"},"region":{"startLine":1281}}}],"partialFingerprints":{"codehealthFindingId/v1":"0812e2c1fea6454f5a606034010bcdc0997a8745e7d0e1b922ba429e423324d2"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_parser::syntax::module::parse_import_or_import_equals_declaration (cognitive 16): biome_js_parser::syntax::module::parse_import_or_import_equals_declaration has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 4, loops 1 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_parser/src/syntax/module.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4768e55e864dbfccff6e3d563fa563a5edcc4a7475a1f7304b8ef67fe5bb7c2"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_parser::syntax::module::parse_import_clause (cognitive 16): biome_js_parser::syntax::module::parse_import_clause has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 4, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_parser/src/syntax/module.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"e46ccdbc4b8652794e985e416ab5d618b899b9cf27307ec1a6077629a3cd33dd"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_js_parser::syntax::module::parse_any_export_named_specifier (cognitive 16): biome_js_parser::syntax::module::parse_any_export_named_specifier has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_parser/src/syntax/module.rs"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa8b43093735de23c0935a99b6dd51e165cde95bd137201734b2c78789bcdcc"}},{"ruleId":"D2","level":"warning","message":{"text":"JsLanguage::resolve_analyzer_options (cognitive 16): JsLanguage::resolve_analyzer_options has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 4 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/javascript.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"396d46239c1cdc4d16c8c5a8708bc16a6ae24059f775514bf624defe77314631"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentFileSource::try_from_extension (cognitive 16): DocumentFileSource::try_from_extension has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (16 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_languages/src/lib.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb2efe60ca3048ffeb009e022083e61eb3afc6d714bb549737297440ea974d6c"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_lsp::handlers::text_document::ensure_project_for_opened_document (cognitive 16): biome_lsp::handlers::text_document::ensure_project_for_opened_document has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (16 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/handlers/text_document.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"e59852a4f9caf7a7da50605ddd203a1fe8e6c91da2de99c4bdfc67d25c7c23fb"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatMdInlineItalic::fmt_fields (cognitive 16): FormatMdInlineItalic::fmt_fields has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_formatter/src/markdown/auxiliary/inline_italic.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8fb367726cd5397ec922e641bc466b625acf62275e5fe52999e3503909850da"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatMdTextual::fmt_fields (cognitive 16): FormatMdTextual::fmt_fields has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_formatter/src/markdown/auxiliary/textual.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"0195a675f5406a555222bde023a8b8c80703590f8e6e8e49c379936f4cf3ea04"}},{"ruleId":"D2","level":"warning","message":{"text":"WordGroup::emphasis_marker_sequence (cognitive 16): WordGroup::emphasis_marker_sequence has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 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/biome_markdown_formatter/src/words.rs"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"4099a9d7c6c87ec9974cdd16b9eecd736d0bf87485dc99d829379af6d8afe440"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_parser::syntax::handle_line_continuation (cognitive 16): biome_markdown_parser::syntax::handle_line_continuation has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 4 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/mod.rs"},"region":{"startLine":1443}}}],"partialFingerprints":{"codehealthFindingId/v1":"84bf5c8465ade3fb55c22315dea062a2e7a1a017369c4ed589187ca95c0cf354"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_parser::syntax::inline::nested_link_starts_here (cognitive 16): biome_markdown_parser::syntax::inline::nested_link_starts_here has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/inline/mod.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca52236f31eb8c98af0ca4f9299d486da088c15e767d4003eec17f3f65b8bc8"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_parser::syntax::link_block::skip_title_tokens (cognitive 16): biome_markdown_parser::syntax::link_block::skip_title_tokens has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 4, 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/biome_markdown_parser/src/syntax/link_block.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac1b42220662bc8129fcdf9d9347fcc33bf2e272daa785c85ad9fd09376c3c8"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_parser::syntax::list::emit_list_post_marker_space (cognitive 16): biome_markdown_parser::syntax::list::emit_list_post_marker_space has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d4b95fc5189815db3831c1e88fe14a260aa738d72883636f30d1a4b7164522d"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_markdown_parser::to_html::extract_alt_text_inline (cognitive 16): biome_markdown_parser::to_html::extract_alt_text_inline has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 2, match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/to_html.rs"},"region":{"startLine":2064}}}],"partialFingerprints":{"codehealthFindingId/v1":"939cb8e272bfa42f149613dfa5562e8059453dbf81fbb2822011d5cc1710c931"}},{"ruleId":"D2","level":"warning","message":{"text":"MdParagraph::is_html_comment (cognitive 16): MdParagraph::is_html_comment has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_syntax/src/block_ext.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"95328f59bfedf85a698d1ed02bb05d6a24fab20c83d7fa9540422a690ee91a81"}},{"ruleId":"D2","level":"warning","message":{"text":"ArgumentTypeCompatibility::action (cognitive 16): ArgumentTypeCompatibility::action has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (7 pts), if/else 4 (6 pts), boolean chains 3 (nesting depth added 5). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/queries/type_inference/calls/implementation.rs"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"e76ff57efde0366f504233f13e5e1bc1cc19656be2c874e9706fa6f1af55d92d"}},{"ruleId":"D2","level":"warning","message":{"text":"ResolutionCtx::filter_action (cognitive 16): ResolutionCtx::filter_action has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 3 (5 pts) (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":3126}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe4a7def209bf92125cb759abf76535f96a926aa07a3d2807c4b7661012b209"}},{"ruleId":"D2","level":"warning","message":{"text":"ResolutionCtx::resolve_import_member_with_steps (cognitive 16): ResolutionCtx::resolve_import_member_with_steps has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 4 (6 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/biome_module_graph/src/db/type_inference/imports.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f037ae091ced5124e1f3c6ed9939ff6ee65dbd38749424a2d3b068c715fd91d"}},{"ruleId":"D2","level":"warning","message":{"text":"HtmlModuleInfoInner::fmt (cognitive 16): HtmlModuleInfoInner::fmt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, loops 4 (8 pts) (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/format_module_graph.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f575dd0cd9964ed44a9b7c3c391d3083521ea760b44b17bb2a6e76195fd628"}},{"ruleId":"D2","level":"warning","message":{"text":"RootBuilder::statement (cognitive 16): RootBuilder::statement has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 5 (9 pts), if/else 2 (4 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/js_module_info/flow/builder.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"963de1961f0b8d4e18f5e192b08d7baf7fdf7e3d510ca679681ea317042dbaf2"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_module_graph::db::queries::css::search_css_class_transitive (cognitive 16): biome_module_graph::db::queries::css::search_css_class_transitive has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/queries/css.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"08aaca26ed9f5d723ada9b29144d1f97fda5355d901558a908c7bcab5f1e3ff8"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_module_graph::db::type_inference::imports::find_export_origin (cognitive 16): biome_module_graph::db::type_inference::imports::find_export_origin has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 2 (3 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/type_inference/imports.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"3224fd0a7bf428fbb9e63162e723265e5aa933dd0cbcc5b9070c89b20b06a56a"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_module_graph::db::type_inference::lookup::find_own_member_type (cognitive 16): biome_module_graph::db::type_inference::lookup::find_own_member_type has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 2 (3 pts) (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/type_inference/lookup.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"f31e139151e727b061db8a9731c0c7dcd95c2dbd4327af86843d7fcb48cb904e"}},{"ruleId":"D2","level":"warning","message":{"text":"SpdxExpression::check_trust (cognitive 16): SpdxExpression::check_trust has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_package/src/license/expression.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c6fb571b99469ea6df4a11c81e7bfa0582831f924bebf150f199640e699526"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_react_compiler::convert_ast::expressions::convert_expression (cognitive 16): biome_react_compiler::convert_ast::expressions::convert_expression has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 4 (7 pts) (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_react_compiler/src/convert_ast/expressions.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e3e90153c559670a35f28616b32cfad762c4bb5660e85493ba0d17f3db8fc7f"}},{"ruleId":"D2","level":"warning","message":{"text":"SyntaxNode::token_at_offset (cognitive 16): SyntaxNode::token_at_offset has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (10 pts), if/else 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_rowan/src/cursor/node.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"321b0259ebb226ea1ec9649955011de4418d8e69e6eacea3d3b889fa88383c0f"}},{"ruleId":"D2","level":"warning","message":{"text":"SyntaxFactory::make_separated_list_syntax (cognitive 16): SyntaxFactory::make_separated_list_syntax has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 1, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_rowan/src/syntax_factory.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c288493bc3ea4425c5f65ae8523c70c7b33a0531330c4f2f011e6829fe50f6"}},{"ruleId":"D2","level":"warning","message":{"text":"Selector::check (cognitive 16): Selector::check has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4 (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/biome_rule_options/src/use_naming_convention.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"60de5cdabdf9faafb72c9254f34c6e21cef70ea52926e54829756c7623bca1a2"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfigurationExtendsLoader::resolve_extended_configuration (cognitive 16): ConfigurationExtendsLoader::resolve_extended_configuration has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), match/switch 4 (6 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/configuration.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"08df742630b8220f291421cfd27245373b322f21c63e34cf4668eb67b0cd257c"}},{"ruleId":"D2","level":"warning","message":{"text":"ProcessFixAll::collect_signal_fixes_only (cognitive 16): ProcessFixAll::collect_signal_fixes_only has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 2 (3 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/mod.rs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab5df9383b47a2945c96d1a93f3584dce3a4fdc34f20b9953d38ec8b6426552"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_service::file_handlers::parse_lang_and_setup_from_script_opening_tag (cognitive 16): biome_service::file_handlers::parse_lang_and_setup_from_script_opening_tag has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/mod.rs"},"region":{"startLine":1539}}}],"partialFingerprints":{"codehealthFindingId/v1":"0033478a0d07f308a4959899ab88e5f80fa32ae5be7c80c9797f8127c75b41b5"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_suppression::parse_suppression_comment_with_line_prefix (cognitive 16): biome_suppression::parse_suppression_comment_with_line_prefix has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 4, 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/biome_suppression/src/lib.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a803a122d1b6883fd8982e03ad9f129de65dc600b3283ea7b0e8530ec5208ab"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_syntax_codegen::ast::check_unions (cognitive 16): biome_syntax_codegen::ast::check_unions has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 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/biome_syntax_codegen/src/ast.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"a60015a68231c22d6c1b6e7af1e225eb57f599ecc823a3ff1ad1587314218b80"}},{"ruleId":"D2","level":"warning","message":{"text":"CandidateText::compare (cognitive 16): CandidateText::compare has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_tailwind_logic/src/use_tailwind_sorted_classes/sort_v4.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef16d8548ab86a3b6916ec14b808ad7405c87c460d013fd3c169e87382eb10e"}},{"ruleId":"D2","level":"warning","message":{"text":"Collector::record_merged_options (cognitive 16): Collector::record_merged_options has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (10 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_vue_semantic/src/semantic_model/component.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ed112ee095170d960cd9214f335051581a80809acf806b91554ead4d04af959"}},{"ruleId":"D2","level":"warning","message":{"text":"Collector::is_vue_api (cognitive 16): Collector::is_vue_api has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_vue_semantic/src/semantic_model/component.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"056b0b08151ef033f5a463dde15c398327996336bcf9b795bd1941019f5b37ef"}},{"ruleId":"D2","level":"warning","message":{"text":"Collector::collect_module_bindings (cognitive 16): Collector::collect_module_bindings has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_vue_semantic/src/semantic_model/component.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84e76b255d7761fd13c1e6c1529b32889a694b1044d5106cbbab5ad9b0869b4"}},{"ruleId":"D2","level":"warning","message":{"text":"biome_vue_semantic::semantic_model::component::returned_objects (cognitive 16): biome_vue_semantic::semantic_model::component::returned_objects has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 2 (3 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_vue_semantic/src/semantic_model/component.rs"},"region":{"startLine":2540}}}],"partialFingerprints":{"codehealthFindingId/v1":"87bddca9978c9b7a3d2c62fa16ddbdb4d7606ee53ed58fed3a40810f36ad4394"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceColumn::compute (cognitive 16): SourceColumn::compute has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_yaml_formatter/src/comments.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"f77e8c19a7b8ce81c9f9d4ededd07af41257e534d5784d490740de3c52348d9d"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatYamlBlockInBlockNode::fmt_fields (cognitive 16): FormatYamlBlockInBlockNode::fmt_fields has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (16 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/biome_yaml_formatter/src/yaml/auxiliary/block_in_block_node.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"adbf4f92fa073b10787a97616bd19776c39521ce4fc1ae43ffa79587cd972ab2"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask_codegen::ast::check_unions (cognitive 16): xtask_codegen::ast::check_unions has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 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":"xtask/codegen/src/ast.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"6786837691bd1ab9ec46a9adfb216063ee4483f009bbb64cbde34bb5645416f1"}},{"ruleId":"D2","level":"warning","message":{"text":"Transport.processIncomingBody (cognitive 16): Transport.processIncomingBody has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (16 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/@biomejs/backend-jsonrpc/src/transport.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"59bf6d79a4cf26769250791e2f98cc275ddb4e1a75172d9a1824140df9b3cfb9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_module_graph::db::type_inference::promise_classification::classify_expression: FunctionTooLong \u2014 biome_module_graph::db::type_inference::promise_classification::classify_expression runs 713 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 613 over it, 7.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/biome_module_graph/src/db/type_inference/promise_classification.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"4106cf4a843d4e8be6b8a622d222c074e38334fe9b23d7bebe890984e0fb58a9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: workspace/server.rs: FileTooLong \u2014 3362 significant 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 2862 over it, 6.72\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/workspace/server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0204ce6ec698bbb5a0bfed1a02175953c8e968727cf42d46c15d73bc651d516c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_syntax_codegen::generate_nodes::generate_nodes: FunctionTooLong \u2014 biome_syntax_codegen::generate_nodes::generate_nodes runs 577 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 477 over it, 5.77\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_syntax_codegen/src/generate_nodes.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"b31c0224e30ed81c9e6e1b6f740ee4064b6b6f295d78f9e9dc76357f7d8f8bf1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/local_inference.rs: FileTooLong \u2014 2771 significant 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 2271 over it, 5.54\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/local_inference.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e5d21ace404041239ba6d3cb5b0e73462d61ac8a20d2c4e2af6e910e8dcb5d0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: type_inference/expressions.rs: FileTooLong \u2014 2560 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 97% of them inside a single declaration: ResolutionCtx (2 blocks, 73-3274). The bar is 500 significant lines; this is 2060 over it, 5.12\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b50272dae688ff42ec362f51dbd806cf61d510e47043b3ba1113eda09c422260"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ResolutionCtx: TooManyMethods \u2014 148 methods, declared across 6 files: type_inference/expressions.rs (66), type_inference/resolver.rs (35), type_inference/imports.rs (22), type_inference/qualifiers.rs (14), \u002B2 more file(s). The bar is 30 methods; this is 118 over it, 4.93\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/type_inference/resolver.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"116895ed75c21ed13e128708a4c46633d127b34908947402f6a7e09771daf5f0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_react_compiler::convert_ast::expressions::convert_expression: FunctionTooLong \u2014 biome_react_compiler::convert_ast::expressions::convert_expression runs 463 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 363 over it, 4.63\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_react_compiler/src/convert_ast/expressions.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1af5193f1bc4a735ae26ff6b4705701e34d7d81e559c11b47e967c5ae7e08e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/interned_types.rs: FileTooLong \u2014 2233 significant 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 1733 over it, 4.47\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/interned_types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9344c7630f1983f04ec69d2e4557f6e29b21c7febc6c584eba626628946bdecf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OverridePattern.apply_to_configuration: MethodTooLong \u2014 apply_to_configuration runs 435 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 335 over it, 4.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_configuration/src/overrides.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a75996e5def0feaa890c716a1bdfb15f9ccc586115023d8126a539e13c1b193"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: syntax/list.rs: FileTooLong \u2014 2117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 90 free functions. The bar is 500 significant lines; this is 1617 over it, 4.23\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a0a037442f54065eb7c031e34a14f54e7fa66a9aa15215528777cdb8b69e543"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TypeData: TooManyMethods \u2014 113 methods, declared across 5 files: src/interned_types.rs (58), src/local_inference.rs (44), src/type_transform.rs (7), src/type_relation.rs (3), \u002B1 more file(s). The bar is 30 methods; this is 83 over it, 3.77\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/interned_types.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d9abbea449ac110c972b196b1386e88072b36514a1d47df39d84cb2bbbdc88"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Collector: ClassTooLong \u2014 1490 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 55 methods, 2 blocks, lines 114-2266. The bar is 400 significant lines; this is 1090 over it, 3.73\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_vue_semantic/src/semantic_model/component.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec8eb8da0dd062462210b30cc526b3c1c87649c9d976895e7c71db5c85e505a6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: file_handlers/mod.rs: FileTooLong \u2014 1852 significant 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 1352 over it, 3.70\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a5700ecee571ad87f1bdbd34ef627a13fa7b1e154695aed1976b8b412b241c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_cli::execute::migrate::eslint_to_biome::migrate_eslint_rule: FunctionTooLong \u2014 biome_cli::execute::migrate::eslint_to_biome::migrate_eslint_rule runs 370 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 270 over it, 3.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/biome_cli/src/execute/migrate/eslint_to_biome.rs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"359757049646d3396c3fc0a097cda67f2d26b83e1f7abebcb60f8a94d68fa04c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/settings.rs: FileTooLong \u2014 1819 significant 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 1319 over it, 3.64\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/settings.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44c4ee8c9d05ffb916c5608796dd72b54a79de4782939a3cb7ec718a7f5876b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: semantic_model/component.rs: FileTooLong \u2014 1805 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 83% of them inside a single declaration: Collector (2 blocks, 114-2266). The bar is 500 significant lines; this is 1305 over it, 3.61\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/biome_vue_semantic/src/semantic_model/component.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c195e47a3d487c50c8c7311f6791f437d5d6cc01c461d9d118177fb67dcf1fc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: file_handlers/javascript.rs: FileTooLong \u2014 1582 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 36 free functions. The bar is 500 significant lines; this is 1082 over it, 3.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/javascript.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ae995de8eeb2ec712ef7e4d5c0b0b705ff5e801d6de563143e2a84875d29d8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HtmlRenderer.enter: MethodTooLong \u2014 enter runs 316 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 216 over it, 3.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/biome_markdown_parser/src/to_html.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"88a10202b07bf33a9a127db78319da727f1f478f58c9e9c5da711a57cf751894"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_cli::execute::migrate::migrate_file: FunctionTooLong \u2014 biome_cli::execute::migrate::migrate_file runs 308 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 208 over it, 3.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/execute/migrate.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ba37b92663ff4d4e25e218835cb13521f32a5997806a110004234089a8d499"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: HtmlLexer: ClassTooLong \u2014 1223 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 75 methods, 3 blocks, lines 15-2208. The bar is 400 significant lines; this is 823 over it, 3.06\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_parser/src/lexer/mod.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"3670543129416dfd03d1fc786c25503953facdb1b913270afbfd09e1bc5b8965"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: YamlLexer: ClassTooLong \u2014 1196 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 60 methods, 5 blocks, lines 14-1855. The bar is 400 significant lines; this is 796 over it, 2.99\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/biome_yaml_parser/src/lexer/mod.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b93a78928fc80202f8823a434f152f337fb46e54b68044240e06876c1a3318"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/type_relation.rs: FileTooLong \u2014 1480 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 69% of them inside a single declaration: AssignabilityCheck (2 blocks, 551-2185). The bar is 500 significant lines; this is 980 over it, 2.96\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/biome_js_type_info/src/type_relation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf6dca8cf65f2be3d73cbdfa4de47d9ccbbecdeee9b6ea1c2dbb8d2a7420be3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_service::file_handlers::html::parse_embedded_nodes::parse_embedded_nodes: FunctionTooLong \u2014 biome_service::file_handlers::html::parse_embedded_nodes::parse_embedded_nodes runs 296 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 196 over it, 2.96\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/html/parse_embedded_nodes.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"4901109063d219880781456dc35f85676fb0d79c509ffdbb0ce8bc99963b08fb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: calls/implementation.rs: FileTooLong \u2014 1479 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 37 free functions. The bar is 500 significant lines; this is 979 over it, 2.96\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/queries/type_inference/calls/implementation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49619057fa125299a61f44204ad720134d01b310192720986b6af4b7a90ef9dd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: InferredType: TooManyMethods \u2014 88 methods, declared across 4 files: src/inferred_type.rs (74), inferred_type/any_type_kind.rs (7), inferred_type/boolean_coercion.rs (5), inferred_type/spread_misuse.rs (2). The bar is 30 methods; this is 58 over it, 2.93\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/inferred_type.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"a867f90a1b6655e3052b9e90993f527d8d22a85df4b200bee15baf8bae8b868c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lexer/mod.rs: FileTooLong \u2014 1406 significant 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 906 over it, 2.81\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_parser/src/lexer/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca8a3e91250c61962bd70be17d47c8e930b9e0394be1571770f27d009dbb027d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: syntax/mod.rs: FileTooLong \u2014 1392 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 83 free functions. The bar is 500 significant lines; this is 892 over it, 2.78\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b8634941db4dacfe10c0e5b8937dd344e4d7ad9eaa8e857383b455ea053cfd8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lexer/mod.rs: FileTooLong \u2014 1366 significant 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: HtmlLexer (3 blocks, 15-2208). The bar is 500 significant lines; this is 866 over it, 2.73\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/biome_html_parser/src/lexer/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0fd59477aabaaa43a5821e86fb7d70702723d255cb764fe3691667d5805c210"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lexer/mod.rs: FileTooLong \u2014 1359 significant 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 88% of them inside a single declaration: YamlLexer (5 blocks, 14-1855). The bar is 500 significant lines; this is 859 over it, 2.72\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_yaml_parser/src/lexer/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc44ef998febdafb6a4da0ae881c9f30da2ca3b3e4babeafebdce3886cff4cb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/to_html.rs: FileTooLong \u2014 1352 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 53 free functions. The bar is 500 significant lines; this is 852 over it, 2.70\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/to_html.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b1bf0a7fbbfb585f25236443948d6c48244287d59143b1699ac4eada74fb098"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CliSession.run: MethodTooLong \u2014 run runs 269 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 169 over it, 2.69\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/lib.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc50a7356c499769a16b38f8a581ea33491064a3d21173897fe19672cfb9b70"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: InferredType: ClassTooLong \u2014 1074 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 88 methods, 2 blocks, lines 76-1783. The bar is 400 significant lines; this is 674 over it, 2.69\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/inferred_type.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"9841243d29eabe22ea563b8582359b03a230b236495948fe713e4bf57ef66a48"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SyntaxNode: TooManyMethods \u2014 80 methods. The bar is 30 methods; this is 50 over it, 2.67\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_rowan/src/syntax/node.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"9652dfdfec379907029f8bfbbd4db21956b52b9e0f3b10f06de26f0af1047406"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1326 significant 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 826 over it, 2.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/biome_formatter/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a561f239255a9fc519eb9f11988ba99abcec1ab230b8d0107d671928ed8416e2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/workspace.rs: FileTooLong \u2014 1307 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 807 over it, 2.61\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/workspace.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e8976952f6951d52e2d305e209ee8ca4ae20e0437e9cc92ed00d167c8f6b88"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_configuration_macros::group_struct::generate_group_struct: FunctionTooLong \u2014 biome_configuration_macros::group_struct::generate_group_struct runs 261 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 161 over it, 2.61\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_configuration_macros/src/group_struct.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"04137a35d15863b3cf49d3087a3b334bf9d18694b7f0400f377fa7d01f01158f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UseImportType.action: MethodTooLong \u2014 action runs 260 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 160 over it, 2.60\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_import_type.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"b13abef3658607d4a0e58605d6a5f6c1f96dc3d2692ed5c78639f19460589d64"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: syntax/class.rs: FileTooLong \u2014 1286 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 39 free functions. The bar is 500 significant lines; this is 786 over it, 2.57\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_parser/src/syntax/class.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1efd4e48c5945d8a920ced38ffe24ddede942b5fd0b7f7669bd852319a3346ba"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AssignabilityCheck: ClassTooLong \u2014 1025 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 43 methods, 2 blocks, lines 551-2185. The bar is 400 significant lines; this is 625 over it, 2.56\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/type_relation.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7fc91371fc65811c31c59fea53e375842fb8152451c9ee7f64c29b078917064"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: semantic_model/model.rs: FileTooLong \u2014 1281 significant 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 781 over it, 2.56\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_vue_semantic/src/semantic_model/model.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1add30f11e25ee1c2978224cd48e17fe590bf4dd38f69e60b027212f36ff653a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/visitor.rs: FileTooLong \u2014 1280 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 61% of them inside a single declaration: EmbeddedBindingsBuilder (2 blocks, 442-1644). The bar is 500 significant lines; this is 780 over it, 2.56\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_embeds/src/visitor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a93d6bdd2136bc0f413c6414cd1d14aae09e376cea81bd92ee57e7ee9bfb3752"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/configuration.rs: FileTooLong \u2014 1277 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 777 over it, 2.55\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/configuration.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f855f7cdc2e6cef5accdd82ac2e3f9050deaeb625967fce1a5c061fc662d43b7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: file_handlers/html.rs: FileTooLong \u2014 1273 significant 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 773 over it, 2.55\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/html.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42539cae223a80b234e1828913380928bf23340adae2a6095ea27efe68406b36"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/inferred_type.rs: FileTooLong \u2014 1264 significant 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 85% of them inside a single declaration: InferredType (2 blocks, 76-1783). The bar is 500 significant lines; this is 764 over it, 2.53\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/biome_js_type_info/src/inferred_type.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a9c80d8f02994047151911dd92edbc28feb07d10f3b247135d243a6e5a6b6d2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: HtmlLexer: TooManyMethods \u2014 75 methods. The bar is 30 methods; this is 45 over it, 2.50\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_parser/src/lexer/mod.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0bc64ec6fa517298c2e37daa9cf87b2ac7a59c872a038f396283550cc43dc32"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CssLexer: TooManyMethods \u2014 74 methods. The bar is 30 methods; this is 44 over it, 2.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_parser/src/lexer/mod.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd3070ac95b650a05989b00b9bc0720f52b8d5e0572c5e3c9030536a52f0795"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ListBlockList.fmt: MethodTooLong \u2014 fmt runs 246 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 146 over it, 2.46\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_formatter/src/bullet_list.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"0533f3e562d6c122e7aa5d218b606b0369ce6ac9c76cb9d8272521c36bc1a3dc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lexer/mod.rs: FileTooLong \u2014 1219 significant 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 719 over it, 2.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/biome_css_parser/src/lexer/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcce82160d8a92f7f281cba0f0007e3c66112e34c385d5268393f60d14ad0fbf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_cli::commands::inspect::plugins::inspect_plugins: FunctionTooLong \u2014 biome_cli::commands::inspect::plugins::inspect_plugins runs 239 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 139 over it, 2.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/commands/inspect/plugins/mod.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"da104ab3d09e8c6a328cc578198188f700b825a64a518ececa833f49dbeed346"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_react_compiler::convert_ast::statements::convert_statement: FunctionTooLong \u2014 biome_react_compiler::convert_ast::statements::convert_statement runs 238 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 138 over it, 2.38\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_react_compiler/src/convert_ast/statements.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"45d00311c77f446ecf51f7c84cef2fe464075f10d955bb36c29ad835d284bdbd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UseReactCompiler.diagnostic: MethodTooLong \u2014 diagnostic runs 236 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 136 over it, 2.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_react_compiler.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"98671ed488d37664a1a94511813dd25de19fb9dbdf96c1a09d5679e2d5d14ec6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_ruledoc_utils::analyzer::analyze_rule_code: FunctionTooLong \u2014 biome_ruledoc_utils::analyzer::analyze_rule_code runs 236 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 136 over it, 2.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_ruledoc_utils/src/analyzer.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"449aa00204a488bfa09a98a3b4cb6cb4860c337e24651d34847ab2156003a60e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/rule.rs: FileTooLong \u2014 1176 significant 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 676 over it, 2.35\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_analyze/src/rule.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6635f22d7194b322c72bb060898e52d7042c3e530327a149f0f7e854b815d865"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: nursery/use_logical_properties.rs: FileTooLong \u2014 1163 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 43 free functions. The bar is 500 significant lines; this is 663 over it, 2.33\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_analyze/src/lint/nursery/use_logical_properties.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c083a92e1fd3f5e46eb09652cca6c39309f931e6695058dfb55f03c739ffcb87"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Session: ClassTooLong \u2014 928 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 60 methods, 3 blocks, lines 104-1707. The bar is 400 significant lines; this is 528 over it, 2.32\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/biome_lsp/src/session.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"adbb993a53daf5b0f26eda339c082d8bf1cbeaa81c53f100e15e0e4c0e85e309"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_lsp::handlers::analysis::code_actions: FunctionTooLong \u2014 biome_lsp::handlers::analysis::code_actions runs 231 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 131 over it, 2.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/handlers/analysis.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f65c01776b4d1c755e56b756126d7883fb0374981eb2574cb82597b8b9c1fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/expr_ext.rs: FileTooLong \u2014 1130 significant 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 630 over it, 2.26\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_syntax/src/expr_ext.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5f942d0610a6e4638cb560db6dce0598789752e0ca528f26bb2b67aa85fd2c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: semantic_model/references.rs: FileTooLong \u2014 1104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 604 over it, 2.21\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_vue_semantic/src/semantic_model/references.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"652c9ec2e1d57317b857e265f65feeee1a01c8eb9affacef38da07f650155757"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: syntax/expr.rs: FileTooLong \u2014 1090 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 49 free functions. The bar is 500 significant lines; this is 590 over it, 2.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_parser/src/syntax/expr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95c023d684afc9a2dcffb90e0144a35e642411eee6edddc5aabd2f80a6c9aea6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NamingConventionSelection.selectors: MethodTooLong \u2014 selectors runs 214 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 114 over it, 2.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/execute/migrate/eslint_typescript.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf948925da0ea3047f7c6f6c21efa5eacdf2ab05922b215d300ad48b5927ac8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: WorkspaceServerWithDb: TooManyMethods \u2014 64 methods. The bar is 30 methods; this is 34 over it, 2.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/workspace/server.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d6fd77e94c901cee580b87fcbf6a68f8165367118045029332c875d9ef91077"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArgumentTypeCompatibility.action: MethodTooLong \u2014 action 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/biome_module_graph/src/db/queries/type_inference/calls/implementation.rs"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1dfc2b3f2ea2085ca8b4f89e22482de7cb571652d00a07e36d5ae4b9fbc5e33"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/session.rs: FileTooLong \u2014 1057 significant 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 88% of them inside a single declaration: Session (3 blocks, 104-1707). The bar is 500 significant lines; this is 557 over it, 2.11\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/biome_lsp/src/session.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a10202befbd7090cd5f4b42b4f307b4a7ed59c17f15fc5bba62504e1b845484d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lexer/mod.rs: FileTooLong \u2014 1057 significant 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 557 over it, 2.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/lexer/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f83c5fa60b3d493db1f5854782d4d08e16a1e1a63a8d72d91a9ca105e60e5b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SemanticEventExtractor.enter_identifier_binding: MethodTooLong \u2014 enter_identifier_binding runs 207 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 107 over it, 2.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_semantic/src/events.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d6cfb626e75a2cbb319aaf0a0a8a066fa70e7fc4977b1a129d32b01f882571"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: typescript/types.rs: FileTooLong \u2014 1034 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 60 free functions. The bar is 500 significant lines; this is 534 over it, 2.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_parser/src/syntax/typescript/types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6462ca83296a615f9ebfe7cd97ef33f053a89b4f9ef621735ec1e9989f269a62"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SemanticEventExtractor: ClassTooLong \u2014 818 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 18 methods, 2 blocks, lines 153-1494. The bar is 400 significant lines; this is 418 over it, 2.05\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_semantic/src/events.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ebab7b5b12b3b6084838c851f7839bceb140880c718db650109cce69523417c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: syntax/stmt.rs: FileTooLong \u2014 1022 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 40 free functions. The bar is 500 significant lines; this is 522 over it, 2.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_parser/src/syntax/stmt.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a234df3fbc443fa25dbf459369bfd1e332bef0af5f0a0c0c49791c36daf700f5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: JsLexer: TooManyMethods \u2014 61 methods. The bar is 30 methods; this is 31 over it, 2.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_parser/src/lexer/mod.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a540b6298c77b162ac47831b280622fc77d2b615aca3d1d1723885d74ff577"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MarkdownParser: TooManyMethods \u2014 61 methods. The bar is 30 methods; this is 31 over it, 2.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/parser.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe152fb139c60cbc929ea8b8c0d7028529dda6ca40a2fc78e1739eea9d505cb9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SyntaxNode: TooManyMethods \u2014 61 methods. The bar is 30 methods; this is 31 over it, 2.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_rowan/src/cursor/node.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"307f45ec29535e927134a1b2d99c8b6c939358f9b6936c34241231ccc63fe917"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UseReactFunctionComponentDefinition.action: MethodTooLong \u2014 action 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/biome_js_analyze/src/lint/nursery/use_react_function_component_definition.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"951829efeea84746f1a63701b717190e099ded1371d662574305cc2464ea6468"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DefaultBlockListFormatter.fmt: MethodTooLong \u2014 fmt 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/biome_markdown_formatter/src/markdown/lists/block_list.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d2df16ebd5195cdb4b3eead7a6869761ead6f1c13da4f86b58d3a6245aabc2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_react_compiler::convert_ast::modules::convert_export: FunctionTooLong \u2014 biome_react_compiler::convert_ast::modules::convert_export runs 201 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 101 over it, 2.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_react_compiler/src/convert_ast/modules.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c023a094a0a53fd4059875bef288722a5326a643d4aa1073c2a6e3dec75c38"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/type_data.rs: FileTooLong \u2014 1002 significant 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 502 over it, 2.00\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/type_data.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be95db0b60d3822b74ce4a701424fcd361b8ba34ab3f203cf8ef581300577a94"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Session: TooManyMethods \u2014 60 methods. The bar is 30 methods; this is 30 over it, 2.00\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/session.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd4777820170cc12331833db8bbf44de31f13c558cd28c58ec81965c5116f91"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: YamlLexer: TooManyMethods \u2014 60 methods. The bar is 30 methods; this is 30 over it, 2.00\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_yaml_parser/src/lexer/mod.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"d98682316fdbc568d96b520919d1eb7ec3aef2493c86a74031ef5972f754e05c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: migrate/eslint_to_biome.rs: FileTooLong \u2014 995 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 495 over it, 1.99\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/execute/migrate/eslint_to_biome.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9612c97307fa9804f3966fe9a77d401c248c99cf2a2b6bd248b6b40d4d9e386e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: printer/mod.rs: FileTooLong \u2014 991 significant 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 491 over it, 1.98\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_formatter/src/printer/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"062baace0c548291d9024ee95793b57f529c43dcb5a345f1ffbb26d5ed5b206d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_js_formatter::js::expressions::call_arguments::write_grouped_arguments: FunctionTooLong \u2014 biome_js_formatter::js::expressions::call_arguments::write_grouped_arguments 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/biome_js_formatter/src/js/expressions/call_arguments.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"01852d492407a3976f70c55e37e93b1d5e6514ea616b93d9b34bc0838577658d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MarkdownLexer: TooManyMethods \u2014 59 methods. The bar is 30 methods; this is 29 over it, 1.97\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/lexer/mod.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d7ea62a0dd6a219eea3cd1ad07e4dcab5d4cb5aa226939cdbe847e3cea63c4f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: EmbeddedBindingsBuilder: ClassTooLong \u2014 783 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 40 methods, 2 blocks, lines 442-1644. The bar is 400 significant lines; this is 383 over it, 1.96\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/biome_embeds/src/visitor.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"064f88ed735e159ad105c4078bc58cb9ff36c4f42a7d3114e878de01ff364bb7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/events.rs: FileTooLong \u2014 975 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 84% of them inside a single declaration: SemanticEventExtractor (2 blocks, 153-1494). The bar is 500 significant lines; this is 475 over it, 1.95\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/biome_js_semantic/src/events.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b7213c8f40bb086d9f742333ad75ef1b5c749bacf7572044ffaca62407d911"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: html/parse_embedded_nodes.rs: FileTooLong \u2014 948 significant 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 448 over it, 1.90\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/html/parse_embedded_nodes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d99b1a5c38988df83c5ca64be08ee47c903441e7c016b05daf038aabb67d4874"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: db/mod.rs: FileTooLong \u2014 943 significant 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: WorkspaceDb (8 blocks, 212-1589). The bar is 500 significant lines; this is 443 over it, 1.89\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/biome_service/src/db/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e72eedb675ed89bf810e103ed5937771b41f10550d1dba7878cc9fffdd1a2f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MigrationResults.advices: MethodTooLong \u2014 advices runs 188 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 88 over it, 1.88\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/execute/migrate/eslint_to_biome.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c306fdaf8f7b4f5a7620e60a05e366518acd2ac07db173a09189926e0c49c5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: syntax/mod.rs: FileTooLong \u2014 934 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 35 free functions. The bar is 500 significant lines; this is 434 over it, 1.87\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_parser/src/syntax/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66012b527a0c2cd044a6eae339f748db688dfd0a89c390b618512a2044c20a6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: syntax/svelte.rs: FileTooLong \u2014 929 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 52 free functions. The bar is 500 significant lines; this is 429 over it, 1.86\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_parser/src/syntax/svelte.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5091eeb34809e005b8439fc0202441044986a98ea15c1450ac817884bce10abf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: migrate/eslint_eslint.rs: FileTooLong \u2014 926 significant 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 426 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/biome_cli/src/execute/migrate/eslint_eslint.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7a324fb995953d3aa1710edee379bb8ae7168f94eab112d621fceed5eaccf64"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SemanticModelBuilder.push_event: MethodTooLong \u2014 push_event runs 184 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 84 over it, 1.84\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_semantic/src/semantic_model/builder.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b9663982ed77574af7ffe8b29a4b27f097e9d633e2c6c15409a964bb2619167"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Collector: TooManyMethods \u2014 55 methods. The bar is 30 methods; this is 25 over it, 1.83\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_vue_semantic/src/semantic_model/component.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"52bd32764a55ddcac23460280365432cf5c17cf9396cb5436c20a82585fe5810"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/format_inferred_type_info.rs: FileTooLong \u2014 910 significant 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 410 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/biome_js_type_info/src/format_inferred_type_info.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da663fa5b539fe296bbcafc07c605b9cfa209d0f194c809b62d2dbe6b2971bf0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TypeData: ClassTooLong \u2014 727 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 113 methods, 2 blocks, lines 117-1307. The bar is 400 significant lines; this is 327 over it, 1.82\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/biome_js_type_info/src/interned_types.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e9c610e59b4554253b1baa79d55be2431572025a783a84510d68db799a22c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/semantic_class.rs: FileTooLong \u2014 902 significant 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 402 over it, 1.80\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/services/semantic_class.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc5889a675f6bfe4ad67a6d4f0d02408b5a3ee7591350d4b0f911502dcc3d375"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: correctness/use_exhaustive_dependencies.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/biome_js_analyze/src/lint/correctness/use_exhaustive_dependencies.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ebfe35ca53ef9e9d5df06873759fce5ba3e5291c9c57587f7af77115ed3d8d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeMember.from_any_js_class_member: MethodTooLong \u2014 from_any_js_class_member runs 177 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 77 over it, 1.77\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/local_inference.rs"},"region":{"startLine":2195}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f849d7013ef1f0fe646543b916f514efeff8b735363bd54ffce60986cbda78b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FormatYamlBlockMapExplicitEntry.fmt_fields: MethodTooLong \u2014 fmt_fields runs 177 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 77 over it, 1.77\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_yaml_formatter/src/yaml/auxiliary/block_map_explicit_entry.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bbe64e3dca45721f9774c366fa4a7df93b5e0862fcc2a6d3dcb4e2517216083"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OrganizeImports.action: MethodTooLong \u2014 action 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/biome_js_analyze/src/assist/source/organize_imports.rs"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd1436e8a054d9cef401615950d7545fdea7899f291cb5c1b2ee7651e1aaa93f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cursor/node.rs: FileTooLong \u2014 874 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 374 over it, 1.75\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_rowan/src/cursor/node.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e90807df103e1ae61f2ac2744d1c6d5db579409d3ab3149539cd2c66a9aa5e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expressions/call_arguments.rs: FileTooLong \u2014 855 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 355 over it, 1.71\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/js/expressions/call_arguments.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"758ecdcff75de0b5f910651191023aefad15eaad3156c4eced28130447b4702d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RageConfiguration.fmt: MethodTooLong \u2014 fmt runs 171 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 71 over it, 1.71\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/commands/rage.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbf34235dbaf5c5bf4d1d260566f598e02cac5d2c584a19e460080c2bebe4845"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_cli::runner::impls::finalizers::default::print_to_reporter: FunctionTooLong \u2014 biome_cli::runner::impls::finalizers::default::print_to_reporter runs 171 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 71 over it, 1.71\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/runner/impls/finalizers/default.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"eebf5d00cd14573c53b5f66ea249ab0193c7ff5f0a94478504c49ee0430d94c0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Printer.print_element: MethodTooLong \u2014 print_element 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/biome_formatter/src/printer/mod.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aff6f3812617b674bbbcda0c37461e168a6aefc965a9bab63d4947ec3bd6a31"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InferredType.is_promise_instance_with: MethodTooLong \u2014 is_promise_instance_with 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/biome_js_type_info/src/inferred_type.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"96157539c509d46643275e80a9dada467bf24ae5960dbfb8e4b011a9c71f4f48"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/builders.rs: FileTooLong \u2014 848 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 38 free functions. The bar is 500 significant lines; this is 348 over it, 1.70\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_formatter/src/builders.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca20410db2bd488856819ac34bb4a58d474b6f1da17d1884757303163be0addc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: convert_ast/expressions.rs: FileTooLong \u2014 847 significant 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 347 over it, 1.69\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_react_compiler/src/convert_ast/expressions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5205cc4a95e136c05608f2492a8edede7fdf161ee06a8b12f856fe685e42a8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: type_inference/promise_classification.rs: FileTooLong \u2014 845 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 345 over it, 1.69\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/type_inference/promise_classification.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c5c6614f64bba19ea6d400678a671c7a23b0ee8b3abda20435b59c3c61fa9fc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: JsFormatOptions: TooManyMethods \u2014 50 methods. The bar is 30 methods; this is 20 over it, 1.67\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/context.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"be16c6c2671e88bbccdb69220e200fa64c6f89fdd47fd9fd9f6b2b4d2ae78c5c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 831 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 34 free functions. The bar is 500 significant lines; this is 331 over it, 1.66\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_resolver/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b25b25c847cf01e09f5c50029230e4ce4a1368d4cb03ac7989285646cadbdc53"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeofExpression.fmt: MethodTooLong \u2014 fmt runs 165 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 65 over it, 1.65\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/format_type_info.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"807ebd5f34282a5127958d5f601cbe46a909fab75e52e2ed2680de87b67e6303"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeData.from_any_js_expression: MethodTooLong \u2014 from_any_js_expression runs 165 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 65 over it, 1.65\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/local_inference.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e9ae162c2e6aedc807b461fb43e01630f49b7aedcf2712105f0ae3ed212fdd5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/format_type_info.rs: FileTooLong \u2014 821 significant 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 321 over it, 1.64\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/format_type_info.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc8daa87886bb9fc2230118b409a1d39e5c48383bb418ac25a997f50ed7d18b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: biome_js_parser::syntax::js_parse_error: TooManyFunctions \u2014 49 free functions. The bar is 30 free functions; this is 19 over it, 1.63\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/biome_js_parser/src/syntax/js_parse_error.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f61f9c55730af8d892a621508d518fbdd1a61fda5c9c170c6aa471ababbd1d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_service::file_handlers::html::parse_embedded_nodes::parse_matched_embed: FunctionTooLong \u2014 biome_service::file_handlers::html::parse_embedded_nodes::parse_matched_embed runs 163 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 63 over it, 1.63\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/html/parse_embedded_nodes.rs"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee8a25049d67d53cc6d6660052bfbc6b1bcec8c3829faac537b25252461eb711"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utils/assignment_like.rs: FileTooLong \u2014 810 significant 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 310 over it, 1.62\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/utils/assignment_like.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e8d5d08422ed3eb50d9c25af5ac97f00101ca16137d3a61ef328cd0a550c4d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/words.rs: FileTooLong \u2014 808 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 308 over it, 1.62\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_formatter/src/words.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3bd8662be0b909f9815a81dec62d9ff750161685c093bcab23da47a2cb3f007"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GritLexer: ClassTooLong \u2014 646 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 19 methods, 3 blocks, lines 15-1045. The bar is 400 significant lines; this is 246 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/biome_grit_parser/src/lexer/mod.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8073f32c41d63898efc332a857c45e88e8b0a1e1c3cd294a79ac5a83a413044"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: WorkspaceDb: TooManyMethods \u2014 48 methods, declared across 2 files: db/mod.rs (47), db/parse.rs (1). The bar is 30 methods; this is 18 over it, 1.60\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/db/mod.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee89a303f8bb15256bda7bbe10f5cdc4d03975dafbcf9ecad8cb8fd3dea07b8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: file_handlers/css.rs: FileTooLong \u2014 799 significant 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 299 over it, 1.60\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/css.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e30ec188153b342b42f2c601a5716d944c74b8c772b3269cd469ba8b86a7c7e5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rules_check::check_rules: FunctionTooLong \u2014 rules_check::check_rules runs 158 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 58 over it, 1.58\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/rules_check/src/lib.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f041c249849ec237e0ed0d2a70be480c8b44c954f2cd09c60a578198fcc34d3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: analyzer/mod.rs: FileTooLong \u2014 785 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 285 over it, 1.57\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_configuration/src/analyzer/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d35a553b7d1bffaeac011268b4cfa17d9addd12fe0f761c297fae70849926d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lists/inline_item_list.rs: FileTooLong \u2014 785 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 75% of them inside a single declaration: FormatMdInlineItemList (4 blocks, 207-1237). The bar is 500 significant lines; this is 285 over it, 1.57\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_formatter/src/markdown/lists/inline_item_list.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea8cd066807bd6612f61b90e562a7efa1bab940ae8fa0258d743633a1aca279"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NoUnusedImports.action: MethodTooLong \u2014 action runs 157 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 57 over it, 1.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/no_unused_imports.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"065724f9ce15c30359b709d7a7fbc5b9998b668f7673dac1eb41ecb75001fe79"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_lsp::handlers::analysis::fix_all: FunctionTooLong \u2014 biome_lsp::handlers::analysis::fix_all runs 157 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 57 over it, 1.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/handlers/analysis.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"dedd8613332623a0d4ba68b81c6acf14d5af7c55a706d8e5ddef08550073a997"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Component: TooManyMethods \u2014 47 methods. The bar is 30 methods; this is 17 over it, 1.57\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_vue_semantic/src/semantic_model/model.rs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"57dbce13257d7a6b58b3652abca217bbe0a93f2696f7b2c75116ee5bc9bb3120"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parentheses/expression.rs: FileTooLong \u2014 782 significant 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 282 over it, 1.56\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_syntax/src/parentheses/expression.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ac684db053c422dcb0edffacc0183bbfd2de938f0b949574f26cc801bf0738"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_service::workspace_types::instance_type: FunctionTooLong \u2014 biome_service::workspace_types::instance_type 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/biome_service/src/workspace_types.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"67abc7157c6418da2c7c5364e08be9129789f81e43cf0ea73a355966cf9f78a7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/comments.rs: FileTooLong \u2014 777 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 32 free functions. The bar is 500 significant lines; this is 277 over it, 1.55\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/comments.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b29253cb7ba24cf3f3931a7bda36469c47f98a117548df050da2205c1277ca6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WorkspaceDb: ClassTooLong \u2014 620 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 48 methods, 8 blocks, lines 212-1589. The bar is 400 significant lines; this is 220 over it, 1.55\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/biome_service/src/db/mod.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"301a04a53d3000d64f0348e4832412776c824a9d29e3580c7bc3761ac4c337d9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: syntax/module.rs: FileTooLong \u2014 775 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 37 free functions. The bar is 500 significant lines; this is 275 over it, 1.55\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_parser/src/syntax/module.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0934b0b4a1f6712d711c8a92c101ccef82ee0168d5d71570bfafa6043ea4c60c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeofExpression.fmt: MethodTooLong \u2014 fmt runs 155 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 55 over it, 1.55\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/format_inferred_type_info.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f51df9d0190a19f2f147a4d2b37bba30a6693662a8bbb90d5846f804ae0ffea"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: style/use_unified_type_signatures.rs: FileTooLong \u2014 771 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 271 over it, 1.54\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_unified_type_signatures.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fef8a445af632cd21c19ce858d206ff7c350cbc02fbcb090d244701f915aac2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_deserialize_macros::deserializable_derive::generate_deserializable_struct: FunctionTooLong \u2014 biome_deserialize_macros::deserializable_derive::generate_deserializable_struct runs 154 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 54 over it, 1.54\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_deserialize_macros/src/deserializable_derive.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a3312baa85d350c8ede560ee2aad9288af292d2d81394e06ea26e5b7f4bc58"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArrowChain.fmt: MethodTooLong \u2014 fmt runs 154 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 54 over it, 1.54\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/js/expressions/arrow_function_expression.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e7e6fa80a913b9988764ddca9a169aeb4a3d2b2fb75c3ef7ad1f720607977e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/bullet_list.rs: FileTooLong \u2014 765 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 265 over it, 1.53\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_formatter/src/bullet_list.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9a85c6c6156d0090d0931aeafff8f91d0f1d7591fc696749acaf7ac43b364fa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/parser.rs: FileTooLong \u2014 761 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 261 over it, 1.52\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/parser.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f002ee64d31a52bcf8ce14985c734d53e9ee3dc33ff9a50ae03096611147999"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: file_handlers/json.rs: FileTooLong \u2014 759 significant 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 259 over it, 1.52\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/json.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"821dc8e0aac12f67df2cc4a0d41fba0d92c5ab668fd2107b1e21d5ab3b886c68"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: type_inference/resolver.rs: FileTooLong \u2014 756 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 79% of them inside a single declaration: ResolutionCtx (2 blocks, 223-1150). The bar is 500 significant lines; this is 256 over it, 1.51\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/type_inference/resolver.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3965eff7832cd98d82940427c2a1efbbfaf0be4d139633229eae6933a035360"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RuleMover.action: MethodTooLong \u2014 action runs 151 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 51 over it, 1.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_migrate/src/analyzers/rule_mover.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"d495fbb5567e0d83a68c9f532b1eb7cbd5bbd4843108ca975cfe1eda6f11f65c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: nursery/use_string_starts_ends_with.rs: FileTooLong \u2014 752 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 40 free functions. The bar is 500 significant lines; this is 252 over it, 1.50\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_string_starts_ends_with.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e60a4081fca2b5c18b7e644fed323cce755376dbb49893030c8f9c0a806115bd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: style/use_import_type.rs: FileTooLong \u2014 752 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 62% of them inside a single declaration: UseImportType (167-776). The bar is 500 significant lines; this is 252 over it, 1.50\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/biome_js_analyze/src/lint/style/use_import_type.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a5321e6f74321be262fd2bb9d1bcd3981a2265336fbe3ae7558f7bbb63b81be"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CssScanCursor: TooManyMethods \u2014 45 methods, declared across 2 files: lexer/scan_cursor.rs (42), scan_cursor/url.rs (3). The bar is 30 methods; this is 15 over it, 1.50\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_parser/src/lexer/scan_cursor.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a34152ce3fcf3687469bb62657c44f0edd42e78bca1aef6483180ad27d7a48"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_diagnostics::display::frame::print_frame: FunctionTooLong \u2014 biome_diagnostics::display::frame::print_frame runs 150 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 50 over it, 1.50\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_diagnostics/src/display/frame.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"23638c9829675d55395c96c4ae32695bae13df10da58f13be6f6604201ddf6e9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_js_analyze::lint::suspicious::no_useless_regex_backrefs::run: FunctionTooLong \u2014 biome_js_analyze::lint::suspicious::no_useless_regex_backrefs::run runs 150 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 50 over it, 1.50\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/no_useless_regex_backrefs.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"c46f154daef0837cfcb701934f608b7df1b2a4bbd498f97a459fac37df909abf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeData.from_raw_with_member_resolver: MethodTooLong \u2014 from_raw_with_member_resolver runs 150 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 50 over it, 1.50\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/interned_types.rs"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d645b514ecda0cb7b48c9b52494ce92caa0ae0f89794ad8bbf298a5661a79d6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: syntax/function.rs: FileTooLong \u2014 745 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 245 over it, 1.49\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_parser/src/syntax/function.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"147272ba340e78f18afd503af20e48feafa7dc6e7c940e8e6ca460b396ac07e5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ResolutionCtx: ClassTooLong \u2014 594 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 148 methods, 2 blocks, lines 223-1150. The bar is 400 significant lines; this is 194 over it, 1.49\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/type_inference/resolver.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"b47550490880cb2ac0c45c88187d7d8e7ed9e129ecd2ccb0c0659d2c5f3f27cf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FitsMeasurer.fits_element: MethodTooLong \u2014 fits_element 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/biome_formatter/src/printer/mod.rs"},"region":{"startLine":1289}}}],"partialFingerprints":{"codehealthFindingId/v1":"652162a1d74238ca65bc5c999af02e1b17f3932675be53673e4d107986fb6f81"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_syntax_codegen::generate_node_factory::generate_node_factory: FunctionTooLong \u2014 biome_syntax_codegen::generate_node_factory::generate_node_factory 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/biome_syntax_codegen/src/generate_node_factory.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b1b6ebd479fc10e4858ffa12d6106769f3878ecb8df56c328c51ae3bff3e64"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FormatMdInlineItemList: ClassTooLong \u2014 590 significant 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, 4 blocks, lines 207-1237. The bar is 400 significant lines; this is 190 over it, 1.48\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_formatter/src/markdown/lists/inline_item_list.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd62a6091129c9dc1d114a3076daa228cb068efc2cd5c7ea7e6c20e962826598"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: complexity/use_optional_chain.rs: FileTooLong \u2014 735 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 235 over it, 1.47\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/complexity/use_optional_chain.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd4b167488e724d57033f1a71950a43dd7f1dc130878d930b16225efd825622"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Session.load_biome_configuration_file_internal: MethodTooLong \u2014 load_biome_configuration_file_internal runs 147 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 47 over it, 1.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/session.rs"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8df5e959e05e4595a7fa44d7c0d7142ce4a241db512c1447bb78da1368dd384"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ResolutionCtx.resolve_static_member_expression: MethodTooLong \u2014 resolve_static_member_expression runs 147 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 47 over it, 1.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":1646}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ac757d0e888ca12e6efa9d2b0e048a5978a15abb748929962348b1587da176"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_module_graph::db::type_inference::lookup::find_member_key_type_with_resolver: FunctionTooLong \u2014 biome_module_graph::db::type_inference::lookup::find_member_key_type_with_resolver runs 147 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 47 over it, 1.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/type_inference/lookup.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ab2d278f7ba8873fdd83a7509103372631c873454c38e55f4b119e8f6fa513"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: JsFileSource: TooManyMethods \u2014 44 methods. The bar is 30 methods; this is 14 over it, 1.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_languages/src/javascript.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f129cd868c0e00a4eb27d30755396d2686dc05b9c71de0fd32dff2dc5fe3122"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SyntaxToken: TooManyMethods \u2014 44 methods. The bar is 30 methods; this is 14 over it, 1.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_rowan/src/syntax/token.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca7ca3349087d552dcf6173a123c62d132b95777ad24177490c1e1173aae1558"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GritResolvedPattern: ClassTooLong \u2014 585 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 3 methods, 3 blocks, lines 24-801. The bar is 400 significant lines; this is 185 over it, 1.46\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/biome_grit_patterns/src/grit_resolved_pattern.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c67ff20a5b478c5ffac20433db7727a9518f0963801c9b9c8904ac1026fef35"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: type_inference/imports.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 61% of them inside a single declaration: ResolutionCtx (333-1037). 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/biome_module_graph/src/db/type_inference/imports.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"339b83c41057ef3d753f17350abb64378c4cb34da840ff63627b5144d0ffc92b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: type_inference/lookup.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). The bar is 500 significant lines; this is 221 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/biome_module_graph/src/db/type_inference/lookup.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e914c7485380b3ec4d78f64d05ae0c6cc0052325095bcc308ff3405acbe9b4f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NoUselessFragments.run: MethodTooLong \u2014 run runs 144 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/complexity/no_useless_fragments.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a7e91c54a5aa38c2fb38804aaeb3879d10f601ae9c4f62b65723814e4c1585"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AssignabilityCheck: TooManyMethods \u2014 43 methods. The bar is 30 methods; this is 13 over it, 1.43\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/type_relation.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"025162e35f3fb273f271d955cefe5d8e9bd1d4275b55ad684e6ebce27b388870"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: type_inference/profiling.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/biome_module_graph/src/type_inference/profiling.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f29a0abdcdbdb6a7e2639d18cfc29a3f23fe0303d6650d0ae72d46b90e6de8b7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: semantic_model/model.rs: FileTooLong \u2014 706 significant 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 206 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/biome_css_semantic/src/semantic_model/model.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"30877681360ebf36a4423aa110e39467e0943e1430aba0aeab1ba7cce74731aa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeData.from_any_ts_type: MethodTooLong \u2014 from_any_ts_type 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/biome_js_type_info/src/local_inference.rs"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"e86f7ebbfa7af2e5f576014dbd41b5e490316d3a45629ec9c3610f473f9e2aca"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_service::file_handlers::html::fix_all: FunctionTooLong \u2014 biome_service::file_handlers::html::fix_all 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/biome_service/src/file_handlers/html.rs"},"region":{"startLine":1366}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f6676ef04d0ef3412a3f36c096a906d84affa4d6217a52dd34a49972401f42"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_service::file_handlers::css::fix_all: FunctionTooLong \u2014 biome_service::file_handlers::css::fix_all runs 140 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/css.rs"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"5abb411106c8b210e93170e9724ae9d3a0d5d9a82d3812e1b3fa010b264f41ef"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: js_module_info/collector.rs: FileTooLong \u2014 699 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 78% of them inside a single declaration: JsModuleInfoCollector (3 blocks, 49-895). The bar is 500 significant lines; this is 199 over it, 1.40\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/js_module_info/collector.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d8e4c8d1cee78fc5d0a38335ddac69a8904741b4eadec97e87be9b54ea7134"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_vue_semantic::semantic_model::references::collect_markup_references: FunctionTooLong \u2014 biome_vue_semantic::semantic_model::references::collect_markup_references runs 139 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 39 over it, 1.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_vue_semantic/src/semantic_model/references.rs"},"region":{"startLine":1249}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf309979fc64d486316db2ffc460696171823101fce7b054906b93914667b09"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lexer/mod.rs: FileTooLong \u2014 694 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 93% of them inside a single declaration: GritLexer (3 blocks, 15-1045). The bar is 500 significant lines; this is 194 over it, 1.39\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_parser/src/lexer/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e06a65226141c38bfb0e5b2db8399ec9fe9b394f1576d487c45de856f3549ec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/generate_nodes.rs: FileTooLong \u2014 693 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 193 over it, 1.39\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_syntax_codegen/src/generate_nodes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"582fa54d3f642d739f1ae958f5d99d81338268e03d878decab2f8fc1652db22e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AriaRoles.get_implicit_role: MethodTooLong \u2014 get_implicit_role runs 137 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 37 over it, 1.37\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_aria/src/roles.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9e20e6cdf055f05097644c7bf6093fc512404f6de62f3df25155cf34824b77c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ResolutionCtx.resolve_qualifier: MethodTooLong \u2014 resolve_qualifier runs 137 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 37 over it, 1.37\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/type_inference/qualifiers.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a0aa51c5c61b3a284a8b32648209f95ecdaeb509aa506b656f64ceeab36b4e8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: VueSemanticModel.fmt: MethodTooLong \u2014 fmt runs 137 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 37 over it, 1.37\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_vue_semantic/src/format_semantic_model.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ad6d9038d0e27c158b898c2ec9548edfb65d91812923f0ffae8a51d840154ed"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: StatementStack: TooManyFields \u2014 41 stored fields beside 3 methods. The bar is 30 stored fields; this is 11 over it, 1.37\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/biome_js_control_flow/src/visitor.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f3b063ebc2220347bfed4857b9372d9c6f8749dad15dd960e83ee7315a17f2c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: JsModuleInfoCollector: ClassTooLong \u2014 545 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 26 methods, 3 blocks, lines 49-895. The bar is 400 significant lines; this is 145 over it, 1.36\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/js_module_info/collector.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a05e1cbf88813439ca4b273f78bf544737a5422a369332a083ac8579fbcf1ea"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: nursery/use_nullish_coalescing.rs: FileTooLong \u2014 680 significant 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 180 over it, 1.36\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_nullish_coalescing.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8be7363f90ae09d17ea2241a1058b0b436a751e1c29fa62b5099c7744901c1d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SemanticEventExtractor.enter: MethodTooLong \u2014 enter runs 136 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_semantic/src/events.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de8a98439c072bb473579187b0a2fc2f8631bba273c870ab979922425616e7e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_tailwind_logic::use_tailwind_shorthand_classes::analyze_tailwind_shorthand: FunctionTooLong \u2014 biome_tailwind_logic::use_tailwind_shorthand_classes::analyze_tailwind_shorthand runs 136 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_tailwind_logic/src/use_tailwind_shorthand_classes.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ddb900fab4c1d4902dad87fb4c9fbf36ba91f135c03f8e779f28b904d5d9b9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: nursery/use_consistent_boolean_name.rs: FileTooLong \u2014 678 significant 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 178 over it, 1.36\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_consistent_boolean_name.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc5f68875629f7e22a19a45db20418cf753788507bad73fdd265a7613768e2e7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lists/element_list.rs: FileTooLong \u2014 676 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 176 over it, 1.35\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_formatter/src/html/lists/element_list.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d539520a69f2f570c76de230db279ee8703b281b0ee5642266de54993bc69ac7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeDataSlotReplacements.rebuild: MethodTooLong \u2014 rebuild runs 135 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 35 over it, 1.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/interned_types.rs"},"region":{"startLine":1667}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c37064add3393ea42ea9e0e9d68ad0c5755e339db63602812ec0fdfd7d5a0f5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_react_compiler::convert_ast::expressions::convert_object_member: FunctionTooLong \u2014 biome_react_compiler::convert_ast::expressions::convert_object_member runs 135 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 35 over it, 1.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_react_compiler/src/convert_ast/expressions.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f9808918be918736ff923c4957a43e379765156f072c833902e6e1feb79e99"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/comments.rs: FileTooLong \u2014 674 significant 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 174 over it, 1.35\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_formatter/src/comments.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef12792d99617b4ee2319169b613cf1ebec4428fa89d5a44c133fb7d44eb22c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ResolutionCtx.resolve_new_expression: MethodTooLong \u2014 resolve_new_expression 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/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ce11196b6d4aeede9f9f23f241e8ab8af8ee8ad4bcb4fe2482458362b5fe69"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EmbeddedBindingsBuilder: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\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/biome_embeds/src/visitor.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"d77b251a2c384de701ee0355b2b3d1fd8dda977a26ff477fe49d7a07fdf8c3b4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UseImportType.run: MethodTooLong \u2014 run runs 133 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_import_type.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dde81858508bf4e17b856e74c89e5335483b3e0f1711814e93f563e06240b6e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: JsPluginApi.create_module: MethodTooLong \u2014 create_module runs 132 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_runtime/src/plugin_api.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"15974d1b1e563b23ea3efe279e0b44852c548c44bf42e52f49786fb80f5d1ce8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TsBindingReference.union_with: MethodTooLong \u2014 union_with runs 132 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_semantic/src/semantic_model/binding.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"a745b23f0bdd49c95062cf8408f956d048ae737f2294aa423bc5170ba2f4aecd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: use_tailwind_sorted_classes/sort_v4.rs: FileTooLong \u2014 658 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 158 over it, 1.32\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_tailwind_logic/src/use_tailwind_sorted_classes/sort_v4.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4eb36a79dab6a21778c0e359e65af078d5d6c9f0c6af66a57939bc89db80685"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 657 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 157 over it, 1.31\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_configuration/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a825fc40e504ca48dade1381f8176c38e88e56d0ea9c9925a8477d7f301d3b37"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Rules.deserialize: MethodTooLong \u2014 deserialize runs 131 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/execute/migrate/eslint_eslint.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cc197786b2c02ddd1fcde6d55d1271ccb61edcf95b31a0ad0067672747a9821"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_formatter::format_range: FunctionTooLong \u2014 biome_formatter::format_range runs 131 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_formatter/src/lib.rs"},"region":{"startLine":2021}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee401c74e9ea4202c82f71e5b336f2f45d0a10e329770c797051434121e5ae01"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AssignabilityCheck.is_assignable: MethodTooLong \u2014 is_assignable runs 131 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/type_relation.rs"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"e143359acd15281c5f5b9e325e17c8eb4777fb1f728c9595c61d7f5c66379d41"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_markdown_parser::syntax::parse_any_block_with_indent_code_policy: FunctionTooLong \u2014 biome_markdown_parser::syntax::parse_any_block_with_indent_code_policy runs 131 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/mod.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"62de47c587316244412ec2d36f578be414cefb1f2058ab647f81d8a4008c0571"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: file_handlers/md.rs: FileTooLong \u2014 654 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 154 over it, 1.31\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/md.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e71008a12af03d016b544376b5cbd73cd86a8c142ebfdd0afe796dde13c70f7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: biome_tailwind_parser::syntax::css_value: TooManyFunctions \u2014 39 free functions. The bar is 30 free functions; this is 9 over it, 1.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_tailwind_parser/src/syntax/css_value.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"781fbfeeb33d912b3918fdf544d37ad01c2ff78cba01f70a4c781a9777848df3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DefaultCollector.run: MethodTooLong \u2014 run runs 129 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 29 over it, 1.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/runner/impls/collectors/default.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b41d415eabca0629152891bc80a1da15c8b5ce1fb5eeb8a0ff3def3496437b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_css_parser::syntax::at_rule::parse_any_at_rule: FunctionTooLong \u2014 biome_css_parser::syntax::at_rule::parse_any_at_rule runs 129 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 29 over it, 1.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_parser/src/syntax/at_rule/mod.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"575b86d2656adea6eae0f27a54f48aed418ed9c2765ef78f645e1e51fd19a33c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ResolutionCtx.resolve_flow_expression: MethodTooLong \u2014 resolve_flow_expression runs 129 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 29 over it, 1.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/type_inference/flow_expressions.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb26d6c2c87eb1681bb370dcab0e833f984aa5ef96df7e9fa6b4991972fc261f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: convert_ast/statements.rs: FileTooLong \u2014 644 significant 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 144 over it, 1.29\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_react_compiler/src/convert_ast/statements.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de70063e0c75dce232cc1e7c0cff944d77eb84ba93aa3cbc8a017e04e8e05ea"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FormatJsxChildList.fmt_children: MethodTooLong \u2014 fmt_children runs 128 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/jsx/lists/child_list.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ff0fdb06636f86a201507a5e153dc23100f2e0e0af06eac43ea10e08fe0c48"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_service::file_handlers::html::parse_embedded_nodes::parse_svelte_blocks: FunctionTooLong \u2014 biome_service::file_handlers::html::parse_embedded_nodes::parse_svelte_blocks runs 128 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/html/parse_embedded_nodes.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebeac5160b872bc6ee4bbbfb18a62536c0ddb888a0229917161e1b100660ab56"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: display/compact.rs: FileTooLong \u2014 639 significant 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 139 over it, 1.28\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/type_inference/profiling/display/compact.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f6f9df961cebba3264954d72d08f9a52bc75b08b9af260cf367eba530c4209"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Printer: ClassTooLong \u2014 508 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 15 methods, 2 blocks, lines 35-891. The bar is 400 significant lines; this is 108 over it, 1.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_formatter/src/printer/mod.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"e504841d37a24a9eede46ee3ce93ba643724dfce9fa4a0216e2c146d5b2491cc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_js_analyze::lint::nursery::use_consistent_boolean_name::expressions_state: FunctionTooLong \u2014 biome_js_analyze::lint::nursery::use_consistent_boolean_name::expressions_state runs 127 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_consistent_boolean_name.rs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b428601fe7947a0773f2670c2c2b6e3732fa1c69f53688d65350f35aed0c235"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_markdown_parser::syntax::list::check_continuation_indent: FunctionTooLong \u2014 biome_markdown_parser::syntax::list::check_continuation_indent runs 127 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":2733}}}],"partialFingerprints":{"codehealthFindingId/v1":"5465931fa8c1fff6f4e7415013364c34c5eac0a9080494f096135901b0e764f7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: type_inference/qualifiers.rs: FileTooLong \u2014 633 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 98% of them inside a single declaration: ResolutionCtx (18-874). The bar is 500 significant lines; this is 133 over it, 1.27\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/biome_module_graph/src/db/type_inference/qualifiers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc64a53e2250562c9764d0933d30b9a78321fa8f554d6efdd7efa0567b582b2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: HtmlRenderer: ClassTooLong \u2014 505 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 10 methods, 2 blocks, lines 523-1288. The bar is 400 significant lines; this is 105 over it, 1.26\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/to_html.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"3175362eb0aa2cff18d74f646f5dd0664c5675f4796287693de631dac7f3d062"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 631 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 131 over it, 1.26\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_analyze/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a462eaa99760e57a4eeb3179f67da01abe6017a56520c615f4832fa2101cbd8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: syntax/mod.rs: FileTooLong \u2014 631 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 43 free functions. The bar is 500 significant lines; this is 131 over it, 1.26\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_parser/src/syntax/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"881d92c2f66434f0e522e76de57f80679ebdb68f95e1b519f7775ed44a15a347"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: App.App: FunctionTooLong \u2014 App runs 126 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/prettier-compare/src/components/App.tsx"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9cfaf81ab32c3a48b1a51dc13e36633a1a8fbd379d86748f3e3ebaea5331952"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/no_restricted_imports.rs: FileTooLong \u2014 629 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 129 over it, 1.26\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_rule_options/src/no_restricted_imports.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c4d2a4b9acfec8a6dcb689c2787deac828923e87f2917caf528934c2b8ed5da"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: nursery/no_useless_spread.rs: FileTooLong \u2014 626 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 126 over it, 1.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_useless_spread.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bec8bd9474b3e1552b83ae12a0120922149b7bb7b1c3e4fe78b2be89ba88d97"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SemanticModelBuilder.push_event: MethodTooLong \u2014 push_event runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_semantic/src/semantic_model/builder.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb14f0006901af39f8e0be39c63e29d3e6c9a5b459a51bce962d4f03ec3cd449"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_service::file_handlers::html::lint_with_inspector: FunctionTooLong \u2014 biome_service::file_handlers::html::lint_with_inspector runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/html.rs"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f77e1c6b5bcdedc72179344faf44837ab621642d3df64262bc1079385f1ee8e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/overrides.rs: FileTooLong \u2014 622 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 76% of them inside a single declaration: OverridePattern (2 blocks, 35-631). The bar is 500 significant lines; this is 122 over it, 1.24\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/biome_configuration/src/overrides.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9fe4460f0fcd789b235214a21f6805b1f706f04cb8ae12105faff1072d5ff08"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/grit_resolved_pattern.rs: FileTooLong \u2014 621 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 94% of them inside a single declaration: GritResolvedPattern (3 blocks, 24-801). The bar is 500 significant lines; this is 121 over it, 1.24\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/biome_grit_patterns/src/grit_resolved_pattern.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0932233154f1747c3ee83ec6f5514cc43208e1564e97179d3ebe19cad4b21eb"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ConfigurationExtendsLoader: ClassTooLong \u2014 496 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 17 methods, 2 blocks, lines 647-1346. The bar is 400 significant lines; this is 96 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/biome_service/src/configuration.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d83ff8e1924bbf70a1f8c97f05d7932a606d4a3179e5d208daa547a4b1e7ae"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/patterns.rs: FileTooLong \u2014 620 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 46 free functions. The bar is 500 significant lines; this is 120 over it, 1.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_parser/src/parser/patterns.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab47a5fda40f2d56c3104bd7839fccabd921a330c2aa256cd965ec51bc876cdf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/impls.rs: FileTooLong \u2014 617 significant 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 117 over it, 1.23\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_deserialize/src/impls.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b05228105618dc69e8e6886fd84c0e0d7a4f4a37c307dcd725cda554ddf7c5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/server.rs: FileTooLong \u2014 617 significant 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 117 over it, 1.23\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae83bf4d1ac2e8969085c754de8173ddd38378b198bd07518b50dd8d811f193"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FormatHtmlElement.fmt_inner: MethodTooLong \u2014 fmt_inner runs 123 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_formatter/src/html/auxiliary/element.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad18a7c37ee29bfcaf05ab6f881b14ddc0a9453a0b0b776cf228a493aebfeff8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_js_analyze::ast_utils::is_constant_condition: FunctionTooLong \u2014 biome_js_analyze::ast_utils::is_constant_condition runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/ast_utils.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b96132256557136fd7c3333680ed0f2e92b2a258236b17802c533bf0941c24"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UseExportType.action: MethodTooLong \u2014 action runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_export_type.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b60314f2296036761f0ce53e525d3c8b50805c9b6a06ff41bdc49e6f777310f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ResolutionCtx.resolve_typeof_expression: MethodTooLong \u2014 resolve_typeof_expression runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad17024cccaae3ecce6caeb870ceb7c92530c36df06d0d081eafe1ff6079f8bf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: no_misleading_return_type/analysis.rs: FileTooLong \u2014 609 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 31 free functions. The bar is 500 significant lines; this is 109 over it, 1.22\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_misleading_return_type/analysis.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22bc0ecbbe42520a52272c83eb9b85040e9e7101e47edd776cf707890b34a942"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: style/use_naming_convention.rs: FileTooLong \u2014 609 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 109 over it, 1.22\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_naming_convention.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdbdf32b931369bf9070ba23d3ddb1ccb0584f1cd5dea79e4e60fb45c3616dca"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: syntax/node.rs: FileTooLong \u2014 608 significant 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 108 over it, 1.22\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_rowan/src/syntax/node.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"329bd948d92cea0234a5d25e1c88f67adfd7a9ebebae350e1739f5d1b80aa8ec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: complexity/use_math_min_max.rs: FileTooLong \u2014 607 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 31 free functions. The bar is 500 significant lines; this is 107 over it, 1.21\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/complexity/use_math_min_max.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a60b8faa1019cee728fe36dd692f1b7e5a15816b5510b65f2a7365a9024eec1a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: db/state.rs: FileTooLong \u2014 607 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 107 over it, 1.21\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/db/state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"48f270586de4b79e2a6bab6345a624aa153c5698cbbdd1758da823326ef22630"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/mod.rs: FileTooLong \u2014 605 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 62% of them inside a single declaration: BiomeCommand (2 blocks, 72-905). The bar is 500 significant lines; this is 105 over it, 1.21\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/biome_cli/src/commands/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"927b5164407179ffb82083e1d2664c56f554eb4883c7bb551a5c3b7c76d716dc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_module_graph::db::queries::type_inference::calls::implementation::infer_generic_return_type: FunctionTooLong \u2014 biome_module_graph::db::queries::type_inference::calls::implementation::infer_generic_return_type runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/queries/type_inference/calls/implementation.rs"},"region":{"startLine":1770}}}],"partialFingerprints":{"codehealthFindingId/v1":"a921c47674cc6e145552cb0e041cb4ab0e4c1f6354e255722484488b07d4d738"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_syntax_codegen::generate_syntax_kinds::generate_syntax_kinds: FunctionTooLong \u2014 biome_syntax_codegen::generate_syntax_kinds::generate_syntax_kinds runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_syntax_codegen/src/generate_syntax_kinds.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a2b02541de730512c31ffa9f2394a9c08d160737d194c7a3c906a2e6285226a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utils/metadata.rs: FileTooLong \u2014 602 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 102 over it, 1.20\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_formatter/src/utils/metadata.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78bd7a8fa02dfdb668a867965c7091abad4e8fb1fffb8650cd097cc077e1e90d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GraphqlLexer: ClassTooLong \u2014 481 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 17 methods, 4 blocks, lines 12-744. The bar is 400 significant lines; this is 81 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_graphql_parser/src/lexer/mod.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e88fc286eef05eca73bbdcaf72601a0c8bde06d6ddc83a37a6fddc8e6a4631e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: file_handlers/graphql.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/biome_service/src/file_handlers/graphql.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e28fb5cbf175578bcf084fcabca1853ca475c7d681e0f2177df6848cc547a1b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_js_analyze::lint::suspicious::no_react_forward_ref::fix_parameters: FunctionTooLong \u2014 biome_js_analyze::lint::suspicious::no_react_forward_ref::fix_parameters runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/no_react_forward_ref.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85a53b260ea12cf20c485f0c9a0588de6ae24e3eaf21d10b3fb8d6709d7ea55"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_service::file_handlers::json::fix_all: FunctionTooLong \u2014 biome_service::file_handlers::json::fix_all runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/json.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e11aa1a129e4a43d36691e97a763678b0b14027d961b25026d2c716cce8a0e6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: OverridePattern: ClassTooLong \u2014 475 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 1 methods, 2 blocks, lines 35-631. The bar is 400 significant lines; this is 75 over it, 1.19\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_configuration/src/overrides.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"0baf1a66943fb170423d3270515bfabedacf05b6d316664b8471da6e0f01a816"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/return_type_relation.rs: FileTooLong \u2014 593 significant 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 93 over it, 1.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/return_type_relation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f3e41f933255b793636cb76bfc8ac4b515ee5e76a99152504df3321933ff176"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HtmlModuleInfoInner.fmt: MethodTooLong \u2014 fmt runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/format_module_graph.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"1939ad0a49821642010cc89e8eabce2d6cf6a37f9916c805d281e40b744ea3ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 588 significant 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 88 over it, 1.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_parser/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37ec06a4bbffad6c5cea650676c9c7772e5ac5427ac4eb8619cdf3bf91b70a9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: UseImportType: ClassTooLong \u2014 470 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 0 methods. The bar is 400 significant lines; this is 70 over it, 1.18\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_import_type.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"af673ce89f94db60ad90f2d4f204d58365dcbab946d81649cdc08a227a1b3f59"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BatchMutation.commit_with_text_range_and_edit: MethodTooLong \u2014 commit_with_text_range_and_edit runs 117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_rowan/src/ast/batch.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"3136a273d6d2936abf618d380f0f8fdc639404e227467bcf48b57f3cd3310261"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_service::file_handlers::javascript::fix_all: FunctionTooLong \u2014 biome_service::file_handlers::javascript::fix_all runs 117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/javascript.rs"},"region":{"startLine":1569}}}],"partialFingerprints":{"codehealthFindingId/v1":"18fc4cb86599c31cf132c5b41e1446ff6153d4283b8600278949c5c8e032effe"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Settings: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/settings.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6dd98a7c70a03885602075d5e41710f9b84ec8c1274bc6b1c53bd6a572fee58"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: biome_tailwind_logic::use_tailwind_sorted_classes::arbitrary_value_match: TooManyFunctions \u2014 35 free functions. The bar is 30 free functions; this is 5 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_tailwind_logic/src/use_tailwind_sorted_classes/arbitrary_value_match.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"94aac19ca37014d7111d09dcdc1a537e281170b86728aec3b0244dd5e296506a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/scanner.rs: FileTooLong \u2014 582 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 82 over it, 1.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/scanner.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"88a2769b2f1593d271bda0d0759c8528573f6a5669285a1a783edca40dcc3f9b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: correctness/no_unreachable.rs: FileTooLong \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). The bar is 500 significant lines; this is 81 over it, 1.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/no_unreachable.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5100aa2e2bedb9ce9ae9ab6752e5b4059b61ccaf9375941e0eb1f5c7d8ccbe59"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/format_module_graph.rs: FileTooLong \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). The bar is 500 significant lines; this is 81 over it, 1.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/format_module_graph.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"538dc091e888011c655945fbe9ebd622421ed1fa1de7be064293143279fd808f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_service::file_handlers::javascript::lint_with_inspector: FunctionTooLong \u2014 biome_service::file_handlers::javascript::lint_with_inspector 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/biome_service/src/file_handlers/javascript.rs"},"region":{"startLine":1299}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5dcbffead4d44c014f1e554c53f259a9d87408a5d7187190b95ab42e37d6a3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_vue_semantic::semantic_model::sfc_model: FunctionTooLong \u2014 biome_vue_semantic::semantic_model::sfc_model 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/biome_vue_semantic/src/semantic_model/mod.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e0b62a7eae132735b1d79838a8191fde02a08324df921bdfae1000ad172794"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: nursery/use_object_from_entries.rs: FileTooLong \u2014 579 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 79 over it, 1.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_object_from_entries.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64512e593309d1f0f74b23c3d5c2d81a8e4eb3992bd1b2bdba39759415246c97"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: correctness/no_unused_variables.rs: FileTooLong \u2014 578 significant 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 78 over it, 1.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/no_unused_variables.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c1f8b27fb567341279b6ef012da386738725851dde2c0d0fd4d880f1ffef82e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Lexer: ClassTooLong \u2014 460 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 32 methods, 4 blocks, lines 32-864. The bar is 400 significant lines; this is 60 over it, 1.15\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_json_parser/src/lexer/mod.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff74afe216da0393232e66741cd88fc6800762ebda89a6cfacb5be1c8d88212b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NoDisabledAttribute.action: MethodTooLong \u2014 action 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/biome_html_analyze/src/lint/nursery/no_disabled_attribute.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e1816bdf70deeb103b60ea32c0f89029800e63ce4c34a6a3d997518d661173"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UnreachableRanges.propagate_ranges: MethodTooLong \u2014 propagate_ranges 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/biome_js_analyze/src/lint/correctness/no_unreachable.rs"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f192b4a0522b538ecc3d4e44479cb612980a25bf36fa515efaffc74e76fbdfa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_vue_semantic::semantic_model::references::usage_of: FunctionTooLong \u2014 biome_vue_semantic::semantic_model::references::usage_of 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/biome_vue_semantic/src/semantic_model/references.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ba0d4adced452aad5c1f0e4d0ade26796088194c226ed1fad27e785fca6322"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_markdown_parser::syntax::list::parse_first_line_blocks: FunctionTooLong \u2014 biome_markdown_parser::syntax::list::parse_first_line_blocks 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/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":2208}}}],"partialFingerprints":{"codehealthFindingId/v1":"d172fb780e0971dea6db519b5cd04c4962207c7fb3e828f1ccd480401b76a673"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TailwindLexer: ClassTooLong \u2014 454 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 30 methods, 5 blocks, lines 15-727. The bar is 400 significant lines; this is 54 over it, 1.14\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_tailwind_parser/src/lexer/mod.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b8f8867dcd09da53d4641d44c6b568bcdc36c79be3d7ca9540267e6ffd2cb27"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: biome_css_parser::syntax::at_rule::feature: TooManyFunctions \u2014 34 free functions. The bar is 30 free functions; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_parser/src/syntax/at_rule/feature.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d9b09a6b1e935e0f10880d9d79c96ca86f47b188e3e9f580dae43d8fd3cfed4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NoImplicitCoercions.run: MethodTooLong \u2014 run runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/complexity/no_implicit_coercions.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"f53583510578d79b9c4b2d8c34cd7cce1a1ded6167954c4bd52fa622c99ca4d4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UseConsistentCurlyBraces.action: MethodTooLong \u2014 action runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_consistent_curly_braces.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f6b3bbbe83b4d0d367fc4dcbc0aac18eedc37e8fa6d946889e2db0c524d0c8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HtmlRenderer.leave: MethodTooLong \u2014 leave runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/to_html.rs"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"53c0f6603174a448819a1be2c0fa759067844ac0839c40a9d41f2eb8714cfa5b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/signals.rs: FileTooLong \u2014 560 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 60 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/biome_analyze/src/signals.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c6d6f5e4b17ccb4bff3c64d63a7cde5d8f59229d611269b64a0a54548c9339"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_formatter::token::number::format_trimmed_number: FunctionTooLong \u2014 biome_formatter::token::number::format_trimmed_number runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_formatter/src/token/number.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae65efd82625bf1d8a6739fcc885cde547d969e5c95a7a40f6db6078ea95a6d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UseComponentExportOnlyModules.run: MethodTooLong \u2014 run runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_component_export_only_modules.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e81179fcc11a376457df04693e46d58ea212d18bbb2a51fbdb12775b6973de"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_syntax_codegen::generate_syntax_factory::generate_syntax_factory: FunctionTooLong \u2014 biome_syntax_codegen::generate_syntax_factory::generate_syntax_factory runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_syntax_codegen/src/generate_syntax_factory.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"377251cb61cf945116d701c7dc613798e430d827613efc5ba2e145ecd794cc13"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FormatYamlBlockContent.fmt_fields: MethodTooLong \u2014 fmt_fields runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_yaml_formatter/src/yaml/auxiliary/block_content.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"b94b58739c2fa88e092b3800da2c44206ad3066378a9a7f7e607196511bc9c32"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/syntax_service.rs: FileTooLong \u2014 558 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 58 over it, 1.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_tailwind_logic/src/syntax_service.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed2bed4ec93632383fa6678b8f42ccaa5834eecf4db0aacd9aeb32fc4c55b25f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CommandRunner.run: MethodTooLong \u2014 run runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/runner/mod.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f80d0de8ea8aea61f59950358af4017999bba036d152dfa4ed5bf24a99fec6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source/organize_imports.rs: FileTooLong \u2014 552 significant 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 70% of them inside a single declaration: OrganizeImports (810-1358). The bar is 500 significant lines; this is 52 over it, 1.10\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/assist/source/organize_imports.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"598a238371f983fa442ece481a3a05706b771f5f57bce48bbd2e9f464ed7d429"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lexer/mod.rs: FileTooLong \u2014 551 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 82% of them inside a single declaration: TailwindLexer (5 blocks, 15-727). The bar is 500 significant lines; this is 51 over it, 1.10\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_tailwind_parser/src/lexer/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0983dd4b89af001d83c3799a269503d93a0f36c335ff5d0b13b04ca630bdb8c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: biome_css_parser::syntax::at_rule::container: TooManyFunctions \u2014 33 free functions. The bar is 30 free functions; this is 3 over it, 1.10\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/biome_css_parser/src/syntax/at_rule/container/mod.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"404777550154b08c04a7b997706426bcc9f61430c5d5105c65827698fb478845"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: biome_html_parser::syntax::parse_error: TooManyFunctions \u2014 33 free functions. The bar is 30 free functions; this is 3 over it, 1.10\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/biome_html_parser/src/syntax/parse_error.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1978bf3e18eb851b186d840265c99b8aaf6bcdb37340e81ac45a4cb581f0e75"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DbState: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\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/biome_service/src/db/state.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda06313906d76bb211e17ac678f892cf972ae90dac6b5636cd1dbd806450bf8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_js_analyze::lint::nursery::no_undeclared_classes::collect_class_names_from_expression: FunctionTooLong \u2014 biome_js_analyze::lint::nursery::no_undeclared_classes::collect_class_names_from_expression runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_undeclared_classes.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f64b9f1adbe9cf1ffe0db8f08768fd134b78574f95829ed08671afb637d49da"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_js_syntax::unescape::unescape_js_string: FunctionTooLong \u2014 biome_js_syntax::unescape::unescape_js_string runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_syntax/src/unescape.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b136186a294ef29dab6cc1cc67434f431ba30d2a660d18364af804ce7742d8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_js_analyze::assist::source::organize_imports::merge: FunctionTooLong \u2014 biome_js_analyze::assist::source::organize_imports::merge runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/assist/source/organize_imports.rs"},"region":{"startLine":1406}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4044afbb501ea102f9cea4c67f372e080437547eaa08e6a0d5f77b89ac15559"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeData.fmt: MethodTooLong \u2014 fmt runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/format_inferred_type_info.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ab8c076f04e012cca22f54805e9cee395a24d5b2a384d422f7139d03ad6242"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FormatMdInlineItemList.fmt_inside_list: MethodTooLong \u2014 fmt_inside_list runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_formatter/src/markdown/lists/inline_item_list.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"1027f865ed59cf489b9f8b58f22346f10fb6c209b1e258cd0675d52e608b7b6f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NoUnsafeOptionalChaining.run: MethodTooLong \u2014 run 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/biome_js_analyze/src/lint/correctness/no_unsafe_optional_chaining.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1f33be3b670ee2bdc7f0a9275fbfb6a3de4811aca29c5b3453d48a2e70c2f0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_js_analyze::lint::correctness::use_exhaustive_dependencies::is_stable_binding: FunctionTooLong \u2014 biome_js_analyze::lint::correctness::use_exhaustive_dependencies::is_stable_binding 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/biome_js_analyze/src/lint/correctness/use_exhaustive_dependencies.rs"},"region":{"startLine":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"796bb2fcaa6ddfb0bbffd748688a19700506bd3b028e2d7a55d88f1c585f5adc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FormatJsArrowFunctionExpression.fmt_fields: MethodTooLong \u2014 fmt_fields 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/biome_js_formatter/src/js/expressions/arrow_function_expression.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a5025d54c7f58279e37e8f432e7ae66fa6894e34baeb8a12d2e0009318be90e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FormatJsAnyConditionalRule.fmt: MethodTooLong \u2014 fmt 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/biome_js_formatter/src/utils/conditional.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba05c3be8d8e955b486a3a0dd194122dece0e7e91926de0452dae1e656e65c5e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_vue_semantic::semantic_model::references::collect_script_references: FunctionTooLong \u2014 biome_vue_semantic::semantic_model::references::collect_script_references 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/biome_vue_semantic/src/semantic_model/references.rs"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6574221847b720ec094baab3bfec43c32253e79ad00e5a4232494ad65eefc5a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: handlers/analysis.rs: FileTooLong \u2014 539 significant 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 39 over it, 1.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/handlers/analysis.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff9fc1dd88e0d6796936c9f4e324c7522f0e5d19f164e663cefd43e72bbca2d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: format_element/document.rs: FileTooLong \u2014 538 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 38 over it, 1.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_formatter/src/format_element/document.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"869b57a32023a455401d135c62ec3434129d3f06121150884394acb9a0d12a55"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/trivia.rs: FileTooLong \u2014 538 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 38 over it, 1.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_formatter/src/trivia.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"faabe59f5d16cbd03f9c3176697ed871e4a8e1024b2941da6cfad5031c3505d8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: flow/guards.rs: FileTooLong \u2014 538 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 38 over it, 1.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/js_module_info/flow/guards.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ddf69b986d0950639d2cfe4bf4781b70a1c19ae4a20c13b02ba6e81a5bd1c0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: config/configuration.rs: FileTooLong \u2014 537 significant 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 37 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/commands/inspect/config/configuration.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c7f556f392770377ffd88a25e14854fb562f18186aa21015da8117e3336457d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 537 significant 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 37 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_plugin_loader/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"068eddad83a59f996c226802c2687bea0481e0fa41f429fe596691952b09c154"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/grit_query.rs: FileTooLong \u2014 536 significant 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 36 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_patterns/src/grit_query.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0060752287cbc68839194ff1a4e62a429945ee3fdd80fb2776188b712066d45"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: syntax/quote.rs: FileTooLong \u2014 535 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 38 free functions. The bar is 500 significant lines; this is 35 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/quote.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f4b806cedff5579f8cf4f9b18c86753f07dfb0c9a8babc7ce05406359ca886"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DefaultFinalizer.finalize: MethodTooLong \u2014 finalize runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/runner/impls/finalizers/default.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f70743e95e7e4ab6e99c687d95390b698acaf4b74e64b117f7b6f320fc1e614"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: JsFormatSyntaxRewriter.visit_parenthesized: MethodTooLong \u2014 visit_parenthesized runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/syntax_rewriter.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b69d3bf4e7df83875820063447a195edee23306ac8467d16d8eacd10705478"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ResolutionCtx.filter_action: MethodTooLong \u2014 filter_action runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":3126}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c94ad1ae2405e571c458d69dfb9ff99153917589e7ad450908ec7edad087cc9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: generate-aria-data.parseAriaSpec: FunctionTooLong \u2014 parseAriaSpec runs 107 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/aria-data/generate-aria-data.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"5211177ef4aa6ba6b990671d7e1d83aa46af9bc4190c7e3c28baf53160be69d7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lists/block_list.rs: FileTooLong \u2014 534 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 34 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_formatter/src/markdown/lists/block_list.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a86d147defed2320aa7a0b556fe49250d9712ef0029b6f3daa4c1e44acecffad"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: HtmlFormatOptions: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_formatter/src/context.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d1d361cb2df925b80338d9174a3b9ffb2d1c082ba0d75cc8c837c12d57d90b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Lexer: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_json_parser/src/lexer/mod.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c6c7d60582110c909256b0adb1ebfd790b35f730063298ca1446c0c143d82a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/unsupported_rules.rs: FileTooLong \u2014 532 significant 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 32 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_analyze/src/unsupported_rules.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3c9af9c14f288ebca20fef25e9b3d3e1758a70827993c48175c24382a155268"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: file_handlers/yaml.rs: FileTooLong \u2014 532 significant 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 32 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/yaml.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0399587b82e4fa1f5b02d88bb91bd49fe48b7f7e207ef1f91c48d7719f2fede1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/class_category.rs: FileTooLong \u2014 532 significant 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 32 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_tailwind_logic/src/class_category.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c969dd32aadc8ff52f2783feb79916dbc1c7d4410be23ca8ad20e537a6fedb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: migrate/eslint_typescript.rs: FileTooLong \u2014 530 significant 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 30 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/execute/migrate/eslint_typescript.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d9000281380af27282af834bb4d13c4a6497d2bfbb5462f3a6693dbcd33e690"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OrganizeImports.diagnostic: MethodTooLong \u2014 diagnostic 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/biome_js_analyze/src/assist/source/organize_imports.rs"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bccadfe6a73030c99ebfd4b641f2f68890a3411b271988677672128f3ebe3ce"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UseExhaustiveDependencies.run: MethodTooLong \u2014 run 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/biome_js_analyze/src/lint/correctness/use_exhaustive_dependencies.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c195530aafdf47073344d52bd34c54a841a3a9a937d42339ec0bd4c4cbc5fa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FormatMdFencedCodeBlock.fmt_fields: MethodTooLong \u2014 fmt_fields 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/biome_markdown_formatter/src/markdown/auxiliary/fenced_code_block.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"63bb72e8c193e435941802eb8c1bd0e45b70d42cc3bc65ca013967ac2a50ecbc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ConfigurationExtendsLoader.collect_manifest_configs: MethodTooLong \u2014 collect_manifest_configs 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/biome_service/src/configuration.rs"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b13d2f538d8e7cef60550dd031bd4949012ee664a99c8d4a2cc16544c9b46c0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lexer/mod.rs: FileTooLong \u2014 528 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 87% of them inside a single declaration: Lexer (4 blocks, 32-864). The bar is 500 significant lines; this is 28 over it, 1.06\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_json_parser/src/lexer/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa8511cc6b805f7a9232f3108e6ef707ff489bbb0d4ed10a49b2a8c94fd5d20a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: css_module_info/traverse.rs: FileTooLong \u2014 528 significant 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 28 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/css_module_info/traverse.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3189996eabf766d64b5af3940e86d087a5ffe4b9eda8b79e5632746301f9e26e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CommandRunner.configure_workspace: MethodTooLong \u2014 configure_workspace runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/runner/mod.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d8c7b6fb531667f0ce5dea8637871abcbba770eb4f6ef9be4ed0f9f4b5f260f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_js_analyze::lint::suspicious::no_unnecessary_conditions::check_comparison_necessity: FunctionTooLong \u2014 biome_js_analyze::lint::suspicious::no_unnecessary_conditions::check_comparison_necessity runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/no_unnecessary_conditions.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f3f28aa19cd048e73f2846a362b19cc417e7490b62068e15f11a1fd2258ecd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utils/children.rs: FileTooLong \u2014 521 significant 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 21 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_formatter/src/utils/children.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d870c68be4dcbd4cebd27f99f4f1de9a88cac5abad4beb6d927c69473b133b72"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/diagnostics.rs: FileTooLong \u2014 521 significant 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 21 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/diagnostics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"39079893603e447ca0a3201b905058aaafa7f5f959ac94056409d6833573b184"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NoUselessEscapeInRegex.run: MethodTooLong \u2014 run 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/biome_js_analyze/src/lint/complexity/no_useless_escape_in_regex.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"406e99c3479a80c9eee7761c04a636ebec409e93b3cd5e80e04e00102d913f9e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_plugin_loader::resolve_plugin: FunctionTooLong \u2014 biome_plugin_loader::resolve_plugin 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/biome_plugin_loader/src/lib.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c006c51cffb2aa4f604b0e6bcb3c31a1a1314551a97f1bbcdec3d155b61be4b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: display/diff.rs: FileTooLong \u2014 517 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 17 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_diagnostics/src/display/diff.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb4a0d784d6a3bb6d50d37e0b4695bec92c3eb9475f7d867649474347055005"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: biome_css_parser::syntax::at_rule::media: TooManyFunctions \u2014 31 free functions. The bar is 30 free functions; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_parser/src/syntax/at_rule/media.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4924ffe908149a13180253c7e0a272d40c019848651d177e3e0f7ae6df24dc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UseOptionalChain.action: MethodTooLong \u2014 action runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/complexity/use_optional_chain.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae1f8524931fcee1080e7fe319ce76c5de2f26458c91058d0415132565e2da31"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UseExhaustiveDependencies.diagnostic: MethodTooLong \u2014 diagnostic runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/use_exhaustive_dependencies.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e476d8977b4eed63adec9160c5564b4af05013626ddab8523088d105523407"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FormatTemplateElement.fmt: MethodTooLong \u2014 fmt runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/js/auxiliary/template_element.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"a023a7f4549df74d6b6abf34ab68c6818ea56c512a4b49c098fd34e2915ad94f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BooleanCoercionVisitor.enter: MethodTooLong \u2014 enter runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/inferred_type/boolean_coercion.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f8b8ddf0592d8b57568c5d0fc6387fe050ab7d1a54c571d2c2d04622fbac4e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: QuoteBlockList.fmt: MethodTooLong \u2014 fmt runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_formatter/src/quote.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b91c5ffd90321345276e63cf9ddd79b25f6083c752745115c428ac55fc4737"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_vue_semantic::semantic_model::references::collect_template_references: FunctionTooLong \u2014 biome_vue_semantic::semantic_model::references::collect_template_references runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_vue_semantic/src/semantic_model/references.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"d530e6371b2ef148c480b1d2658b7d51f378abc75d9f648dbb2e57163f7d25af"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FormatYamlVerbatimNode.fmt: MethodTooLong \u2014 fmt runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_yaml_formatter/src/verbatim.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08706e4921ad727ea9adfeeae74368072fd2bb2ec7398026991f4d6eeeb2004"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/suppressions.rs: FileTooLong \u2014 513 significant 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 13 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_analyze/src/suppressions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13083266b8cba27d082ca740ebfb9edd4f5cabe58fe57f5483893d4acc7b9ee3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ast/mod.rs: FileTooLong \u2014 513 significant 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 13 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_rowan/src/ast/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c2a00e4d17e005a76398d55b20afb514a86f568340f80a97213c0ffe3887798"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lexer/scan_cursor.rs: FileTooLong \u2014 511 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 11 over it, 1.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_parser/src/lexer/scan_cursor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"826fedf7986ef68a9a2f79614eb9d692830824696eafcd211a34afdcff1d1573"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_diagnostics::display::diff::print_full_diff: FunctionTooLong \u2014 biome_diagnostics::display::diff::print_full_diff 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/biome_diagnostics/src/display/diff.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b71dc4b9f3a48caa1d17d0138c75790cfc971b0eff217df6b71cbbf6c17fb57"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GritResolvedPattern.from_pattern: MethodTooLong \u2014 from_pattern 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/biome_grit_patterns/src/grit_resolved_pattern.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19f00d7fb364e1e2cac6e210ff36490ccbd9f4d186f89ae2b1ff212163140b9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_rule_options::shared::restricted_regex::validate_restricted_regex: FunctionTooLong \u2014 biome_rule_options::shared::restricted_regex::validate_restricted_regex runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_rule_options/src/shared/restricted_regex.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"993de1eea8b27dee54e6e3351b3594a87aa08344fa71f1c15fccc9d5ded2b5e0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lexer/mod.rs: FileTooLong \u2014 509 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 94% of them inside a single declaration: GraphqlLexer (4 blocks, 12-744). The bar is 500 significant lines; this is 9 over it, 1.02\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_graphql_parser/src/lexer/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea1be3132e2d26bc8d4296b73bc1fa6a3a722ed621a6d80b4be95a8b5c6625f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/workspace_types.rs: FileTooLong \u2014 509 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 9 over it, 1.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/workspace_types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d85b4360a09afbcff755c3173dedab38439bd14e37e83157089fcab6a55bfd"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MarkdownParser: ClassTooLong \u2014 406 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 61 methods, 3 blocks, lines 543-1437. The bar is 400 significant lines; this is 6 over it, 1.02\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/parser.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"6255537dd27792115e164045fc5297dfbe92e666fe032c2f4a703aa675126e4c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Settings: ClassTooLong \u2014 405 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 35 methods, 3 blocks, lines 99-1781. The bar is 400 significant lines; this is 5 over it, 1.01\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/settings.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc44358c76d05651dd2f593c6abf536c019c40110579b2bf8d7056c1543f88b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: nursery/no_obsolete_attributes.rs: FileTooLong \u2014 506 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 6 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/nursery/no_obsolete_attributes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"822d27107f10d948cfaeb14e1ee62f2ac6a76e36f6687d09832ce8ff4e8050ab"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UseExplicitType.run: MethodTooLong \u2014 run runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_explicit_type.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf626128440037ba22cad36be1865f6b0e6c03b5800a90de93a75fa1d68028d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UseFilenamingConvention.diagnostic: MethodTooLong \u2014 diagnostic runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_filenaming_convention.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"39a54cc44c15351c400537c1e4433d4c003dfd335bd2707205b33c3332f84e77"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: biome_service::workspace_types::generate_type: FunctionTooLong \u2014 biome_service::workspace_types::generate_type runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/workspace_types.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d47aaa5e84541027f4eade637d0a6ce2c7f63fe6a6b3168f3143b959d62049"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SyntaxNode: ClassTooLong \u2014 401 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 61 methods, 6 blocks, lines 19-737. The bar is 400 significant lines; this is 1 over it, 1.00\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_rowan/src/cursor/node.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"5795f0853a231a1878f9503b2a8afa4df379399ce21e3b2c2d6737d8c0af67aa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: supports/mod.rs: FileTooLong \u2014 501 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 34 free functions. The bar is 500 significant lines; this is 1 over it, 1.00\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_parser/src/syntax/at_rule/supports/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"581a335ae6fcb3f9e00c7ddbe61d273f336ce9039cde05937e0c2318478c7560"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (7 members, 69 shared lines): crates/biome_css_formatter/src/verbatim.rs:136-261 | crates/biome_graphql_formatter/src/verbatim.rs:45-177 | crates/biome_grit_formatter/src/verbatim.rs:45-176 | crates/biome_html_formatter/src/verbatim.rs:58-186 | crates/biome_js_formatter/src/verbatim.rs:45-176 | crates/biome_json_formatter/src/verbatim.rs:44-175 | crates/biome_yaml_formatter/src/verbatim.rs:49-220 \u2014 These 7 members are variants of one another: a block of 69 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 7 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 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_formatter/src/verbatim.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d5a726d3606055dbc715f4f23cc43e000abd9d032603a1b5121632db858dc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (7 members, 45 shared lines): crates/biome_service/src/file_handlers/css.rs:878-1081 | crates/biome_service/src/file_handlers/graphql.rs:710-810 | crates/biome_service/src/file_handlers/html.rs:1366-1563 | crates/biome_service/src/file_handlers/javascript.rs:1569-1735 | crates/biome_service/src/file_handlers/json.rs:832-998 | crates/biome_service/src/file_handlers/md.rs:743-851 | crates/biome_service/src/file_handlers/yaml.rs:605-705 \u2014 These 7 members are variants of one another: a block of 45 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 7 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 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/css.rs"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ead89d9d1236a06dbaa4465ed240c23751db099885ca8c6acd894b896e40ec0"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (7 members, 21 shared lines): crates/biome_module_graph/src/db/type_inference/expressions.rs:847-910 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1126-1274 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1485-1534 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1536-1583 | crates/biome_module_graph/src/db/type_inference/expressions.rs:2464-2521 | crates/biome_module_graph/src/db/type_inference/lookup.rs:740-783 | crates/biome_module_graph/src/db/type_inference/lookup.rs:864-959 \u2014 These 7 members are variants of one another: a block of 21 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 7 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 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b32db96a7010166bd4a971fc6da357e85314fbc6b27f6a637960add0ad996a"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (6 members, 20 shared lines): crates/biome_css_analyze/src/lint/nursery/use_consistent_unicode_bom.rs:118-148 | crates/biome_graphql_analyze/src/lint/nursery/use_consistent_unicode_bom.rs:114-148 | crates/biome_html_analyze/src/lint/nursery/use_consistent_unicode_bom.rs:106-136 | crates/biome_js_analyze/src/lint/nursery/use_consistent_unicode_bom.rs:127-157 | crates/biome_json_analyze/src/lint/nursery/use_consistent_unicode_bom.rs:114-144 | crates/biome_markdown_analyze/src/lint/nursery/use_consistent_unicode_bom.rs:106-140 \u2014 These 6 members are variants of one another: a block of 20 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_analyze/src/lint/nursery/use_consistent_unicode_bom.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"048484f4238e2728b1cf577635f2ab0a0275ae9308393edc73eaf868b96bc923"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (5 members, 25 shared lines): crates/biome_grit_patterns/src/pattern_compiler/auto_wrap.rs:72-131 | crates/biome_grit_patterns/src/pattern_compiler/auto_wrap.rs:136-195 | crates/biome_grit_patterns/src/pattern_compiler/auto_wrap.rs:200-289 | crates/biome_grit_patterns/src/pattern_compiler/auto_wrap.rs:294-353 | crates/biome_grit_patterns/src/pattern_compiler/step_compiler.rs:21-105 \u2014 These 5 members are variants of one another: a block of 25 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_patterns/src/pattern_compiler/auto_wrap.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"919eee9b69796d841ac0c38711d167a9f94e85547774feccecda9cc3f2203afd"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 22 shared lines): crates/biome_js_analyze/src/lint/nursery/no_tanstack_query_void_query_fn.rs:326-385 | crates/biome_js_analyze/src/lint/nursery/use_vue_render_return.rs:145-193 | crates/biome_js_analyze/src/lint/suspicious/use_iterable_callback_return.rs:352-436 | crates/biome_js_analyze/src/utils/function_return.rs:19-70 \u2014 These 4 members are variants of one another: a block of 22 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 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/biome_js_analyze/src/lint/nursery/no_tanstack_query_void_query_fn.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c7f0f62225e63e43339b3fc176d95004542a545fee60c5e7be05e6b2d6a69a"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (137 shared lines): crates/biome_syntax_codegen/src/generate_syntax_factory.rs:16-187 | xtask/codegen/src/generate_syntax_factory.rs:9-177 \u2014 These two members are variants of one another: 137 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_syntax_codegen/src/generate_syntax_factory.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"598d25526293f2fb99a88fef47f9beb80692745c5b9f92f5db49eb538c5aaa38"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (98 shared lines): crates/biome_grit_parser/src/lexer/mod.rs:341-472 | crates/biome_json_parser/src/lexer/mod.rs:386-523 \u2014 These two members are variants of one another: 98 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_parser/src/lexer/mod.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c49f909221c6294be491a1a7f0cb3f59845ecc537142980335c24d1f3417fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (61 shared lines): crates/biome_grit_parser/src/lexer/mod.rs:474-588 | crates/biome_json_parser/src/lexer/mod.rs:525-659 \u2014 These two members are variants of one another: 61 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_parser/src/lexer/mod.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"4899575646f6898fde81370422cfbde9f455affd1f2009648726686e7b820f93"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (40 shared lines): crates/biome_module_graph/src/db/queries.rs:36-120 | crates/biome_module_graph/src/db/queries.rs:127-203 \u2014 These two members are variants of one another: 40 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/queries.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"956b604ae1465d28b12a24bd8b6dd0abd1cdf572aefc911e1bc5cfbe8d51b472"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (37 shared lines): crates/biome_js_transform/src/lib.rs:45-126 | crates/biome_migrate/src/lib.rs:49-122 \u2014 These two members are variants of one another: 37 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_transform/src/lib.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa0331531671a892e9cf4a65eafde6e5b157f0a58c552a62015bbc6f3205b2b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (37 shared lines): crates/biome_markdown_formatter/src/markdown/lists/block_list.rs:23-168 | crates/biome_markdown_formatter/src/quote.rs:96-260 \u2014 These two members are variants of one another: 37 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_formatter/src/markdown/lists/block_list.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d938505965ab6261a6782de1b67e34360033e1dc04afb2569f36cc620d8f6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (69 corresponding lines): crates/biome_html_analyze/src/lint/a11y/use_valid_lang.rs:68-146 | crates/biome_js_analyze/src/lint/a11y/use_valid_lang.rs:64-142 \u2014 These two members are one piece of code written twice and then edited apart: 69 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/biome_html_analyze/src/lint/a11y/use_valid_lang.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff83e44e20952681cf9e04185041833b2c7821b9cfb2337ad2f277d0aa8d897f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (48 corresponding lines): crates/biome_js_analyze/src/lint/suspicious/no_global_is_finite.rs:78-130 | crates/biome_js_analyze/src/lint/suspicious/no_global_is_nan.rs:79-131 \u2014 These two members are one piece of code written twice and then edited apart: 48 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/no_global_is_finite.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"a909c1e3c0675fc6782a789a7091670ba9f13e5baaa493fe27fb236a39ced0da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/biome_js_analyze/src/assist/source/organize_imports/specifiers_attributes.rs:161-192 | crates/biome_js_analyze/src/assist/source/organize_imports/specifiers_attributes.rs:239-270 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/assist/source/organize_imports/specifiers_attributes.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5cfc6bf85c49a6bd25333064bbac72fb5d78659d6cd80fe3fa074a5341119ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/biome_module_graph/src/format_module_graph.rs:73-101 | crates/biome_module_graph/src/format_module_graph.rs:108-137 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/format_module_graph.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"a976af3467ec3f21f810a61a47ad24e1d1fb9509825a613f915842f616290056"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): crates/biome_js_formatter/src/js/module/import_assertion.rs:11-47 | crates/biome_js_formatter/src/ts/module/import_type_assertion.rs:9-49 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/js/module/import_assertion.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff8ca58ac76df36e4b66517f1ac93326e71501316721c2b81578370361fff16"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/biome_js_analyze/src/lint/nursery/no_misleading_return_type/analysis.rs:855-877 | crates/biome_js_analyze/src/lint/nursery/no_misleading_return_type/analysis.rs:885-904 \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/biome_js_analyze/src/lint/nursery/no_misleading_return_type/analysis.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7bcfc36dfceb0284324fe2be540c8f85f0f6405a9e28a89cc048530673e60f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/biome_module_graph/src/db/queries/css.rs:422-454 | crates/biome_module_graph/src/db/queries/css.rs:702-758 \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/biome_module_graph/src/db/queries/css.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"5527356a9dafa66ab1d48d6cdbaaed10cca7c49fe873bfd7590c8595e65eb77c"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (12 members, 50\u002B identical tokens): crates/biome_css_formatter/src/css/pseudo/pseudo_class_function_compound_selector_list.rs:17-42 | crates/biome_css_formatter/src/css/pseudo/pseudo_class_function_custom_identifier.rs:17-39 | crates/biome_css_formatter/src/css/pseudo/pseudo_class_function_custom_identifier_list.rs:18-46 | crates/biome_css_formatter/src/css/pseudo/pseudo_class_function_identifier.rs:13-38 | crates/biome_css_formatter/src/css/pseudo/pseudo_class_function_nth.rs:13-35 | crates/biome_css_formatter/src/css/pseudo/pseudo_class_function_relative_selector_list.rs:17-42 | crates/biome_css_formatter/src/css/pseudo/pseudo_class_function_selector_list.rs:17-39 | crates/biome_css_formatter/src/css/pseudo/pseudo_class_function_value_list.rs:13-34 | crates/biome_css_formatter/src/css/pseudo/pseudo_element_function_custom_identifier.rs:17-39 | crates/biome_css_formatter/src/css/selectors/pseudo_class_function_compound_selector.rs:17-39 | crates/biome_css_formatter/src/css/selectors/pseudo_class_function_selector.rs:13-35 | crates/biome_css_formatter/src/css/selectors/pseudo_element_function_selector.rs:13-35 \u2014 These 12 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 12 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 12 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_formatter/src/css/pseudo/pseudo_class_function_compound_selector_list.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"80500d061abbaab24c4f241c5ef337530ae6d96237b417064c203702cb660bf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (11 members, 50\u002B identical tokens): crates/biome_grit_formatter/src/grit/auxiliary/like.rs:7-37 | crates/biome_grit_formatter/src/grit/auxiliary/map.rs:7-25 | crates/biome_grit_formatter/src/grit/auxiliary/sequential.rs:8-31 | crates/biome_grit_formatter/src/grit/patterns/curly_pattern.rs:7-25 | crates/biome_grit_formatter/src/grit/patterns/pattern_any.rs:8-27 | crates/biome_grit_formatter/src/grit/patterns/pattern_or.rs:8-27 | crates/biome_grit_formatter/src/grit/patterns/pattern_or_else.rs:8-27 | crates/biome_grit_formatter/src/grit/predicates/predicate_and.rs:8-26 | crates/biome_grit_formatter/src/grit/predicates/predicate_any.rs:8-26 | crates/biome_grit_formatter/src/grit/predicates/predicate_curly.rs:7-25 | crates/biome_grit_formatter/src/grit/predicates/predicate_or.rs:7-26 \u2014 These 11 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 11 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 11 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_formatter/src/grit/auxiliary/like.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f5ea84aaea3a871697165a49183b68abf63cacc2ce869b3fb957c335b0af77d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (10 members, 50\u002B identical tokens): crates/biome_css_formatter/src/css/auxiliary/container_query_in_parens.rs:12-29 | crates/biome_css_formatter/src/css/auxiliary/container_size_feature_in_parens.rs:12-29 | crates/biome_css_formatter/src/css/auxiliary/container_style_in_parens.rs:12-29 | crates/biome_css_formatter/src/css/auxiliary/media_condition_in_parens.rs:12-29 | crates/biome_css_formatter/src/css/auxiliary/media_feature_in_parens.rs:8-25 | crates/biome_css_formatter/src/css/auxiliary/parenthesized_expression.rs:12-29 | crates/biome_css_formatter/src/css/auxiliary/scope_edge.rs:8-25 | crates/biome_css_formatter/src/css/auxiliary/supports_feature_declaration.rs:12-29 | crates/biome_css_formatter/src/scss/auxiliary/supports_feature_declaration.rs:13-29 | crates/biome_css_formatter/src/tailwind/auxiliary/custom_variant_shorthand.rs:12-33 \u2014 These 10 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 10 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 10 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_formatter/src/css/auxiliary/container_query_in_parens.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca23eda42d593df5fab15d5ef9d170476f3fe762d1ab02fa59e2a461ee85cc4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (8 members, 50\u002B identical tokens): crates/biome_graphql_formatter/src/graphql/definitions/enum_type_definition.rs:12-36 | crates/biome_graphql_formatter/src/graphql/definitions/enum_value_definition.rs:12-24 | crates/biome_graphql_formatter/src/graphql/definitions/field_definition.rs:12-37 | crates/biome_graphql_formatter/src/graphql/definitions/input_object_type_definition.rs:14-38 | crates/biome_graphql_formatter/src/graphql/definitions/interface_type_definition.rs:12-39 | crates/biome_graphql_formatter/src/graphql/definitions/object_type_definition.rs:12-39 | crates/biome_graphql_formatter/src/graphql/definitions/scalar_type_definition.rs:12-33 | crates/biome_graphql_formatter/src/graphql/definitions/schema_definition.rs:12-33 \u2014 These 8 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 8 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 8 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_graphql_formatter/src/graphql/definitions/enum_type_definition.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"a590e561e13fc3ff2034c168a10e417e72f2bb86b7b894296fe9d845e968256f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (8 members, 50\u002B identical tokens): crates/biome_js_formatter/src/js/classes/setter_class_member.rs:11-55 | crates/biome_js_formatter/src/js/declarations/catch_declaration.rs:11-69 | crates/biome_js_formatter/src/js/expressions/call_arguments.rs:27-170 | crates/biome_js_formatter/src/js/expressions/parenthesized_expression.rs:17-63 | crates/biome_js_formatter/src/js/objects/computed_member_name.rs:11-35 | crates/biome_js_formatter/src/js/objects/setter_object_member.rs:11-52 | crates/biome_js_formatter/src/js/statements/for_in_statement.rs:12-54 | crates/biome_js_formatter/src/js/statements/for_of_statement.rs:12-66 \u2014 These 8 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 8 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 8 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/js/classes/setter_class_member.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd8d2ff0c1f7d197638d42ef366f77047d6c364cf0f0d727f315d3097504e924"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (8 members, 50\u002B identical tokens): crates/biome_service/src/file_handlers/css.rs:759-875 | crates/biome_service/src/file_handlers/graphql.rs:619-707 | crates/biome_service/src/file_handlers/html.rs:1246-1363 | crates/biome_service/src/file_handlers/javascript.rs:1450-1566 | crates/biome_service/src/file_handlers/javascript.rs:2008-2084 | crates/biome_service/src/file_handlers/json.rs:727-829 | crates/biome_service/src/file_handlers/md.rs:654-740 | crates/biome_service/src/file_handlers/yaml.rs:517-602 \u2014 These 8 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 8 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 8 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/css.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"6172216e2e5089f51fc9cb70f74038377f49aa60d06c37d6cd949070616f68f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (8 members, 50\u002B identical tokens): crates/biome_service/src/settings.rs:2096-2157 | crates/biome_service/src/settings.rs:2159-2197 | crates/biome_service/src/settings.rs:2200-2231 | crates/biome_service/src/settings.rs:2237-2268 | crates/biome_service/src/settings.rs:2270-2292 | crates/biome_service/src/settings.rs:2295-2351 | crates/biome_service/src/settings.rs:2354-2378 | crates/biome_service/src/settings.rs:2381-2407 \u2014 These 8 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 8 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 8 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/settings.rs"},"region":{"startLine":2096}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac3a875ab04a8ad16b7a9c4a7a9706c7fc28a7f80e1afea848d02c66cdd7494"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): crates/biome_js_analyze/src/lint/style/no_playwright_element_handle.rs:70-94 | crates/biome_js_analyze/src/lint/style/no_playwright_eval.rs:55-79 | crates/biome_js_analyze/src/lint/style/no_playwright_wait_for_selector.rs:67-82 | crates/biome_js_analyze/src/lint/suspicious/no_playwright_networkidle.rs:58-114 | crates/biome_js_analyze/src/lint/suspicious/no_playwright_page_pause.rs:60-78 | crates/biome_js_analyze/src/lint/suspicious/no_playwright_wait_for_navigation.rs:62-77 | crates/biome_js_analyze/src/lint/suspicious/no_playwright_wait_for_timeout.rs:62-77 \u2014 These 7 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 7 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 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/no_playwright_element_handle.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"01fab79c57eae7b3320269a44e8d58f50dc87b1a26b7f4b063d86211f0e40630"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): crates/biome_js_type_info/src/format_inferred_type_info.rs:1088-1103 | crates/biome_js_type_info/src/format_inferred_type_info.rs:1109-1127 | crates/biome_js_type_info/src/format_inferred_type_info.rs:1175-1195 | crates/biome_js_type_info/src/format_inferred_type_info.rs:1201-1212 | crates/biome_js_type_info/src/format_type_info.rs:1053-1068 | crates/biome_js_type_info/src/format_type_info.rs:1074-1090 | crates/biome_js_type_info/src/format_type_info.rs:1096-1115 \u2014 These 7 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 7 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 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/format_inferred_type_info.rs"},"region":{"startLine":1088}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1ac6cacea83812a8b3a6dd04e558740974c35dc5c4233f10ba4c97a2adcdcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): crates/biome_service/src/file_handlers/css.rs:670-756 | crates/biome_service/src/file_handlers/graphql.rs:568-616 | crates/biome_service/src/file_handlers/html.rs:1092-1244 | crates/biome_service/src/file_handlers/javascript.rs:1302-1447 | crates/biome_service/src/file_handlers/json.rs:630-725 | crates/biome_service/src/file_handlers/md.rs:575-652 | crates/biome_service/src/file_handlers/yaml.rs:467-515 \u2014 These 7 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 7 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 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/css.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"87669a20c1b44341c8b3edeca46082186510046d4c95f59d99c70250093ac8c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): crates/biome_css_analyze/src/lint/nursery/use_consistent_unicode_bom.rs:87-99 | crates/biome_graphql_analyze/src/lint/nursery/use_consistent_unicode_bom.rs:83-95 | crates/biome_html_analyze/src/lint/nursery/use_consistent_unicode_bom.rs:81-87 | crates/biome_js_analyze/src/lint/nursery/use_consistent_unicode_bom.rs:91-108 | crates/biome_json_analyze/src/lint/nursery/use_consistent_unicode_bom.rs:83-95 | crates/biome_markdown_analyze/src/lint/nursery/use_consistent_unicode_bom.rs:81-87 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_analyze/src/lint/nursery/use_consistent_unicode_bom.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe01723f3cb6aad3889b05715648d02afc8fd6d26737cc7aea282f1771f3c62"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): crates/biome_css_analyze/src/lint/nursery/use_consistent_unicode_bom.rs:101-116 | crates/biome_graphql_analyze/src/lint/nursery/use_consistent_unicode_bom.rs:97-112 | crates/biome_html_analyze/src/lint/nursery/use_consistent_unicode_bom.rs:89-104 | crates/biome_js_analyze/src/lint/nursery/use_consistent_unicode_bom.rs:110-125 | crates/biome_json_analyze/src/lint/nursery/use_consistent_unicode_bom.rs:97-112 | crates/biome_markdown_analyze/src/lint/nursery/use_consistent_unicode_bom.rs:89-104 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_analyze/src/lint/nursery/use_consistent_unicode_bom.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"9695cbd08713c033edaef73861b3d2996561860b981a510c01a1f9ec0277f0d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): crates/biome_css_analyze/src/suppression.rs:14-27 | crates/biome_graphql_analyze/src/suppression.rs:14-27 | crates/biome_html_analyze/src/suppression.rs:14-27 | crates/biome_js_analyze/src/suppression.rs:14-27 | crates/biome_json_analyze/src/suppression.rs:14-27 | crates/biome_yaml_analyze/src/suppression.rs:14-27 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_analyze/src/suppression.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec5a68e05b11a81ba3030bba36269e7cb0ddf40ccfe25ea808be1060b6dadaca"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): crates/biome_js_analyze/src/lint/complexity/use_optional_chain.rs:185-330 | crates/biome_js_analyze/src/lint/complexity/use_regex_literals.rs:114-144 | crates/biome_js_analyze/src/lint/nursery/no_null.rs:138-157 | crates/biome_js_analyze/src/lint/nursery/no_useless_fallback_in_spread.rs:109-125 | crates/biome_js_analyze/src/lint/nursery/use_flat_math_min_max.rs:89-143 | crates/biome_js_analyze/src/lint/style/use_trim_start_end.rs:124-242 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/complexity/use_optional_chain.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"73591f1f628bbb661ebeb3add5e554b39c9483e1623a23f7b65a0da3f4e2fa51"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/biome_css_formatter/src/comments.rs:50-84 | crates/biome_graphql_formatter/src/comments.rs:22-56 | crates/biome_grit_formatter/src/comments.rs:38-72 | crates/biome_js_formatter/src/comments.rs:37-72 | crates/biome_json_formatter/src/comments.rs:23-57 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_formatter/src/comments.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f287fbe5d47d8df746342734dfdcfc8853fe16bb2fc8b821541c88551df2db4"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/biome_css_formatter/src/css/auxiliary/container_style_query_in_parens.rs:12-33 | crates/biome_css_formatter/src/css/auxiliary/if_function.rs:9-33 | crates/biome_css_formatter/src/css/auxiliary/import_named_layer.rs:8-29 | crates/biome_css_formatter/src/css/auxiliary/import_supports.rs:8-32 | crates/biome_css_formatter/src/scss/auxiliary/legacy_if_function.rs:9-33 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_formatter/src/css/auxiliary/container_style_query_in_parens.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"41dbb6abe016e244fe3dc229186869c677a5c1f61e02f9487659b466562bcd12"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/biome_css_formatter/src/verbatim.rs:344-359 | crates/biome_graphql_formatter/src/verbatim.rs:216-231 | crates/biome_grit_formatter/src/verbatim.rs:215-230 | crates/biome_js_formatter/src/verbatim.rs:224-239 | crates/biome_json_formatter/src/verbatim.rs:214-229 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_formatter/src/verbatim.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b9d9a7c05873cf776fdc15ec73a530efebc32e583628c1943875c4b406db16"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/biome_deserialize_macros/src/deserializable_derive.rs:235-291 | crates/biome_deserialize_macros/src/deserializable_derive.rs:297-324 | crates/biome_deserialize_macros/src/deserializable_derive.rs:330-532 | crates/biome_deserialize_macros/src/deserializable_derive.rs:538-565 | crates/biome_deserialize_macros/src/deserializable_derive.rs:571-607 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_deserialize_macros/src/deserializable_derive.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"63bece69f70ee36644463d2002d4688875b8158b88be3469cc2ddd8b87126c08"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/biome_graphql_analyze/src/lint/correctness/no_duplicate_argument_names.rs:50-56 | crates/biome_graphql_analyze/src/lint/correctness/no_duplicate_field_definition_names.rs:142-148 | crates/biome_graphql_analyze/src/lint/correctness/no_duplicate_field_definition_names.rs:150-156 | crates/biome_graphql_analyze/src/lint/correctness/no_duplicate_input_field_names.rs:50-56 | crates/biome_graphql_analyze/src/lint/suspicious/no_duplicate_fields.rs:211-218 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_graphql_analyze/src/lint/correctness/no_duplicate_argument_names.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f06df3346bf5889ec27240ee4709ab1e011c5cc9d0078e8eff6e3a06810c0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/biome_html_syntax/src/attribute_ext.rs:115-143 | crates/biome_html_syntax/src/attribute_ext.rs:186-229 | crates/biome_html_syntax/src/attribute_ext.rs:231-283 | crates/biome_html_syntax/src/attribute_ext.rs:413-443 | crates/biome_html_syntax/src/attribute_ext.rs:450-481 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_syntax/src/attribute_ext.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de97d58b6d7fa89236f113248d509777d9174886e2a7815aec04836e88951bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/biome_service/src/file_handlers/css.rs:616-661 | crates/biome_service/src/file_handlers/graphql.rs:503-559 | crates/biome_service/src/file_handlers/grit.rs:443-496 | crates/biome_service/src/file_handlers/javascript.rs:1787-1831 | crates/biome_service/src/file_handlers/json.rs:576-621 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/css.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb067ed6897f4c62892d37c5aa94160063f661db7c25bee00d79e9a6720581ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/biome_cli/src/execute/migrate/eslint.rs:120-147 | crates/biome_cli/src/execute/migrate/eslint.rs:155-233 | crates/biome_cli/src/execute/migrate/prettier.rs:495-578 | crates/biome_cli/src/execute/migrate/stylelint.rs:93-164 \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/biome_cli/src/execute/migrate/eslint.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f7e5a44e6a39e90154e905eb8c6450f11902b55429f954f464619d9e97aaad7"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/biome_cli/src/service/windows.rs:132-149 | crates/biome_cli/src/service/windows.rs:161-174 | crates/biome_cli/src/service/windows.rs:260-277 | crates/biome_cli/src/service/windows.rs:289-302 \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/biome_cli/src/service/windows.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd73581b1dd1e3b93a8434ad20ecd8c81be37753e05036b9c8424f28287b2d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/biome_configuration/src/lib.rs:774-797 | crates/biome_manifest/src/lib.rs:97-136 | crates/biome_manifest/src/lib.rs:156-201 | xtask/codegen/src/promote_rules.rs:564-587 \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/biome_configuration/src/lib.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4cba94f63c2783ce91b5f550e75393d147356f8ab45117e922231420d07cca"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/biome_css_analyze/src/lint/style/no_excessive_lines_per_file.rs:135-154 | crates/biome_graphql_analyze/src/lint/style/no_excessive_lines_per_file.rs:135-154 | crates/biome_html_analyze/src/lint/style/no_excessive_lines_per_file.rs:135-154 | crates/biome_js_analyze/src/lint/style/no_excessive_lines_per_file.rs:149-165 \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/biome_css_analyze/src/lint/style/no_excessive_lines_per_file.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"d951d19587e7ffdd5190b729c4fcea73ea6cac100a754f5631e71fcc62d766f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/biome_css_analyze/src/suppression_action.rs:13-37 | crates/biome_graphql_analyze/src/suppression_action.rs:17-39 | crates/biome_html_analyze/src/suppression_action.rs:13-39 | crates/biome_yaml_analyze/src/suppression_action.rs:17-39 \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/biome_css_analyze/src/suppression_action.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"9656e6559d622732c063c5f5f102ec2b964a1d7af2f89d4ead0bd331aa227f18"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/biome_css_formatter/src/css/auxiliary/document_custom_matcher.rs:12-38 | crates/biome_css_formatter/src/css/auxiliary/keyframes_scope_function.rs:12-38 | crates/biome_css_formatter/src/css/auxiliary/url_function.rs:8-39 | crates/biome_css_formatter/src/css/selectors/attribute_selector.rs:8-34 \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/biome_css_formatter/src/css/auxiliary/document_custom_matcher.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dbf2c7e3b70904ca24576ec9cb6e7af470ae57074dc6196fc5aa916f5ee09a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/biome_css_formatter/src/scss/auxiliary/media_query.rs:13-23 | crates/biome_html_formatter/src/svelte/auxiliary/await_catch_clause.rs:7-17 | crates/biome_html_formatter/src/svelte/auxiliary/await_then_clause.rs:7-17 | crates/biome_js_formatter/src/js/bindings/array_binding_pattern_element.rs:15-24 \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/biome_css_formatter/src/scss/auxiliary/media_query.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a9a0b1cbfe70d203896cf1a3780af8f000382b999988fc07f9d418df6ff72f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/biome_css_parser/src/lexer/mod.rs:1704-1716 | crates/biome_graphql_parser/src/lexer/mod.rs:311-323 | crates/biome_grit_parser/src/lexer/mod.rs:326-338 | crates/biome_json_parser/src/lexer/mod.rs:371-383 \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/biome_css_parser/src/lexer/mod.rs"},"region":{"startLine":1704}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e4ae76c77dfa41d02c1ed19f99c6ce724396d2e27689242f086e81811640fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/biome_formatter/src/builders.rs:636-648 | crates/biome_html_formatter/src/utils/children.rs:81-93 | crates/biome_js_formatter/src/utils/jsx.rs:426-438 | crates/biome_markdown_formatter/src/words.rs:47-59 \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/biome_formatter/src/builders.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"c15e466111599e833993d3106d41d92357bb356e3d59be491698e36c90a65322"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/biome_graphql_formatter/src/lib.rs:187-196 | crates/biome_grit_formatter/src/lib.rs:81-90 | crates/biome_json_formatter/src/lib.rs:189-198 | crates/biome_markdown_formatter/src/lib.rs:232-241 \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/biome_graphql_formatter/src/lib.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc077d2a1a233fcc5dc47b22b3716c87ec906373b5e950f97e7757a0c45c40b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/biome_grit_formatter/src/grit/patterns/pattern_definition.rs:8-41 | crates/biome_js_formatter/src/js/module/export_from_clause.rs:13-41 | crates/biome_js_formatter/src/ts/declarations/enum_declaration.rs:10-48 | crates/biome_js_formatter/src/ts/declarations/import_equals_declaration.rs:16-43 \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/biome_grit_formatter/src/grit/patterns/pattern_definition.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"99eb9882cf47fcb83330df73c904779a28a8ab13f4fa01be105bd62b536c6c7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/biome_html_analyze/src/lint/nursery/no_tailwind_legacy_utilities.rs:129-139 | crates/biome_html_analyze/src/lint/nursery/no_tailwind_restricted_classes.rs:229-249 | crates/biome_html_analyze/src/lint/nursery/use_tailwind_shorthand_classes.rs:137-154 | crates/biome_html_analyze/src/lint/nursery/use_tailwind_variables_shorthand.rs:98-108 \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/biome_html_analyze/src/lint/nursery/no_tailwind_legacy_utilities.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1906c33f3d179ece58a8b96fbf8f2a6f41c642b79940a4e1851cceb6c7eaf8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/biome_html_parser/src/lexer/mod.rs:123-172 | crates/biome_html_parser/src/lexer/mod.rs:177-231 | crates/biome_html_parser/src/lexer/mod.rs:239-298 | crates/biome_html_parser/src/lexer/mod.rs:310-363 \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/biome_html_parser/src/lexer/mod.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"58131e1fabe681fc9eba92b0cbe6c66b9d9f367b3bcc109f73c6fe846cc40bc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/biome_html_parser/src/lexer/mod.rs:1898-1919 | crates/biome_js_parser/src/lexer/mod.rs:246-270 | crates/biome_markdown_parser/src/lexer/mod.rs:196-217 | crates/biome_tailwind_parser/src/lexer/mod.rs:663-684 \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/biome_html_parser/src/lexer/mod.rs"},"region":{"startLine":1898}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ad96e289e91e64f52095c319a083066b2477be1db0fff2595d9cefc5e331ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/biome_html_parser/src/lexer/mod.rs:2196-2207 | crates/biome_js_parser/src/lexer/mod.rs:337-348 | crates/biome_markdown_parser/src/lexer/mod.rs:1904-1915 | crates/biome_tailwind_parser/src/lexer/mod.rs:709-720 \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/biome_html_parser/src/lexer/mod.rs"},"region":{"startLine":2196}}}],"partialFingerprints":{"codehealthFindingId/v1":"62963558a49758e253a341f23e72b9bc557f24e3829fe02212712c7483b29472"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/biome_js_analyze/src/lint/complexity/no_adjacent_spaces_in_regex.rs:132-202 | crates/biome_js_analyze/src/lint/complexity/no_useless_escape_in_regex.rs:278-309 | crates/biome_js_analyze/src/lint/nursery/use_vue_base_import.rs:91-113 | crates/biome_js_analyze/src/lint/suspicious/no_misleading_character_class.rs:143-165 \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/biome_js_analyze/src/lint/complexity/no_adjacent_spaces_in_regex.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"320eff95129a69e89b2b7cac2c150113ce595acf9a26087c0c4a429144745804"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/biome_js_analyze/src/lint/complexity/no_useless_lone_block_statements.rs:116-145 | crates/biome_js_analyze/src/lint/complexity/no_useless_undefined_initialization.rs:153-221 | crates/biome_js_analyze/src/lint/nursery/no_useless_await.rs:114-179 | crates/biome_js_analyze/src/lint/nursery/use_unary_minus.rs:110-157 \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/biome_js_analyze/src/lint/complexity/no_useless_lone_block_statements.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"21cd8be54de4745987087b007dc76275c756ba04f30f01236e84a4f19fde48e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/biome_js_analyze/src/lint/complexity/use_regex_literals.rs:286-298 | crates/biome_js_analyze/src/lint/nursery/use_global_regex_in_replace_all.rs:191-204 | crates/biome_js_analyze/src/lint/style/use_named_capture_group.rs:148-161 | crates/biome_js_analyze/src/lint/style/use_unicode_regex.rs:300-313 \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/biome_js_analyze/src/lint/complexity/use_regex_literals.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a7a8c17e3e49b17d08ca2aae126bcf05a17f099714a6566b6b569e1e7cc4ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/biome_js_analyze/src/lint/nursery/no_console_spaces.rs:122-139 | crates/biome_js_analyze/src/lint/nursery/use_vue_matching_component_file_name.rs:186-217 | crates/biome_js_analyze/src/lint/style/use_numeric_separators.rs:227-246 | crates/biome_js_analyze/src/lint/suspicious/no_octal_escape.rs:100-127 \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/biome_js_analyze/src/lint/nursery/no_console_spaces.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8de7eb36034be2b368409a991c4df13aa4981bb3599ee27c5727ea112fccd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/biome_lsp/src/handlers/analysis.rs:58-378 | crates/biome_lsp/src/handlers/formatting.rs:25-105 | crates/biome_lsp/src/handlers/formatting.rs:111-212 | crates/biome_lsp/src/handlers/formatting.rs:218-300 \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/biome_lsp/src/handlers/analysis.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f77863527984597d59fe5099518b636d204956ca921a4b57d0b9f09d968ea4"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/biome_service/src/file_handlers/css.rs:582-592 | crates/biome_service/src/file_handlers/graphql.rs:469-479 | crates/biome_service/src/file_handlers/grit.rs:407-417 | crates/biome_service/src/file_handlers/json.rs:542-552 \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/biome_service/src/file_handlers/css.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"9725743e1e35509b404e016f2d6e7f0fce6743913d9f3f3b5e4d255fc55bf3ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/biome_syntax_codegen/src/generate_node_factory.rs:15-226 | crates/biome_syntax_codegen/src/generate_nodes.rs:12-953 | xtask/codegen/src/generate_node_factory.rs:8-219 | xtask/codegen/src/generate_nodes.rs:9-994 \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/biome_syntax_codegen/src/generate_node_factory.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"d00a20af7fc3137fef7e4ae52958c8905cfd4868e245ae4b5d99a68d0b221ebd"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/biome_tailwind_parser/src/lexer/mod.rs:50-88 | crates/biome_tailwind_parser/src/lexer/mod.rs:90-108 | crates/biome_tailwind_parser/src/lexer/mod.rs:142-159 | crates/biome_tailwind_parser/src/lexer/mod.rs:161-203 \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/biome_tailwind_parser/src/lexer/mod.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"008ec13ca6feb9ddd6db1c54567bebcc26184d3027616a4b57041dc475d89786"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (202 corresponding lines): crates/biome_js_type_info/src/format_inferred_type_info.rs:806-1007 | crates/biome_js_type_info/src/format_type_info.rs:454-675 \u2014 These two members are one piece of code written twice and then edited apart: 202 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/biome_js_type_info/src/format_inferred_type_info.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"18e92243834197194fb88efff175a30f8d35dc6ebcc8394ef4200edee1efdeb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (90 corresponding lines): crates/biome_html_analyze/src/lint/nursery/no_obsolete_attributes.rs:173-262 | crates/biome_js_analyze/src/lint/nursery/no_obsolete_attributes.rs:175-264 \u2014 These two members are one piece of code written twice and then edited apart: 90 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/biome_html_analyze/src/lint/nursery/no_obsolete_attributes.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"019e6fdb790ace88969e3b55ebf3ea02621bf766a669f019cb06d388bf3f460a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (102 corresponding lines): crates/biome_js_analyze/src/lint/complexity/use_optional_chain.rs:907-1059 | crates/biome_js_analyze/src/lint/complexity/use_optional_chain.rs:1068-1169 \u2014 These two members are one piece of code written twice and then edited apart: 102 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/biome_js_analyze/src/lint/complexity/use_optional_chain.rs"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb579ac0334f16cec456e72448d629da20c7d49dff1708ac9d00f64b1c99c7b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (76 corresponding lines): crates/biome_module_graph/src/db/type_inference/expressions.rs:2957-3043 | crates/biome_module_graph/src/db/type_inference/expressions.rs:3049-3124 \u2014 These two members are one piece of code written twice and then edited apart: 76 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":2957}}}],"partialFingerprints":{"codehealthFindingId/v1":"a09d71854fac061a962720570c84b2712044db6066278db9587a0e6d2f5d7128"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (87 corresponding lines): crates/biome_markdown_parser/src/syntax/list.rs:891-995 | crates/biome_markdown_parser/src/syntax/list.rs:1306-1392 \u2014 These two members are one piece of code written twice and then edited apart: 87 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"020e479d5e613e1ac3cabaaa5d0d7e8f0d2b41c948ad5b893777c644c75fe2c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (88 corresponding lines): crates/biome_syntax_codegen/src/generate_nodes.rs:1009-1100 | xtask/codegen/src/generate_nodes.rs:1056-1143 \u2014 These two members are one piece of code written twice and then edited apart: 88 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/biome_syntax_codegen/src/generate_nodes.rs"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8008a78987d55af26646cf163b7f6601c755752f73e8f902fe3ffa6ae306730"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (52 corresponding lines): crates/biome_cli/src/execute/migrate/eslint_to_biome.rs:87-139 | crates/biome_cli/src/execute/migrate/stylelint_to_biome.rs:77-128 \u2014 These two members are one piece of code written twice and then edited apart: 52 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/execute/migrate/eslint_to_biome.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cbeeeab8fc4e70f0e7b75dc05ba935b6c406581cc3a18c75a27a0ceeda9ac3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (80 corresponding lines): crates/biome_syntax_codegen/src/ast.rs:332-411 | xtask/codegen/src/ast.rs:370-449 \u2014 These two members are one piece of code written twice and then edited apart: 80 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/biome_syntax_codegen/src/ast.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"781a075dbf7097e23afdeac01237964df6ec77bf5d986b79196f72a39933e0fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (67 corresponding lines): crates/biome_formatter/src/lib.rs:1824-1890 | crates/biome_formatter/src/lib.rs:1900-1968 \u2014 These two members are one piece of code written twice and then edited apart: 67 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/biome_formatter/src/lib.rs"},"region":{"startLine":1824}}}],"partialFingerprints":{"codehealthFindingId/v1":"414e7dbc9e266b0d501f0563c781f964c828570f564b09d457d4e17246b44f5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (69 corresponding lines): xtask/codegen/src/generate_migrate_eslint.rs:13-81 | xtask/codegen/src/generate_migrate_stylelint.rs:13-81 \u2014 These two members are one piece of code written twice and then edited apart: 69 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/generate_migrate_eslint.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a7dce39e958b909b4169b141e8b5993f01cc8270b6b330108d325298a272e17"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (66 corresponding lines): crates/biome_module_graph/src/db/queries/js_scc.rs:90-163 | crates/biome_module_graph/src/db/type_inference/resolver.rs:156-221 \u2014 These two members are one piece of code written twice and then edited apart: 66 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/biome_module_graph/src/db/queries/js_scc.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"f703424ddeadcd37d9000993cbac86ad4ce29113d2a35c04698c5c4c6cd484d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (69 corresponding lines): crates/biome_html_analyze/src/lint/nursery/no_astro_conflicting_set_directives.rs:66-135 | crates/biome_js_analyze/src/lint/nursery/no_astro_conflicting_set_directives.rs:61-129 \u2014 These two members are one piece of code written twice and then edited apart: 69 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/biome_html_analyze/src/lint/nursery/no_astro_conflicting_set_directives.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"10740d5f8c4148fd8ea0f832fd458de4b98810838378c99ed383db308d8b9b94"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): crates/biome_js_control_flow/src/nodes/break_stmt.rs:24-79 | crates/biome_js_control_flow/src/nodes/continue_stmt.rs:21-67 \u2014 These two members are one piece of code written twice and then edited apart: 47 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_control_flow/src/nodes/break_stmt.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"f619138398027acad410e8cae0754e2f652474eb64d4e45e076df04ec1fd0d10"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (79 corresponding lines): crates/biome_formatter/src/trivia.rs:328-406 | crates/biome_html_formatter/src/verbatim.rs:405-486 \u2014 These two members are one piece of code written twice and then edited apart: 79 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/biome_formatter/src/trivia.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"34c815857e389a3220cfb3c3c809bfe825fc020a437015c32c470e463006be2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): crates/biome_html_analyze/src/lint/style/use_vue_consistent_v_bind_style.rs:136-181 | crates/biome_html_analyze/src/lint/style/use_vue_consistent_v_on_style.rs:135-192 \u2014 These two members are one piece of code written twice and then edited apart: 46 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/style/use_vue_consistent_v_bind_style.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"f409001c22a23ce5026ae5b4e92891662f8f3ae06ed1c28f2af97e75439d3a04"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (57 corresponding lines): crates/biome_js_analyze/src/lint/nursery/no_array_for_each.rs:217-273 | crates/biome_js_analyze/src/utils/indexed_collection.rs:14-82 \u2014 These two members are one piece of code written twice and then edited apart: 57 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/biome_js_analyze/src/lint/nursery/no_array_for_each.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"43235de0293716f41559ab5a44f4d0426a90b2271415c2c1dc6a127c9659f629"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (70 corresponding lines): crates/biome_js_formatter/src/jsx/attribute/spread_attribute.rs:13-84 | crates/biome_js_formatter/src/jsx/auxiliary/spread_child.rs:13-82 \u2014 These two members are one piece of code written twice and then edited apart: 70 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/jsx/attribute/spread_attribute.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c0f1f189fb99bbc0ad2eb2ed135743b2bc8e4359c032d49681807de0f56f002"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (58 corresponding lines): crates/biome_js_analyze/src/lint/nursery/no_restricted_dependencies.rs:89-146 | crates/biome_json_analyze/src/lint/nursery/no_restricted_dependencies.rs:88-148 \u2014 These two members are one piece of code written twice and then edited apart: 58 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/biome_js_analyze/src/lint/nursery/no_restricted_dependencies.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"375b25b96f44fe6630ddead1622fd4dff9c90dbbf76cc235696ca2cbc7fa2096"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): crates/biome_js_type_info/src/format_inferred_type_info.rs:473-515 | crates/biome_js_type_info/src/format_type_info.rs:388-435 \u2014 These two members are one piece of code written twice and then edited apart: 43 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/biome_js_type_info/src/format_inferred_type_info.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc0464a69db14102ef50a1210259f25a2b28ac27e892e3077a2c516370d92d93"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (61 corresponding lines): crates/biome_html_analyze/src/lint/a11y/use_valid_aria_values.rs:109-169 | crates/biome_js_analyze/src/lint/a11y/use_valid_aria_values.rs:96-188 \u2014 These two members are one piece of code written twice and then edited apart: 61 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/a11y/use_valid_aria_values.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5daa1d7566516e5055422e5a41f84e2ada13fe7c72fa5ca4d2bd9d22519a56f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (60 corresponding lines): crates/biome_analyze/src/analyzer_plugin.rs:144-203 | crates/biome_analyze/src/analyzer_plugin.rs:267-327 \u2014 These two members are one piece of code written twice and then edited apart: 60 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_analyze/src/analyzer_plugin.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"a90348b208f9aa1208e1f6dff473ab4526f3b346dab75a93d4b15cc2153d461d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): crates/biome_js_analyze/src/lint/correctness/use_single_js_doc_asterisk.rs:143-182 | crates/biome_js_analyze/src/lint/suspicious/no_ts_ignore.rs:110-147 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/use_single_js_doc_asterisk.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e2d9b07e07e45c29f1a4ecbbbaa3c9abcb105c0ac9d22aafb289c413e7e7cbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (53 corresponding lines): crates/biome_module_graph/src/db/type_inference/expressions.rs:1053-1105 | crates/biome_module_graph/src/db/type_inference/resolver.rs:1021-1092 \u2014 These two members are one piece of code written twice and then edited apart: 53 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a32cf1348f08d19c1389a5973a8093df5a861409caf78b8680093fbc18aa2c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (54 corresponding lines): crates/biome_js_type_info/src/local_inference.rs:91-144 | crates/biome_js_type_info/src/local_inference.rs:209-263 \u2014 These two members are one piece of code written twice and then edited apart: 54 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/local_inference.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a801c4142c1e53a635f11f7bf7828c5de9a026976147b10c546e1c2fd35323d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 36\u002B corresponding lines): crates/biome_languages/src/lib.rs:141-186 | crates/biome_languages/src/lib.rs:196-244 | crates/biome_languages/src/lib.rs:255-290 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 36 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/biome_languages/src/lib.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"d560e23bfc0850bd083994ae66d0316db819bb96b37b80327b1914835d68566d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): crates/biome_js_analyze/src/assist/source/no_duplicate_classes.rs:125-180 | crates/biome_js_analyze/src/tailwind.rs:23-69 \u2014 These two members are one piece of code written twice and then edited apart: 47 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/assist/source/no_duplicate_classes.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5053b8ed17087784f20cfc7e9126e81c45d2ffe5053515639609f92c9efcb40"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (58 corresponding lines): crates/biome_markdown_parser/src/to_html.rs:75-132 | crates/biome_markdown_syntax/src/block_ext.rs:172-231 \u2014 These two members are one piece of code written twice and then edited apart: 58 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/biome_markdown_parser/src/to_html.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fa6dfb6db2fae3dad3f2fba423f64273a039b43ece7a210cc731cef9138f2eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): crates/biome_html_analyze/src/lint/nursery/no_disabled_attribute.rs:154-200 | crates/biome_js_analyze/src/lint/nursery/no_disabled_attribute.rs:150-196 \u2014 These two members are one piece of code written twice and then edited apart: 47 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/nursery/no_disabled_attribute.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c7ded8369e7dd499aa9fcdb7c29af06f2879916e431e597dfa371836d7b76e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (63 corresponding lines): crates/biome_cli/src/commands/check.rs:252-316 | crates/biome_cli/src/commands/ci.rs:175-237 \u2014 These two members are one piece of code written twice and then edited apart: 63 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/commands/check.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"67fd187fa031e7f079c793e3a516936b805c18eb83dc079adfc68168529eda24"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): crates/biome_js_analyze/src/assist/source/use_sorted_keys.rs:249-289 | crates/biome_json_analyze/src/assist/source/use_sorted_keys.rs:268-324 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/assist/source/use_sorted_keys.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"0545516cd5788030ea73f32ced8891834b5c196d5d87bdf411d55193a6d68dc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/biome_js_type_info/src/format_inferred_type_info.rs:600-642 | crates/biome_js_type_info/src/format_type_info.rs:903-934 \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/biome_js_type_info/src/format_inferred_type_info.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"b79fe0a3d2e149f6ae9ced03683795571d9834e95531385bc8b429b1529f7ca1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): crates/biome_service/src/file_handlers/javascript.rs:1094-1154 | crates/biome_service/src/file_handlers/javascript.rs:1160-1199 \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/biome_service/src/file_handlers/javascript.rs"},"region":{"startLine":1094}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd8242f8c2a63035d3a59dd5b4b99372e9155220a8851bf830b3c16501fb3cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): crates/biome_html_analyze/src/lint/nursery/no_invalid_file_input_accept.rs:68-114 | crates/biome_js_analyze/src/lint/nursery/no_invalid_file_input_accept.rs:65-113 \u2014 These two members are one piece of code written twice and then edited apart: 47 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/nursery/no_invalid_file_input_accept.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"b52afdbc315cbc0008a3d04a9a602e7099148a585f649236917a6937162cfc32"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (68 corresponding lines): crates/biome_grit_parser/src/lexer/mod.rs:641-715 | crates/biome_grit_parser/src/lexer/mod.rs:893-960 \u2014 These two members are one piece of code written twice and then edited apart: 68 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/biome_grit_parser/src/lexer/mod.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"078974306a53ca21360eece06f2dd7661ab518a6b01e26a7f1f4159db3f6f66f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (51 corresponding lines): crates/biome_js_type_info/src/format_inferred_type_info.rs:297-347 | crates/biome_js_type_info/src/format_type_info.rs:224-274 \u2014 These two members are one piece of code written twice and then edited apart: 51 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/format_inferred_type_info.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"07df6ec4e177748d01cff128a046fc92e226c59c858667c42b70e9f0099470b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): crates/biome_js_parser/src/syntax/pattern.rs:55-96 | crates/biome_js_parser/src/syntax/pattern.rs:147-195 \u2014 These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/biome_js_parser/src/syntax/pattern.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6dafcc3d7be5495c5c6391fac49ca867691d2dc81aefc0ae0e9848cfc096b73"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (63 corresponding lines): crates/biome_js_analyze/src/lint/style/use_export_type.rs:524-588 | crates/biome_js_analyze/src/lint/style/use_import_type.rs:849-911 \u2014 These two members are one piece of code written twice and then edited apart: 63 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_export_type.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c981cc0d6795967fc5eee0c6537c56ad7f67627c04ab01b2e6b4a426cd9395"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/biome_js_analyze/src/lint/correctness/no_invalid_builtin_instantiation.rs:139-168 | crates/biome_js_analyze/src/lint/style/use_consistent_builtin_instantiation.rs:147-176 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/no_invalid_builtin_instantiation.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a7c0366b13306bf088eba7f4c8de7a4dbf7cd816c1d6a57e533c9a4f90d549"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): xtask/codegen/src/generate_migrate_eslint.rs:127-170 | xtask/codegen/src/generate_migrate_stylelint.rs:130-179 \u2014 These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/generate_migrate_eslint.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"613107ffa4c518cfbd0329e68751d17b2d9698b113b5d262303296da2b12e4dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): crates/biome_js_type_info/src/interned_types.rs:670-713 | crates/biome_js_type_info/src/type_data.rs:450-494 \u2014 These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/interned_types.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa53658d2edaac59b0d06bea12fa1c4fd322ef4b3882b60a13bbbf984ca9e88"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): crates/biome_js_parser/src/syntax/stmt.rs:601-638 | crates/biome_js_parser/src/syntax/stmt.rs:658-709 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_parser/src/syntax/stmt.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffb760b140e06808060658344c4a5d5b03ef3a71e5fa0babcaec0851837577de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (61 corresponding lines): crates/biome_grit_parser/src/lexer/mod.rs:984-1044 | crates/biome_json_parser/src/lexer/mod.rs:750-821 \u2014 These two members are one piece of code written twice and then edited apart: 61 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_parser/src/lexer/mod.rs"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"4525694b37b0e2dd69492166644d5c90c6a106ad4a1fa7ccf56f6fbbd14cf00c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): crates/biome_module_graph/src/db/type_inference/imports.rs:134-175 | crates/biome_module_graph/src/db/type_inference/imports.rs:909-959 \u2014 These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/biome_module_graph/src/db/type_inference/imports.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"18d80bee658d0da7653e44b1e707f27778ca813c6d9b7000b3ee2faab9014fd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): crates/biome_css_analyze/src/lint/suspicious/no_duplicate_custom_properties.rs:59-97 | crates/biome_css_analyze/src/lint/suspicious/no_duplicate_properties.rs:58-106 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_analyze/src/lint/suspicious/no_duplicate_custom_properties.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd9b67b355c0a3864ffe0227ad7630f3078cbbb5b650274d108efe9198a2e5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): crates/biome_js_analyze/src/lint/nursery/no_redundant_type_constituents.rs:214-254 | crates/biome_js_analyze/src/lint/nursery/no_redundant_type_constituents.rs:256-297 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_redundant_type_constituents.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9f2e01fda35a95c3a7722ef2436ba9e1b463eef8abcce288453593ce1842a25"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): crates/biome_html_parser/src/syntax/mod.rs:1357-1396 | crates/biome_html_parser/src/syntax/mod.rs:1430-1462 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_parser/src/syntax/mod.rs"},"region":{"startLine":1357}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce07733a2eea043634341afcb2044ed3819884c4b8e8b353213ef5b39fe3347f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): crates/biome_module_graph/src/type_inference/profiling/display/compact.rs:240-288 | crates/biome_module_graph/src/type_inference/profiling/display/verbose.rs:76-122 \u2014 These two members are one piece of code written twice and then edited apart: 47 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/type_inference/profiling/display/compact.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"85df4f004418af23be0e5754f9dac92dfd4d6f49200d8c5cae6dfd32f69773e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): xtask/codegen/src/generate_migrate_eslint.rs:83-125 | xtask/codegen/src/generate_migrate_stylelint.rs:86-128 \u2014 These two members are one piece of code written twice and then edited apart: 43 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/generate_migrate_eslint.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d60d169df386c5382c2fb090a300d3cb79102c85eba46d0d725c46472a23af"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): crates/biome_markdown_formatter/src/words.rs:346-382 | crates/biome_markdown_formatter/src/words.rs:384-420 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_formatter/src/words.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b890943c54bf3476ebb0ae365f13fb21d9e9eed2b42e5598d5bb7b48f47a750"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): crates/biome_html_analyze/src/lint/a11y/use_aria_props_supported_by_role.rs:52-96 | crates/biome_js_analyze/src/lint/a11y/use_aria_props_supported_by_role.rs:58-97 \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/biome_html_analyze/src/lint/a11y/use_aria_props_supported_by_role.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc03b0654f4c1caf403462ff4ce080e8c99d46e80db5c386fcaaaf06783fd6e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): crates/biome_js_analyze/src/lint/nursery/use_iterator_zip.rs:431-470 | crates/biome_js_analyze/src/lint/nursery/use_set_size.rs:207-241 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_iterator_zip.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"d47a6f6200a2dc934164cca4f0de23d864b0bd29e4f1bdfc8bbb834e110f27b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): crates/biome_syntax_codegen/src/generate_nodes.rs:958-990 | xtask/codegen/src/generate_nodes.rs:996-1040 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_syntax_codegen/src/generate_nodes.rs"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d4fcde1d9f03fb71835f0e19dff6900aa8059724e4c803bb257e4bc0b5a3ba7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): crates/biome_module_graph/src/type_inference/profiling.rs:569-601 | crates/biome_module_graph/src/type_inference/profiling.rs:658-691 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/type_inference/profiling.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"68dc22dcd5efaad111dba5f334f1831ebcd3aec95e77a4dd9990f73ccfd6345f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): crates/biome_js_type_info/src/format_inferred_type_info.rs:519-559 | crates/biome_js_type_info/src/format_type_info.rs:830-870 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/format_inferred_type_info.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b8e96cee1763cf99de83141504c867a3312c2a21867cd779a62ca95051e91b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): crates/biome_service/src/file_handlers/html.rs:395-441 | crates/biome_service/src/file_handlers/json.rs:217-278 \u2014 These two members are one piece of code written twice and then edited apart: 47 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/html.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"97eb5dbfe147f11f4ad7c9c48a83048529e283e0c9462d42b6dc4793778b27b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): crates/biome_html_analyze/src/lint/nursery/no_undeclared_custom_properties.rs:55-95 | crates/biome_js_analyze/src/lint/nursery/no_undeclared_custom_properties.rs:48-80 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/nursery/no_undeclared_custom_properties.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"650f7f3167f6c17f9f0c405075a2725bbc6e3f078c841b52e6b8d3b840f40b3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/biome_js_analyze/src/utils.rs:21-49 | crates/biome_tailwind_syntax/src/util.rs:7-40 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/utils.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e9d52fe1889ae1f751a4d3f9517bfd922546d521c7f4a6f9aee6834830234a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/biome_json_analyze/src/assist/source/use_sorted_package_json/sorters/dependencies_meta.rs:60-89 | crates/biome_json_analyze/src/assist/source/use_sorted_package_json/sorters/helpers.rs:27-56 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_json_analyze/src/assist/source/use_sorted_package_json/sorters/dependencies_meta.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbab6a15c3add1879274e4b67864eb6a83e1b670791861bfe8957d742ef664fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/biome_html_analyze/src/lint/nursery/no_invalid_file_input_accept.rs:156-192 | crates/biome_js_analyze/src/lint/nursery/no_invalid_file_input_accept.rs:146-175 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/nursery/no_invalid_file_input_accept.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"53c61f3d6cb2d417c5ab38b7944e6e998f5a9d912ccb38ed3ed32fc04b3ecd81"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/biome_js_analyze/src/assist/source/use_sorted_keys.rs:172-203 | crates/biome_json_analyze/src/assist/source/use_sorted_keys.rs:170-215 \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/biome_js_analyze/src/assist/source/use_sorted_keys.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"b700a76bded1469e79babda78567f3c0d7dffc748012f0c2c225e1c7393f1c29"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/biome_html_analyze/src/lint/nursery/no_invalid_file_input_accept.rs:116-154 | crates/biome_js_analyze/src/lint/nursery/no_invalid_file_input_accept.rs:115-144 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/nursery/no_invalid_file_input_accept.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef8eb4341bed6ed90eb0f20db737d8f541291fb12346b6c355befe717aceb9d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): crates/biome_migrate/src/analyzers/includes.rs:25-65 | crates/biome_migrate/src/analyzers/organize_imports.rs:23-60 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_migrate/src/analyzers/includes.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3354ae69b95da5ab16a6a5bb9a1e756de85bb9932585b09c8ffe33bccaa0031"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/biome_json_analyze/src/assist/source/use_sorted_package_json/sorters/eslint_config.rs:65-96 | crates/biome_json_analyze/src/assist/source/use_sorted_package_json/sorters/helpers.rs:213-242 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_json_analyze/src/assist/source/use_sorted_package_json/sorters/eslint_config.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"88be2d0075ebba3cf72582663a20b545eaaf7680a7bb5724f10880a8e4e3edf3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/biome_css_parser/src/syntax/value/function/call.rs:114-152 | crates/biome_css_parser/src/syntax/value/function/call.rs:162-192 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_parser/src/syntax/value/function/call.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"d30bbab1e2e12a7a318a2d8e47e27e093a36e52acb0afe8a7fd6098969d014c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): crates/biome_graphql_analyze/src/lib.rs:108-143 | crates/biome_yaml_analyze/src/lib.rs:108-143 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_graphql_analyze/src/lib.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"697e5bd24828d5a8871b9b8ba12cc51a32ac2ed735a76a54d6a86be2b90c82bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): crates/biome_js_analyze/src/lint/nursery/use_nullish_coalescing.rs:554-596 | crates/biome_js_analyze/src/lint/nursery/use_nullish_coalescing.rs:601-645 \u2014 These two members are one piece of code written twice and then edited apart: 43 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/biome_js_analyze/src/lint/nursery/use_nullish_coalescing.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"48596f4e0b4d49c1bc62d4c1cfbd46fcce173432ce56131ceb66e533fe0ea70a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 42\u002B corresponding lines): crates/biome_service/src/file_handlers/astro.rs:70-112 | crates/biome_service/src/file_handlers/svelte.rs:101-142 | crates/biome_service/src/file_handlers/vue.rs:104-145 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 42 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/biome_service/src/file_handlers/astro.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea40369d3c744787805055c8025329e39353576a5c32ad0ecd1a2fb5b2dc5881"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): crates/biome_css_parser/src/lexer/scan_cursor.rs:627-664 | crates/biome_css_parser/src/lexer/scan_cursor.rs:671-724 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_parser/src/lexer/scan_cursor.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b57693f7e2487f29c4dd0ac18c076c4d624664340a1f05c180d4f4cddff54c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/biome_html_analyze/src/lint/correctness/use_vue_valid_v_html.rs:63-89 | crates/biome_html_analyze/src/lint/correctness/use_vue_valid_v_text.rs:63-90 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/correctness/use_vue_valid_v_html.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"484cfa727e9b6c607efab403076b413fb75a1feda3bf8a788059759c94c3a8e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/biome_html_parser/src/syntax/svelte.rs:27-53 | crates/biome_html_parser/src/syntax/svelte.rs:876-902 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_parser/src/syntax/svelte.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef4bfedd6a71e1159d9f91eaaa87ad164158b48fdd3dd4a1cb057fb84ced773b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): crates/biome_js_analyze/src/lint/nursery/use_regexp_exec.rs:48-86 | crates/biome_js_analyze/src/lint/suspicious/use_array_sort_compare.rs:58-95 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_regexp_exec.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"5727df87f4cbd720c9733d1583868207d3362bdbad2fb91eea9ba37e9557fe3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 30\u002B corresponding lines): crates/biome_formatter/src/comments/map.rs:73-104 | crates/biome_formatter/src/comments/map.rs:110-141 | crates/biome_formatter/src/comments/map.rs:147-176 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 30 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/biome_formatter/src/comments/map.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"281d3e7f5cb05406052b6c528a143ae6573525b96396d92666f529226651551a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/biome_js_analyze/src/frameworks/mod.rs:19-54 | crates/biome_js_analyze/src/react.rs:213-246 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/frameworks/mod.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"8508517ed039a9dca483220f659d9dcfd3866a1e2e7c642754b1000c3117bac0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/biome_yaml_parser/src/lexer/mod.rs:775-808 | crates/biome_yaml_parser/src/lexer/mod.rs:811-847 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_yaml_parser/src/lexer/mod.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"d302848a662207008ec23e36e5c2f74cb7971a69f49844bce763ffa84ef37263"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/biome_html_analyze/src/lint/a11y/no_ambiguous_anchor_text.rs:158-188 | crates/biome_js_analyze/src/lint/a11y/no_ambiguous_anchor_text.rs:169-199 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/a11y/no_ambiguous_anchor_text.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4f3938eeb83077ba574d7640ff0d449c5df2997b116b0ef3dba61b993e5a0f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/biome_html_analyze/src/lint/a11y/no_aria_unsupported_elements.rs:167-192 | crates/biome_js_analyze/src/lint/a11y/no_aria_unsupported_elements.rs:134-160 \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/biome_html_analyze/src/lint/a11y/no_aria_unsupported_elements.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a0c0b6f321917282561d45d2341f4898d513eb4e7da72c49907bfa98feed08e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): crates/biome_embeds/src/visitor.rs:1459-1491 | crates/biome_embeds/src/visitor.rs:1607-1643 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_embeds/src/visitor.rs"},"region":{"startLine":1459}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e5287e46004641b51d8532f53bc9361c02a3697474b477501aeddde679029e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): crates/biome_graphql_parser/src/lexer/mod.rs:196-239 | crates/biome_grit_parser/src/lexer/mod.rs:223-263 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_graphql_parser/src/lexer/mod.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"d986ead06e47a7d3d9d063e992b17e7a627bf941fe7fb56ffaa51ac6eeed385c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/biome_js_analyze/src/lint/style/use_export_type.rs:642-672 | crates/biome_js_analyze/src/lint/style/use_export_type.rs:679-718 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_export_type.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8ec96f3016f832e0a3113e01ff3f948912bbb202b18f48fd6f23b12cf39c892"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): crates/biome_markdown_parser/src/syntax/list.rs:1511-1545 | crates/biome_markdown_parser/src/syntax/list.rs:1547-1589 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":1511}}}],"partialFingerprints":{"codehealthFindingId/v1":"370110828a5148cb3539458d1824fa645a6def86e13c31a83d6359226e6143d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): crates/biome_cli/src/commands/check.rs:199-242 | crates/biome_cli/src/commands/lint.rs:207-252 \u2014 These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/commands/check.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f7372fbcfc9be54fedeade293b4d5484c60a059d36ff3b751bcd28d55983981"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): crates/biome_js_analyze/src/utils/batch.rs:115-150 | crates/biome_js_analyze/src/utils/batch.rs:156-191 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/utils/batch.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ec152cb472df14aedc9b6608417c911946d65ee2f0c2f75c2302bf3b3dc7cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): crates/biome_js_analyze/src/lint/suspicious/no_drizzle_delete_without_where.rs:62-98 | crates/biome_js_analyze/src/lint/suspicious/no_drizzle_update_without_where.rs:62-98 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/no_drizzle_delete_without_where.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd14bbd5d5cf56bc2e15f676dbd957e5d22cf5c81bcc19cf42d54a2ec73bcdb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): crates/biome_js_type_info/src/format_inferred_type_info.rs:215-252 | crates/biome_js_type_info/src/format_type_info.rs:184-220 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/format_inferred_type_info.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b668beb1af7be585a6e37dc3ae90210986670688fc12b39458ef9c2f60a3e47"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/biome_markdown_formatter/src/markdown/lists/inline_item_list.rs:1011-1044 | crates/biome_markdown_formatter/src/markdown/lists/inline_item_list.rs:1046-1079 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_formatter/src/markdown/lists/inline_item_list.rs"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"a23946701a481de80953a046bb1f3cc943f0beded8e7a72d888246f42ca40082"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): crates/biome_css_formatter/src/css/properties/generic_property.rs:112-150 | crates/biome_css_formatter/src/scss/auxiliary/variable_declaration.rs:96-132 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_formatter/src/css/properties/generic_property.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"befe99e9a75fd6ecce3332d263f191c63af7604be49394d406511047c1e07ad1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): crates/biome_html_analyze/src/lint/nursery/no_astro_conflicting_set_directives.rs:156-194 | crates/biome_js_analyze/src/lint/nursery/no_astro_conflicting_set_directives.rs:149-189 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/nursery/no_astro_conflicting_set_directives.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"d96bd0754450223fe85e1e3fcd00393e0239ce92bb407d37940c6aa7c8f34430"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): crates/biome_css_formatter/src/comments.rs:663-699 | crates/biome_css_formatter/src/comments.rs:806-845 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_formatter/src/comments.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"e912a6f3956cdc48102bbd7268c985672201b524939bc4514af2e6fe89baba68"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/biome_html_analyze/src/lint/nursery/no_obsolete_attributes.rs:81-107 | crates/biome_js_analyze/src/lint/nursery/no_obsolete_attributes.rs:84-109 \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/biome_html_analyze/src/lint/nursery/no_obsolete_attributes.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d44c99193c51036513dae1b59032bce446815d9e975d1deb30316d7bbafd79"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/biome_markdown_formatter/src/words.rs:184-211 | crates/biome_markdown_formatter/src/words.rs:213-240 \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/biome_markdown_formatter/src/words.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbfd5d989c6ffc397ef214350cbbdd4271e64403ff16c2fa0d8a2b23694bc599"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): crates/biome_html_analyze/src/lint/style/use_vue_consistent_v_bind_style.rs:99-134 | crates/biome_html_analyze/src/lint/style/use_vue_consistent_v_on_style.rs:98-133 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/style/use_vue_consistent_v_bind_style.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dce2ddf743eea04b4cee53b84c1308554ae26dd320f31cf9acd143c0d1047c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): crates/biome_js_analyze/src/lint/suspicious/no_duplicate_class_members.rs:113-148 | crates/biome_js_analyze/src/syntax/correctness/no_duplicate_private_class_members.rs:38-78 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/no_duplicate_class_members.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d0f6ca50e687f8aef596f8d263b238f11f453746030025d05e33b966145196"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/biome_js_analyze/src/lint/nursery/no_base_to_string.rs:290-322 | crates/biome_js_analyze/src/lint/nursery/no_unsafe_plus_operands.rs:212-237 \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/biome_js_analyze/src/lint/nursery/no_base_to_string.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"a22d23d4d03cd1225422a712710f8033645a5466e0e0b65cb5c49a75bf38b947"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/biome_js_analyze/src/lint/suspicious/no_misleading_instantiator.rs:102-138 | crates/biome_js_analyze/src/lint/suspicious/no_misleading_instantiator.rs:141-169 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/no_misleading_instantiator.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ecdd94f33abf522836426c1abcd79ff1d1bd83d93a3bdee5ded53085f386eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): crates/biome_js_parser/src/syntax/module.rs:466-516 | crates/biome_js_parser/src/syntax/module.rs:1127-1165 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_parser/src/syntax/module.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"389e943517750d1322d7c3c556434abc3c7aa481a2ada7aeaeb96795a33f673f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/biome_js_parser/src/syntax/module.rs:770-794 | crates/biome_js_parser/src/syntax/module.rs:1055-1085 \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/biome_js_parser/src/syntax/module.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"50f528175fdb132582282576b808433a83956bf5c36570aae52ab92303cc6f49"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/biome_js_analyze/src/lint/nursery/use_string_starts_ends_with.rs:363-388 | crates/biome_js_analyze/src/lint/nursery/use_string_starts_ends_with.rs:399-428 \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/biome_js_analyze/src/lint/nursery/use_string_starts_ends_with.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"a02f2d3fe930b7b1e62f7b86775f9702d6e76e88bbe8470d4d9ddfd14d429c34"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/biome_js_analyze/src/lint/nursery/no_js_restricted_properties.rs:310-345 | crates/biome_js_analyze/src/lint/nursery/no_js_restricted_properties.rs:358-389 \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/biome_js_analyze/src/lint/nursery/no_js_restricted_properties.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"95031722d717581b9cb58c920926e999b46fd46c650cd21d18e0bdf156012c73"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): crates/biome_css_analyze/src/lint/nursery/use_logical_properties.rs:1300-1321 | crates/biome_css_analyze/src/lint/nursery/use_logical_properties.rs:1348-1379 | crates/biome_css_analyze/src/lint/nursery/use_logical_properties.rs:1384-1402 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_analyze/src/lint/nursery/use_logical_properties.rs"},"region":{"startLine":1300}}}],"partialFingerprints":{"codehealthFindingId/v1":"17949a7dab9063e88e99c85562e3b6549431475e9c0d474407eabf782626b691"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/biome_js_analyze/src/lint/nursery/use_string_starts_ends_with.rs:268-308 | crates/biome_js_analyze/src/lint/nursery/use_string_starts_ends_with.rs:319-352 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_string_starts_ends_with.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"5304fb321c2bf69ae7a4171acc512267fd2aa946abcd497e44f9965ca84d77fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/biome_parser/src/lexer.rs:641-673 | crates/biome_parser/src/lexer.rs:678-706 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_parser/src/lexer.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a7b265bf4a16984a76cbdf9a40b9d78d3d603f61f3028c2dbfd18d25f6c0ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): crates/biome_markdown_parser/src/syntax/mod.rs:2333-2377 | crates/biome_markdown_parser/src/syntax/mod.rs:2384-2416 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/mod.rs"},"region":{"startLine":2333}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebc44ae91102b7323c4c496bc6fce312c3672986635f463773713e8500a6f6a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/biome_cli/src/reporter/json.rs:332-354 | crates/biome_cli/src/reporter/rdjson.rs:116-139 \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/biome_cli/src/reporter/json.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"6468d9bfb71a4fbf9c876c138c919a8ccc0a633b6ab3cbcfe6b6bd6909f97e0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/biome_html_analyze/src/lint/nursery/no_undeclared_custom_properties.rs:183-203 | crates/biome_js_analyze/src/lint/nursery/no_undeclared_custom_properties.rs:161-181 \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/biome_html_analyze/src/lint/nursery/no_undeclared_custom_properties.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c450f48a5fc344399a8aeb11308b9696b8a8ea58fd271466877f4e42205aa28"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/biome_js_analyze/src/lint/correctness/no_unused_function_parameters.rs:223-248 | crates/biome_js_analyze/src/lint/correctness/no_unused_variables.rs:426-464 \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/biome_js_analyze/src/lint/correctness/no_unused_function_parameters.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f77c8f6225b2932e133ac00239957fcf3cae0cd839f383a9573272d8d0452b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): crates/biome_markdown_parser/src/syntax/list.rs:3102-3139 | crates/biome_markdown_parser/src/syntax/mod.rs:579-631 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":3102}}}],"partialFingerprints":{"codehealthFindingId/v1":"543819e90aead2ea3b0ffc947f1225e76d6aff834048555964aeff660e8c63dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 41\u002B corresponding lines): crates/biome_service/src/file_handlers/graphql.rs:359-399 | crates/biome_service/src/file_handlers/grit.rs:297-337 | crates/biome_service/src/file_handlers/html.rs:654-694 | crates/biome_service/src/file_handlers/javascript.rs:659-701 | crates/biome_service/src/file_handlers/json.rs:428-470 | crates/biome_service/src/file_handlers/md.rs:379-419 | crates/biome_service/src/file_handlers/yaml.rs:337-377 \u2014 These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 41 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/graphql.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e6b29016fcd390b31e6c651f703ae9cb75bf2c4fa40afc429f7570927396858"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/biome_html_parser/src/syntax/astro.rs:66-106 | crates/biome_html_parser/src/syntax/svelte.rs:379-410 \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/biome_html_parser/src/syntax/astro.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae88a6df1657ffd6a0b237871d7fccd895905e015e5f3ba132dd9531f17d93b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): crates/biome_js_formatter/src/jsx/tag/closing_element.rs:10-50 | crates/biome_js_formatter/src/jsx/tag/closing_fragment.rs:10-48 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/jsx/tag/closing_element.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"552b6f8dc07d91de0ff2c4e8d8c4e73287b7b45f4a803df65e0fb54d4080eee7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/biome_js_analyze/src/lint/suspicious/no_document_import_in_page.rs:52-83 | crates/biome_js_analyze/src/lint/suspicious/no_head_import_in_document.rs:65-103 \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/biome_js_analyze/src/lint/suspicious/no_document_import_in_page.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"58981ef83b5530cb55e51b2e78a82c4ee6df0131a34e8611a54c9d4a035e1635"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/biome_js_analyze/src/lint/nursery/no_vue_deprecated_listeners.rs:71-98 | crates/biome_js_analyze/src/lint/nursery/no_vue_deprecated_scoped_slots.rs:72-99 \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/biome_js_analyze/src/lint/nursery/no_vue_deprecated_listeners.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"067b98b1d15c88845e979538036ef342bb277cf5beb5f6eb9897d54cdd2ea71e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/biome_grit_patterns/src/grit_css_parser.rs:59-83 | crates/biome_grit_patterns/src/grit_json_parser.rs:58-81 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_patterns/src/grit_css_parser.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"93954b9774ed40b0a317c882a8c497c63443dbb28cd91936456a347b713aad83"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 38\u002B corresponding lines): crates/biome_project_layout/src/project_layout.rs:285-322 | crates/biome_project_layout/src/project_layout.rs:326-363 | crates/biome_project_layout/src/project_layout.rs:374-411 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 38 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/biome_project_layout/src/project_layout.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"f99630f6eb16a4cb4124ce6f83879b7ce1aca8ef7a6bfb9c84965ab5a8f55ee3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 28\u002B corresponding lines): crates/biome_html_parser/src/syntax/vue.rs:26-63 | crates/biome_html_parser/src/syntax/vue.rs:87-114 | crates/biome_html_parser/src/syntax/vue.rs:116-143 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 28 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/biome_html_parser/src/syntax/vue.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe1756a7f5671b92971a7d501165c578b6611b98d224a8ad800f9d48ab7fd7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 29\u002B corresponding lines): crates/biome_service/src/workspace/server.rs:3326-3359 | crates/biome_service/src/workspace/server.rs:4166-4204 | crates/biome_service/src/workspace/server.rs:4207-4246 | crates/biome_service/src/workspace/server.rs:4506-4534 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 29 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/biome_service/src/workspace/server.rs"},"region":{"startLine":3326}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a54b9860ecd4306047732fc5cc782ffc53e2f0c7e87340e3e590c27ee4342df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/biome_react_compiler/src/convert_ast/modules.rs:474-502 | crates/biome_react_compiler/src/convert_ast/statements.rs:364-396 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_react_compiler/src/convert_ast/modules.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"03fe3584bfc9b8d5c55b8fa1bd0c2c2dcb504a7dad160e40d20441b0d0436974"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/biome_html_analyze/src/assist/source/use_sorted_attributes.rs:221-244 | crates/biome_js_analyze/src/assist/source/use_sorted_attributes.rs:193-220 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/assist/source/use_sorted_attributes.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"596a24eef46b7cda7576319e7c682cd91122f7a51afad40e87a8b48b838bbf78"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/biome_rowan/src/syntax/token.rs:295-318 | crates/biome_rowan/src/syntax/token.rs:326-349 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_rowan/src/syntax/token.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"f381ad3d06b0efb85e59e233ffa1d6802dfcdfcdcc4f734a7f81a5e9cb1af075"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/biome_css_formatter/src/css/auxiliary/legacy_filter_value.rs:23-45 | crates/biome_css_formatter/src/css/lists/custom_property_component_list.rs:10-33 \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/biome_css_formatter/src/css/auxiliary/legacy_filter_value.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5962813aed3db90355e2c7cde061b49166a3bca41d1e095b22b99ac4b7984b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/biome_js_analyze/src/lint/complexity/no_flat_map_identity.rs:156-186 | crates/biome_js_analyze/src/lint/complexity/use_flat_map.rs:108-136 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/complexity/no_flat_map_identity.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"9545f910407954a27c024dd1a5a8a7674e91137ecd623c5e0f05e7ec0c34e54d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): crates/biome_js_formatter/src/js/module/import_default_clause.rs:11-45 | crates/biome_js_formatter/src/js/module/import_namespace_clause.rs:11-45 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/js/module/import_default_clause.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"126907755c419bb1d2f468b890da31430e616b72918ec61894171a78b744043b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): crates/biome_languages/src/lib.rs:458-479 | crates/biome_languages/src/lib.rs:487-508 | crates/biome_languages/src/lib.rs:517-537 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_languages/src/lib.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"2640fd2c7bd69a64f1e7d6865d563e11166b86a81d26e39992faf2059361d328"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): xtask/codegen/src/generate_global_types/lower/overrides.rs:640-665 | xtask/codegen/src/generate_global_types/lower/overrides.rs:1063-1095 \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":"xtask/codegen/src/generate_global_types/lower/overrides.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ef538107f1fbc08e487c8994bdc96e453f0d5be32928f0ff989b0d407a9b1e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/biome_markdown_parser/src/to_html.rs:242-284 | crates/biome_ruledoc/src/lower.rs:144-177 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/to_html.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"267bcdcdf13dc7b5a912444f0ae44776d1230722c4708060caedab7e2f1f358f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): xtask/codegen/src/generate_migrate_eslint.rs:193-220 | xtask/codegen/src/generate_migrate_stylelint.rs:202-229 \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":"xtask/codegen/src/generate_migrate_eslint.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"345818d2437d4adccdd373a1bc6647110760adee64126cc0a5e55365ccccd3ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/biome_html_analyze/src/lint/a11y/use_valid_aria_role.rs:89-116 | crates/biome_js_analyze/src/lint/a11y/use_valid_aria_role.rs:111-143 \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/biome_html_analyze/src/lint/a11y/use_valid_aria_role.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"d437aa575c5007939447573492c8214aded9167be3d74f90e45999fa5744b5ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/biome_html_analyze/src/lint/a11y/use_valid_autocomplete.rs:69-97 | crates/biome_js_analyze/src/lint/a11y/use_valid_autocomplete.rs:70-102 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/a11y/use_valid_autocomplete.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a7f08767d6a89fd75ad4f653da7ff2f902014cfa6b0adfde4c8f30c8fc88a73"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/biome_js_analyze/src/lint/correctness/no_string_case_mismatch.rs:96-119 | crates/biome_js_analyze/src/lint/correctness/use_valid_typeof.rs:181-208 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/no_string_case_mismatch.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fcecd45a390e5009a34a0479bc60b67ca59aa5df6367f1b362442d3c9a9e657"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/biome_markdown_parser/src/syntax/list.rs:1454-1480 | crates/biome_markdown_parser/src/syntax/quote.rs:749-780 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":1454}}}],"partialFingerprints":{"codehealthFindingId/v1":"1176d3f3ae96e3b737c1ce3bad9d3eba1151d7fded879a25681215985ab3aefe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/biome_grit_patterns/src/grit_built_in_functions.rs:506-523 | crates/biome_grit_patterns/src/grit_built_in_functions.rs:545-561 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_patterns/src/grit_built_in_functions.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd8fe5f152478bde10a1c801e4e30f6cd4ec6df4051c13a1e0a839d71f0f1030"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/biome_js_type_info/src/format_inferred_type_info.rs:674-695 | crates/biome_js_type_info/src/format_type_info.rs:679-703 \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/biome_js_type_info/src/format_inferred_type_info.rs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3dad77f9a964c3aaf86962477876f0d23c6bb3d5c7e2b1f7394c078f0e5656b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/biome_parser/src/parse_lists.rs:152-186 | crates/biome_tailwind_parser/src/syntax/variant.rs:50-79 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_parser/src/parse_lists.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"249d90ac2ad97e83dceb67d5bc2eaf031aa267c1c44f86c58af41d2dd7b7f40b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): crates/biome_html_analyze/src/lint/correctness/use_vue_valid_v_else.rs:130-185 | crates/biome_html_analyze/src/lint/correctness/use_vue_valid_v_if.rs:121-167 \u2014 These two members are one piece of code written twice and then edited apart: 47 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/correctness/use_vue_valid_v_else.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"18a085892870c2bf6a6176325178c8238eec7f318065d15b1b751baee7dd6d57"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/biome_languages/src/javascript.rs:794-823 | crates/biome_languages/src/lib.rs:306-339 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_languages/src/javascript.rs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"5659a2ed4356cdeab50c83b676178f7dc64ede688aced12e1d2343a7d3627afc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 24\u002B corresponding lines): crates/biome_grit_patterns/src/pattern_compiler/function_definition_compiler.rs:13-42 | crates/biome_grit_patterns/src/pattern_compiler/pattern_definition_compiler.rs:14-37 | crates/biome_grit_patterns/src/pattern_compiler/predicate_definition_compiler.rs:14-43 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 24 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_patterns/src/pattern_compiler/function_definition_compiler.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b855626cb1d80939c15de80a2da635648e45bdf5e30ebe4f1a41782e9b43357"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): crates/biome_html_analyze/src/lint/correctness/use_vue_valid_v_html.rs:91-128 | crates/biome_html_analyze/src/lint/correctness/use_vue_valid_v_text.rs:92-129 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/correctness/use_vue_valid_v_html.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb2855c4be9f2db51c68cb0925e8cc5b18733b211d599d8ad3a101012a17109f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/biome_js_analyze/src/lint/nursery/no_vue_ref_object_reactivity_loss.rs:244-269 | crates/biome_js_analyze/src/lint/nursery/no_vue_ref_object_reactivity_loss.rs:299-330 \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/biome_js_analyze/src/lint/nursery/no_vue_ref_object_reactivity_loss.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"082f1cf969520c361dc2d30c34ed080c4ca4890cd0b62c5c1b298c061c87af2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/biome_service/src/settings.rs:2614-2635 | crates/biome_service/src/settings.rs:2641-2665 \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/biome_service/src/settings.rs"},"region":{"startLine":2614}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e460a3ed1eb3935b733fd1c7f7dbd3f2e106cd7e8bbe1f784775509b6dd6d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/biome_vue_semantic/src/semantic_model/component.rs:1002-1027 | crates/biome_vue_semantic/src/semantic_model/component.rs:1251-1268 \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/biome_vue_semantic/src/semantic_model/component.rs"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf85ab319d92f87081ee75e8097eca31e30c63bb462d430e4383818fb8a31c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/biome_markdown_parser/src/syntax/table.rs:145-168 | crates/biome_markdown_parser/src/syntax/table.rs:170-193 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/table.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"df58b9988df4bb3aa3a4bffd56b7660f940e58214b928e9b14ae3d2bcd8b7d0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/biome_embeds/src/visitor.rs:1009-1031 | crates/biome_embeds/src/visitor.rs:1580-1602 \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/biome_embeds/src/visitor.rs"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"9185685336c66601514090652f1a70f555c8a3f486e404013941813542933d90"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/biome_js_analyze/src/lint/nursery/no_single_promise_in_promise_methods.rs:361-377 | crates/biome_js_analyze/src/lint/nursery/no_svelte_useless_derived_by.rs:260-277 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_single_promise_in_promise_methods.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"c159eee324c9604fb9adea9649fa3a8ce2fe3f5483e31c34cfa3dab2b5e2c433"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/biome_rowan/src/syntax/token.rs:235-257 | crates/biome_rowan/src/syntax/token.rs:265-287 \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/biome_rowan/src/syntax/token.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d2692ae78b1807884cf3d9688b141365f451f8437d74d30af5717a7786b159f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/biome_css_analyze/src/lint/correctness/no_unknown_media_feature_name.rs:181-210 | crates/biome_css_analyze/src/lint/correctness/no_unknown_media_feature_name.rs:212-236 \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/biome_css_analyze/src/lint/correctness/no_unknown_media_feature_name.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a94ac2bddd27d5cd5aea18b13166bae5c679fd7cf5411047105f29a08209db"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/biome_js_analyze/src/ast_utils.rs:36-54 | crates/biome_js_analyze/src/ast_utils.rs:56-74 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/ast_utils.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"db6bbace95df80588c32fa8bbf33b968169a6198b423c529e4f0392caad742ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): crates/biome_js_syntax/src/expr_ext.rs:1901-1922 | crates/biome_js_syntax/src/expr_ext.rs:1953-1973 | crates/biome_js_syntax/src/expr_ext.rs:2030-2056 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_syntax/src/expr_ext.rs"},"region":{"startLine":1901}}}],"partialFingerprints":{"codehealthFindingId/v1":"46d68f06ba713de1e7bee1c5218b4a42e6f40ea185a59d5c16d1fd0420d631cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/biome_html_analyze/src/lint/nursery/use_tailwind_shorthand_classes.rs:105-135 | crates/biome_js_analyze/src/lint/nursery/use_tailwind_shorthand_classes.rs:105-137 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/nursery/use_tailwind_shorthand_classes.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dab8e03ddeebdac51318fdd883af8b9a28981d84b0d4fbd2f32b2aa471788fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/biome_js_analyze/src/lint/nursery/use_global_regex_in_match_all.rs:79-109 | crates/biome_js_analyze/src/lint/nursery/use_global_regex_in_replace_all.rs:82-108 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_global_regex_in_match_all.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"093802aabe0f2d052f4b091d5ab232aa25b0f866b52f4701383727b54e9338b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/biome_js_analyze/src/lint/style/no_yoda_expression.rs:280-305 | crates/biome_js_analyze/src/lint/style/no_yoda_expression.rs:323-348 \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/biome_js_analyze/src/lint/style/no_yoda_expression.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"4062d00aa85a9edc195786285e9ff59ab3c6f8d001211b50c11f7486694527ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/biome_js_type_info/src/format_inferred_type_info.rs:646-670 | crates/biome_js_type_info/src/format_type_info.rs:957-974 \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/biome_js_type_info/src/format_inferred_type_info.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"74fb96e3de90566edf12a5e4f09b2ae4d345502bbbfc4d041400c82f480c8939"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/biome_js_analyze/src/lint/nursery/no_svelte_useless_derived_by.rs:182-209 | crates/biome_js_analyze/src/lint/style/use_collapsed_else_if.rs:142-170 \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/biome_js_analyze/src/lint/nursery/no_svelte_useless_derived_by.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"05df41e0490a6a403086aa18e361d73020ac6ad47cb0c68b37bcf1daddadc428"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/biome_module_graph/src/db/type_inference/imports.rs:201-228 | crates/biome_module_graph/src/db/type_inference/imports.rs:794-825 \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/biome_module_graph/src/db/type_inference/imports.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a6964dd21165764857f3405c70a87c6af4ad52a5f38d09f383abbe2a06c4a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): crates/biome_analyze/src/rule.rs:1536-1572 | crates/biome_analyze/src/rule.rs:1584-1624 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_analyze/src/rule.rs"},"region":{"startLine":1536}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff2edff4e4f07f29aab384fed984b73d1a3e8735ec3e483e6826a8f83099e4ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/biome_css_analyze/src/services/semantic.rs:79-95 | crates/biome_js_analyze/src/services/semantic.rs:106-132 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_analyze/src/services/semantic.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1f9f897a86ebe172f61bbb3bb8a923e1d317dba1f573554696f42f75409372f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/biome_html_analyze/src/lint/nursery/no_undeclared_custom_properties.rs:124-146 | crates/biome_js_analyze/src/lint/nursery/no_undeclared_custom_properties.rs:106-125 \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/biome_html_analyze/src/lint/nursery/no_undeclared_custom_properties.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe747cfcf93b339f4a81abfcc77cdb3f57f0240aa6004700944676fc9ec75d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/biome_cli/src/reporter/summary.rs:65-85 | crates/biome_cli/src/reporter/terminal.rs:60-79 \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/biome_cli/src/reporter/summary.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"185bea5ce59ff9bf11f4c35fc24c38674f3dd10184fdfd8f606aebcc9854677d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/biome_html_analyze/src/lint/a11y/no_label_without_control.rs:216-249 | crates/biome_js_analyze/src/lint/a11y/no_label_without_control.rs:214-241 \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/biome_html_analyze/src/lint/a11y/no_label_without_control.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a788f56500760f0fceeeb5dcbb7c252b8f493b5c2391cd5d8aafde22a287ad2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/biome_react_compiler/src/convert_ast/expressions.rs:870-893 | crates/biome_react_compiler/src/convert_ast/statements.rs:317-345 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_react_compiler/src/convert_ast/expressions.rs"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"2001fa18908da1628e55be706c24681911e43a91717fc181bad203d43bc58d61"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/biome_html_parser/src/syntax/svelte.rs:1268-1293 | crates/biome_html_parser/src/syntax/svelte.rs:1308-1331 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_parser/src/syntax/svelte.rs"},"region":{"startLine":1268}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e2bf1204012886cdaa8cb385410aa749822b44d3a711afda5851b2b2435b67"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/biome_js_analyze/src/frameworks/mod.rs:113-127 | crates/biome_js_analyze/src/react.rs:301-323 \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/biome_js_analyze/src/frameworks/mod.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"9320566b2d048d3436c774ae43d9bdd71515f93df1c1369e2c36ddf4d9a4dfae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/biome_module_graph/src/db/type_inference/imports.rs:670-691 | crates/biome_module_graph/src/db/type_inference/imports.rs:832-852 \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/biome_module_graph/src/db/type_inference/imports.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"530d884014dd3855ea7810839ab994df1ee77e1e3fb49a34ab0fb2607b8a2d3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/biome_html_analyze/src/lint/nursery/use_vue_valid_v_is.rs:95-122 | crates/biome_html_analyze/src/lint/nursery/use_vue_valid_v_memo.rs:81-117 \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/biome_html_analyze/src/lint/nursery/use_vue_valid_v_is.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ac770807f4ce45c2a040051058b57efcf249e235580beab911df4ab64aff14"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/biome_js_analyze/src/lint/nursery/use_consistent_json_file_read.rs:397-417 | crates/biome_js_analyze/src/lint/nursery/use_consistent_json_file_read.rs:421-439 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_consistent_json_file_read.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57df8f36ea9d21311cb938dbaf4675dbc87af3f8f6aff21db6b474439bb87ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/biome_module_graph/src/type_inference/requests/member.rs:56-74 | crates/biome_module_graph/src/type_inference/requests/member.rs:111-131 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/type_inference/requests/member.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"4664c81d25628dc4e25459aa514a63e860895a7efcaa8980229f4f3bc31e7d07"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/biome_service/src/file_handlers/html/parse_embedded_nodes.rs:946-975 | crates/biome_service/src/file_handlers/javascript.rs:785-812 \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/biome_service/src/file_handlers/html/parse_embedded_nodes.rs"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"557c7190c08e5f187d8b0cb2663331ff04733a91776a05d144dc4b6d658a6681"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/biome_html_analyze/src/lint/nursery/no_undeclared_custom_properties.rs:153-177 | crates/biome_js_analyze/src/lint/nursery/no_undeclared_custom_properties.rs:132-159 \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/biome_html_analyze/src/lint/nursery/no_undeclared_custom_properties.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce4fdc71104c79dbaf30b44d1b6b083e5e4f99b8163194250f0d7552a8eb46a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/biome_js_analyze/src/lint/nursery/use_lowercase_test_title.rs:241-263 | crates/biome_js_analyze/src/lint/nursery/use_svelte_reactive_classes.rs:478-503 \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/biome_js_analyze/src/lint/nursery/use_lowercase_test_title.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c488c4b8653182cb4ba1878040d548b738fb78b7b9603a741bbc5dcecfd0ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/biome_module_graph/src/db/type_inference/imports.rs:235-260 | crates/biome_module_graph/src/db/type_inference/imports.rs:859-887 \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/biome_module_graph/src/db/type_inference/imports.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a3c8a602d6ea394a220df9aa3774daa8cfb59926068c7f2842786ab44b8dd1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 34\u002B corresponding lines): crates/biome_service/src/file_handlers/graphql.rs:221-259 | crates/biome_service/src/file_handlers/md.rs:158-192 | crates/biome_service/src/file_handlers/yaml.rs:114-147 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 34 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/graphql.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f7776540c68ec7a5ef3f6d4cc10042befc0aeb0e0ae1f53bc45a5d3c843740"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/biome_analyze/src/diagnostics.rs:457-488 | crates/biome_analyze/src/diagnostics.rs:492-523 \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/biome_analyze/src/diagnostics.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"f90cf55438105e006ac0fe06e29c04e1866ee31e7c38f56b0efd1732171cb372"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): crates/biome_service/src/file_handlers/css.rs:211-255 | crates/biome_service/src/file_handlers/grit.rs:121-158 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/css.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c59fdaea874f362272f954c33c527c27031caf9c0f98c9c6121448240b06419"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/biome_analyze/src/categories.rs:408-436 | crates/biome_diagnostics/src/serde.rs:394-419 \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/biome_analyze/src/categories.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a445ee37094fb6f29a2cff4ff2bdc7e8fb9a1533fa13dac7d1cba89a855d15"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/biome_js_analyze/src/lint/nursery/use_vue_valid_define_emits.rs:303-331 | crates/biome_js_analyze/src/lint/nursery/use_vue_valid_define_options.rs:356-383 \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/biome_js_analyze/src/lint/nursery/use_vue_valid_define_emits.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"81748904f23cd9f1a948b00f1120d1d5a8ec7d6b677478ee442efe168890233d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/biome_js_formatter/src/js/auxiliary/module.rs:13-41 | crates/biome_js_formatter/src/js/auxiliary/script.rs:12-45 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/js/auxiliary/module.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"b06f7866def6d0b2bc51c7c0d757de40079da2ced023e3658299ba1e905d6b3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): crates/biome_cli/src/reporter/json.rs:85-105 | crates/biome_cli/src/reporter/json.rs:107-134 | crates/biome_cli/src/reporter/json.rs:136-163 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/reporter/json.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"596ab8461146c44609ce6bbb552d25f00d90654b9288ff175d05ea3038d86dd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/biome_css_parser/src/syntax/scss/at_rule/module_clauses.rs:105-134 | crates/biome_css_parser/src/syntax/scss/declaration/variable_modifier.rs:49-73 \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/biome_css_parser/src/syntax/scss/at_rule/module_clauses.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"d49a40678a1844d48a4cdef02cb889ea1d2c165c8467e3c0fc393caeedd5c9ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): crates/biome_html_analyze/src/lint/a11y/no_noninteractive_element_to_interactive_role.rs:70-107 | crates/biome_js_analyze/src/lint/a11y/no_noninteractive_element_to_interactive_role.rs:75-115 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/a11y/no_noninteractive_element_to_interactive_role.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7229d00aa3b9828ed021da08e6394f7213405acdf0735fc29454c33967b16c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): crates/biome_html_analyze/src/lint/correctness/use_vue_valid_v_cloak.rs:66-85 | crates/biome_html_analyze/src/lint/correctness/use_vue_valid_v_once.rs:67-86 | crates/biome_html_analyze/src/lint/correctness/use_vue_valid_v_pre.rs:67-86 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/correctness/use_vue_valid_v_cloak.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"767ba561866b40ec08671f59595bb5f784fbd095fbbfaf3676d36df30a842aa6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/biome_html_parser/src/syntax/svelte.rs:693-719 | crates/biome_html_parser/src/syntax/svelte.rs:725-751 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_parser/src/syntax/svelte.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a8e50014d76613ade5bc4286e76e9db569e369ac38592133dc761482590320"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/biome_js_analyze/src/lint/a11y/no_autofocus.rs:121-136 | crates/biome_js_analyze/src/lint/style/no_inferrable_types.rs:191-209 \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/biome_js_analyze/src/lint/a11y/no_autofocus.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c7dc6fd0dff7ddb35e607c9d7a17bc2e454386d497dc4371a8184e5a927bf0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/biome_js_formatter/src/js/lists/object_assignment_pattern_property_list.rs:17-45 | crates/biome_js_formatter/src/js/lists/object_binding_pattern_property_list.rs:15-43 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/js/lists/object_assignment_pattern_property_list.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a3d8ec670ebe3da7ab6457f10cff6dd9723c282c21fa452efb6e1bb2929474"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/biome_js_analyze/src/lint/nursery/no_invalid_this.rs:164-195 | crates/biome_js_analyze/src/lint/nursery/no_path_concat.rs:137-168 \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/biome_js_analyze/src/lint/nursery/no_invalid_this.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f17d2dc116d4ad7aa00860a6acedc250ed41feede2994ed96bbaf73abb625d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/biome_js_analyze/src/lint/suspicious/no_undeclared_env_vars.rs:171-190 | crates/biome_js_analyze/src/lint/suspicious/no_undeclared_env_vars.rs:196-222 \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/biome_js_analyze/src/lint/suspicious/no_undeclared_env_vars.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"583afc06d25f7c038900f8a8e1aadbdd8ca0e620724177c0420b7aa083fdf520"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 24\u002B corresponding lines): crates/biome_css_parser/src/syntax/at_rule/container/mod.rs:209-236 | crates/biome_css_parser/src/syntax/at_rule/container/mod.rs:245-272 | crates/biome_css_parser/src/syntax/at_rule/container/mod.rs:353-380 | crates/biome_css_parser/src/syntax/at_rule/container/mod.rs:386-413 | crates/biome_css_parser/src/syntax/at_rule/container/mod.rs:652-679 | crates/biome_css_parser/src/syntax/at_rule/container/mod.rs:692-719 | crates/biome_css_parser/src/syntax/at_rule/media.rs:411-434 \u2014 These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 24 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_parser/src/syntax/at_rule/container/mod.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"631d613d0e1dd77767db1183fa009f79a1ba3a666f76039b4a7e9ed651d439e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/biome_js_type_info/src/format_inferred_type_info.rs:563-589 | crates/biome_js_type_info/src/format_type_info.rs:874-899 \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/biome_js_type_info/src/format_inferred_type_info.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e5cb5ba3fde79fa4c939529f4a61de07835a0e3b1260d9b2ae5898c892f8b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/biome_resolver/src/db.rs:333-350 | crates/biome_resolver/src/db.rs:408-421 \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/biome_resolver/src/db.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d3e95cf75e57994529dfbdf4202e63f1aeb6a7a0560633da4e7db967a87273"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/biome_rowan/src/cursor/node.rs:645-670 | crates/biome_rowan/src/cursor/node.rs:676-700 \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/biome_rowan/src/cursor/node.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a94e4e2d30e6810c2440e5cf88aa46478d9fb5f8bc39959f41f3e692d388555"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/biome_rule_options/src/organize_imports/import_groups.rs:294-310 | crates/biome_rule_options/src/organize_imports/import_groups.rs:510-528 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_rule_options/src/organize_imports/import_groups.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0465739964ef265ac7fd8341e02f9cff61a48c557b11555bc851c9f8e639061"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/biome_cli/src/reporter/json.rs:392-414 | crates/biome_lsp/src/utils.rs:327-351 \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/biome_cli/src/reporter/json.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"168c1f46ee1acbaee8144eaa7054ccbbdc24c89a6f1350c9de4e77f3502561bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): crates/biome_configuration/src/analyzer/mod.rs:666-681 | crates/biome_configuration/src/analyzer/mod.rs:935-950 | crates/biome_configuration/src/analyzer/mod.rs:1003-1018 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_configuration/src/analyzer/mod.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb6e7703626594e7b5f0324778e722c15749a3a926b3ef993f634856718ae29a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/biome_html_analyze/src/lint/a11y/no_label_without_control.rs:177-208 | crates/biome_js_analyze/src/lint/a11y/no_label_without_control.rs:180-210 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/a11y/no_label_without_control.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"123add67bd869329035d0a6184f69a4e56f342ca20b7212f65ce67aebbdc12bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/biome_html_analyze/src/lint/nursery/use_vue_v_model.rs:248-266 | crates/biome_html_analyze/src/lint/nursery/use_vue_v_model.rs:270-289 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/nursery/use_vue_v_model.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c38274382f09f9cec86370b8672b0c588f2017c153531ad0521f22316ec08a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/biome_js_parser/src/syntax/module.rs:534-559 | crates/biome_js_parser/src/syntax/typescript/types.rs:1700-1727 \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/biome_js_parser/src/syntax/module.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"609a86f43a4a348e0c7bd95c93123f3c3831760fc3c7c818321259815bee6d85"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/biome_html_analyze/src/lint/a11y/no_svg_without_title.rs:208-223 | crates/biome_js_analyze/src/lint/a11y/no_svg_without_title.rs:189-204 \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/biome_html_analyze/src/lint/a11y/no_svg_without_title.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f9682ac060fcbbafc52173aff74b988c0d857713468f5d19636ec410e1a89ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/biome_html_analyze/src/lint/correctness/use_vue_valid_v_else.rs:188-214 | crates/biome_html_analyze/src/lint/correctness/use_vue_valid_v_else_if.rs:244-267 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/correctness/use_vue_valid_v_else.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"933ffa3ec89dcc23274086451d57d749c7f4030f1da0fcc56605492527fa4a11"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): crates/biome_js_type_info/src/format_inferred_type_info.rs:1133-1147 | crates/biome_js_type_info/src/format_inferred_type_info.rs:1153-1167 | crates/biome_js_type_info/src/format_type_info.rs:1031-1048 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/format_inferred_type_info.rs"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fef9c9d6bbda83d6f32b05360a711008c7595306cd6a465651766ce946ea3ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/biome_js_type_info/src/type_data.rs:1185-1205 | crates/biome_js_type_info/src/type_data.rs:1324-1346 \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/biome_js_type_info/src/type_data.rs"},"region":{"startLine":1185}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a4b34cf6ec0b80d52adbc1c977cf13f04c03a5336847dd45e97e252b8828ca7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 33\u002B corresponding lines): crates/biome_project_layout/src/project_layout.rs:170-202 | crates/biome_project_layout/src/project_layout.rs:208-240 | crates/biome_project_layout/src/project_layout.rs:246-279 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 33 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/biome_project_layout/src/project_layout.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed20e31cf87e2b78656f474ff1acc4a4d01d0d2bae4b359d9e598db41ed73d72"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/biome_css_analyze/src/lint/suspicious/no_useless_escape_in_string.rs:91-103 | crates/biome_js_analyze/src/lint/suspicious/no_useless_escape_in_string.rs:133-145 \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/biome_css_analyze/src/lint/suspicious/no_useless_escape_in_string.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d675b6b914c6e5d92b8538a213ef74476bdb2ec837be5aa93f0fc6899f0dae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/biome_js_analyze/src/lint/correctness/no_invalid_builtin_instantiation.rs:118-137 | crates/biome_js_analyze/src/lint/style/use_consistent_builtin_instantiation.rs:119-145 \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/biome_js_analyze/src/lint/correctness/no_invalid_builtin_instantiation.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"067a928ae1ac1704de0af6a1afc2c11cabb5a0e0d2c92c0c22f9cedc7a8ac7eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/biome_html_analyze/src/lint/nursery/no_unsafe_iframe_sandbox.rs:52-79 | crates/biome_js_analyze/src/lint/nursery/no_unsafe_iframe_sandbox.rs:52-80 \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/biome_html_analyze/src/lint/nursery/no_unsafe_iframe_sandbox.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ccc4cc4ccb85855484b118745790615efe06c7302f7d9110d68dc9278deb8fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/biome_module_graph/src/type_inference/profiling/display/compact.rs:718-731 | crates/biome_module_graph/src/type_inference/profiling/display/verbose.rs:390-399 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/type_inference/profiling/display/compact.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d56375af9a8d6f72385fd96edea62a0cc01f03fdada40d2c643e8cb7ab2afc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): crates/biome_configuration_macros/src/lib.rs:40-66 | crates/biome_configuration_macros/src/lib.rs:89-115 | crates/biome_service/src/documentation/mod.rs:59-79 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_configuration_macros/src/lib.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a9b87a614ae0a0243614ea85fbf274914d3c7eee35accb984cb601e14077af7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/biome_css_analyze/src/lint/suspicious/use_baseline.rs:531-556 | crates/biome_css_analyze/src/lint/suspicious/use_baseline.rs:583-602 \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/biome_css_analyze/src/lint/suspicious/use_baseline.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df637474b31696647706d4de11e50006c118c349e08870936fa3eff250a73a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/biome_css_parser/src/syntax/selector/pseudo_class/identifier.rs:21-41 | crates/biome_css_parser/src/syntax/selector/pseudo_element.rs:59-79 \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/biome_css_parser/src/syntax/selector/pseudo_class/identifier.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cfd540ca708f89c986a4ab93e417278579293b4a1516d82a70f00482c030d72"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/biome_js_analyze/src/lint/correctness/no_void_elements_with_children.rs:359-382 | crates/biome_js_analyze/src/lint/correctness/no_void_elements_with_children.rs:384-406 \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/biome_js_analyze/src/lint/correctness/no_void_elements_with_children.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b302da87e21d7023ed52b8976c00f4f57dc9ddee2e4d354dc8a89dd06ec6985"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/biome_js_type_info/src/format_inferred_type_info.rs:1247-1263 | crates/biome_js_type_info/src/format_type_info.rs:1130-1146 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/format_inferred_type_info.rs"},"region":{"startLine":1247}}}],"partialFingerprints":{"codehealthFindingId/v1":"59fc26259f07f1fe1fd01af83e944b6da35d3a0ebaa4a38a97e258031ec9ac57"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/biome_js_type_info/src/interned_types.rs:1859-1887 | crates/biome_js_type_info/src/interned_types.rs:3082-3107 \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/biome_js_type_info/src/interned_types.rs"},"region":{"startLine":1859}}}],"partialFingerprints":{"codehealthFindingId/v1":"57bab4f4693cf85e9cb8c6239039e3feeb0551b08c5715e87bd688cca567f005"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): crates/biome_service/src/settings.rs:500-518 | crates/biome_service/src/settings.rs:562-581 | crates/biome_service/src/settings.rs:598-616 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/settings.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"8043af29e5ff037526f3d514bac2ea414bf1c385014be0f14cea7218b39de6ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/biome_css_formatter/src/tailwind/auxiliary/source_inline.rs:8-41 | crates/biome_js_formatter/src/ts/classes/index_signature_class_member.rs:16-57 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_formatter/src/tailwind/auxiliary/source_inline.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"908504b368ef98f0ee6ee91b688e871ae960df1c5f145c2e562dff60f59eb09e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 28\u002B corresponding lines): crates/biome_css_parser/src/syntax/selector/pseudo_class/function_compound_selector_list.rs:29-56 | crates/biome_css_parser/src/syntax/selector/pseudo_class/function_custom_identifier_list.rs:25-55 | crates/biome_css_parser/src/syntax/selector/pseudo_class/function_relative_selector_list.rs:25-55 | crates/biome_css_parser/src/syntax/selector/pseudo_class/function_selector_list.rs:21-52 | crates/biome_css_parser/src/syntax/selector/pseudo_class/function_value_list.rs:28-55 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 28 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/biome_css_parser/src/syntax/selector/pseudo_class/function_compound_selector_list.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5beade3409166b920aa195ebb8ccb563044152435549d35a90d6dac82b43d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/biome_grit_patterns/src/pattern_compiler/accumulate_compiler.rs:15-29 | crates/biome_grit_patterns/src/pattern_compiler/accumulate_compiler.rs:38-52 \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/biome_grit_patterns/src/pattern_compiler/accumulate_compiler.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"9906f11c80d831863aac7bc5ce40407438260f04895d04d5353503b4b9f33888"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/biome_html_analyze/src/lint/a11y/use_key_with_click_events.rs:72-109 | crates/biome_js_analyze/src/lint/a11y/use_key_with_click_events.rs:69-100 \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/biome_html_analyze/src/lint/a11y/use_key_with_click_events.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e4829b065ed525ddabe948ec40385b2ea1d6f4f4f2f4b84af367a8d9d869c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/biome_js_analyze/src/frameworks/playwright.rs:421-438 | crates/biome_js_analyze/src/frameworks/playwright.rs:444-460 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/frameworks/playwright.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ca3355c6b7fa5dcfc45954935bcfc3df12c0ad5f73947b19695484f63e464fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/biome_js_analyze/src/lint/suspicious/no_then_property.rs:172-196 | crates/biome_js_analyze/src/lint/suspicious/no_then_property.rs:277-301 \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/biome_js_analyze/src/lint/suspicious/no_then_property.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"64ee7f26fca613f6b97519213be57aaf392895e754ba4b98f3901ddf67f21c39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/biome_module_graph/src/type_inference/profiling/display/compact.rs:608-635 | crates/biome_module_graph/src/type_inference/profiling/display/verbose.rs:315-346 \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/biome_module_graph/src/type_inference/profiling/display/compact.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"0593ba69d0af85810d26ddbb238f5c4e89c240e381604c94f1a069871d682ed9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/biome_graphql_analyze/src/assist/source/use_sorted_type_fields.rs:220-235 | crates/biome_graphql_analyze/src/assist/source/use_sorted_type_fields.rs:237-252 \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/biome_graphql_analyze/src/assist/source/use_sorted_type_fields.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"78665844881a4a4575b556637ecc2ca20df418fd83491a4a0b4acda0118fa96f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/biome_js_analyze/src/lint/a11y/use_anchor_content.rs:102-130 | crates/biome_js_analyze/src/lint/a11y/use_heading_content.rs:82-111 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/a11y/use_anchor_content.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d42bce5093eca312d83a0de8ae88903d1184eeaee407aabf9957eb5e55de44"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/biome_js_runtime/src/kind_set.rs:300-314 | crates/biome_js_runtime/src/kind_set.rs:373-387 \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/biome_js_runtime/src/kind_set.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"124ccf42a377bb216a9a789e8e5cc5e60654e21c03daca05e1aca89ad7dae3e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/biome_configuration_macros/src/lib.rs:11-38 | crates/biome_configuration_macros/src/lib.rs:69-87 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_configuration_macros/src/lib.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"995a8af941e59cbe8e6a48187b476e6a298a4bef16cc67c369c4028ae8ee7cf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/biome_glob/src/editorconfig.rs:132-151 | crates/biome_rule_options/src/shared/restricted_regex.rs:83-98 \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/biome_glob/src/editorconfig.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"91591aa91750f83570e16f41b6ebe145a249320d68ced7c40e7b5aee306a2463"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/biome_js_analyze/src/lint/nursery/no_vue_ref_object_reactivity_loss.rs:490-512 | crates/biome_js_analyze/src/lint/nursery/no_vue_ref_object_reactivity_loss.rs:515-538 \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/biome_js_analyze/src/lint/nursery/no_vue_ref_object_reactivity_loss.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5c03f69a4411f36f09043cd9c5c222574112fe314f36869c53063a054a5a8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/biome_markdown_parser/src/syntax/list.rs:2423-2438 | crates/biome_markdown_parser/src/syntax/list.rs:2516-2532 \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/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":2423}}}],"partialFingerprints":{"codehealthFindingId/v1":"439122ee00f53cff916842042569388ccad79aa70e8477e1316cfe0e0e0ab6ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/biome_service/src/workspace/server.rs:1327-1348 | crates/biome_service/src/workspace/server.rs:1354-1375 \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/biome_service/src/workspace/server.rs"},"region":{"startLine":1327}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f5688c4815dbc7514cc5b02dd8ce4c82894805c98385ca7920f2d4c42a31fc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/biome_tailwind_parser/src/syntax/value.rs:56-74 | crates/biome_tailwind_parser/src/syntax/value.rs:76-98 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_tailwind_parser/src/syntax/value.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"585abe05c871880881de48807abfdc9e3414e5905a0027b4ca047ab49108b3af"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/biome_graphql_analyze/src/assist/source/use_graphql_sorted_variables.rs:135-157 | crates/biome_graphql_analyze/src/utils.rs:93-115 \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/biome_graphql_analyze/src/assist/source/use_graphql_sorted_variables.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"2411df79ed23ef33d6f7ea8be48545baa49e7f07156f04e2903408f3c1b8c19d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/biome_html_analyze/src/lint/style/no_inline_styles.rs:108-126 | crates/biome_js_analyze/src/lint/style/no_inline_styles.rs:102-125 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/style/no_inline_styles.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b5912714e615ffa192eabed32414405fccd44757aabadf0f095c9c4c58539f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/biome_html_formatter/src/svelte/auxiliary/await_catch_block.rs:9-31 | crates/biome_html_formatter/src/svelte/auxiliary/await_then_block.rs:9-31 \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/biome_html_formatter/src/svelte/auxiliary/await_catch_block.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce80b82c659aee6bd47ae24811de623235f194ca44ac2909cc9a59e52ddcd7d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/biome_html_parser/src/syntax/svelte.rs:93-112 | crates/biome_html_parser/src/syntax/svelte.rs:775-798 \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/biome_html_parser/src/syntax/svelte.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"238ac65b3da6ba7b3ddf41d0e84e253e7254d6d3623159048d442f6d035c741c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/biome_js_analyze/src/lint/correctness/no_nodejs_modules.rs:57-79 | crates/biome_js_analyze/src/lint/nursery/no_bun_modules.rs:53-75 \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/biome_js_analyze/src/lint/correctness/no_nodejs_modules.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"f14b7c69a89fb8f75720e4c6ecfd8c53c07ec5e43d81ba4e83acdd46c1b48a15"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 28\u002B corresponding lines): crates/biome_css_parser/src/syntax/at_rule/supports/mod.rs:187-214 | crates/biome_css_parser/src/syntax/at_rule/supports/mod.rs:221-248 | crates/biome_css_parser/src/syntax/value/if.rs:452-479 | crates/biome_css_parser/src/syntax/value/if.rs:498-525 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 28 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/biome_css_parser/src/syntax/at_rule/supports/mod.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac0bcc1efa7b5be7509bca9e2480cdad70761cd3ccbf405a05eafad00220556b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/biome_graphql_analyze/src/lint/suspicious/no_duplicate_fields.rs:92-129 | crates/biome_js_analyze/src/lint/suspicious/no_identical_test_title.rs:125-155 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_graphql_analyze/src/lint/suspicious/no_duplicate_fields.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"68d1e64d26894aa4376b6f5b0b286734d7ee94fdadab29ae085dc5f7793bf2d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/biome_html_analyze/src/lint/a11y/use_valid_autocomplete.rs:193-216 | crates/biome_js_analyze/src/lint/a11y/use_valid_autocomplete.rs:132-155 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/a11y/use_valid_autocomplete.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae342528d0d8f6bed3bb8a3460cd9bb87fa11ea47c61ed5f72810e5f20408d64"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/biome_css_formatter/src/scss/lists/import_item_list.rs:19-45 | crates/biome_css_formatter/src/utils/media_query_comments.rs:17-36 \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/biome_css_formatter/src/scss/lists/import_item_list.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"3acdd2c00a41424cbb6c9ff848d20ca2b88ed5cd1d7979b856d1ef77aaa2589f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 34\u002B corresponding lines): crates/biome_html_analyze/src/lint/correctness/use_vue_valid_v_cloak.rs:87-120 | crates/biome_html_analyze/src/lint/correctness/use_vue_valid_v_once.rs:88-121 | crates/biome_html_analyze/src/lint/correctness/use_vue_valid_v_pre.rs:88-121 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 34 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/correctness/use_vue_valid_v_cloak.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a8d9a0c1b2bebaf3592af4aa84688075deb06ec27bd5cbb0a3e8218727724b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 27\u002B corresponding lines): crates/biome_js_formatter/src/js/module/export_named_clause.rs:13-51 | crates/biome_js_formatter/src/js/module/named_import_specifiers.rs:11-37 | crates/biome_js_formatter/src/ts/types/tuple_type.rs:10-40 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 27 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/biome_js_formatter/src/js/module/export_named_clause.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b56a7ac52c2dc9e28744bdd0eb2c0598ae80cfdef9634beaf86502e5adc4c39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/biome_js_syntax/src/expr_ext.rs:904-919 | crates/biome_js_syntax/src/expr_ext.rs:921-938 \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/biome_js_syntax/src/expr_ext.rs"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"6759d0cac55d5d408759a18cefe2528689694d36caa4bbf7b9ff95119fa2a969"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/biome_js_type_info/src/builders.rs:129-157 | crates/biome_js_type_info/src/builders.rs:634-660 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/builders.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b5f234f552cd2752e5d3c62eb61692c88a3a8383c217c5bbf57b82356df358"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/biome_markdown_parser/src/syntax/list.rs:764-790 | crates/biome_markdown_parser/src/syntax/list.rs:793-814 \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/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"30ed9e4c3b5f6202ee206a36296a47ce1f8a5c6fdd4433b67b57a2cffc24e6b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 24\u002B corresponding lines): crates/biome_module_graph/src/db/queries/type_inference/lookups.rs:43-66 | crates/biome_module_graph/src/db/queries/type_inference/promises.rs:35-59 | crates/biome_module_graph/src/db/queries/type_inference/promises.rs:81-109 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 24 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/queries/type_inference/lookups.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"a205e742338f930b405f8eb2aa233d1fa8048d06e620af83ef0eedc29268d9c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): crates/biome_module_graph/src/type_inference/profiling/display/compact.rs:736-757 | crates/biome_module_graph/src/type_inference/profiling/display/compact.rs:759-779 | crates/biome_module_graph/src/type_inference/profiling/display/compact.rs:783-799 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/type_inference/profiling/display/compact.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb6c1e2b1ec74086849380b527f063906fc7b57bfdb900830400a83bf0f99c4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/biome_console/src/markup.rs:214-234 | crates/biome_console/src/markup.rs:236-255 \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/biome_console/src/markup.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f5cf11d3f90096261274ee6729e39f964afc02c8789ad3dd750ea81f8080ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/biome_css_analyze/src/fonts.rs:233-260 | crates/biome_css_syntax/src/property_syntax/matcher.rs:124-148 \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/biome_css_analyze/src/fonts.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"76806cf6286398d20520dc5dec33b278c6ad024cc6b1933e8a95cdb20d052c45"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/biome_js_analyze/src/lint/a11y/use_html_lang.rs:79-98 | crates/biome_js_analyze/src/lint/a11y/use_iframe_title.rs:85-104 \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/biome_js_analyze/src/lint/a11y/use_html_lang.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"2253684e2c4f81833cabedf94ddc4a78a034022463fb28a76b47306f9441a2f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/biome_js_analyze/src/lint/nursery/use_modern_math_apis.rs:287-305 | crates/biome_js_analyze/src/lint/nursery/use_modern_math_apis.rs:414-430 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_modern_math_apis.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d918fec59358d727d4c0d72bf604dd11424a7bb73fcd5ce1d4c5026a0f2d1e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/biome_js_analyze/src/lint/style/use_const.rs:311-330 | crates/biome_js_analyze/src/lint/style/use_const.rs:475-494 \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/biome_js_analyze/src/lint/style/use_const.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ebb92f460e198949e8f912bc6d0a8f2cf7ea5be85b366acb36efea9657d0379"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/biome_js_type_info/src/format_inferred_type_info.rs:390-417 | crates/biome_js_type_info/src/format_inferred_type_info.rs:421-455 \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/biome_js_type_info/src/format_inferred_type_info.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae6a58c62cf12fcb630b9e5ddb31c4288b9bc900c572e7c2607bd42c6d166ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): crates/biome_css_semantic/src/semantic_model/mod.rs:13-32 | crates/biome_graphql_semantic/src/semantic_model/mod.rs:18-38 | crates/biome_js_semantic/src/semantic_model.rs:54-82 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_semantic/src/semantic_model/mod.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a24df3295136fb34a26b6168f57573d8d6ed036f4e566cf3d52dda712e85a8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/biome_html_analyze/src/lint/nursery/no_disabled_attribute.rs:536-561 | crates/biome_js_analyze/src/lint/nursery/no_disabled_attribute.rs:293-318 \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/biome_html_analyze/src/lint/nursery/no_disabled_attribute.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d0992bfd585d3ff99a3674baed87be6857c4c139699b05bb22afa9a2cda3948"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): crates/biome_js_analyze/src/lint/nursery/no_tailwind_legacy_utilities.rs:125-141 | crates/biome_js_analyze/src/lint/nursery/use_tailwind_shorthand_classes.rs:139-161 | crates/biome_js_analyze/src/lint/nursery/use_tailwind_variables_shorthand.rs:97-113 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_tailwind_legacy_utilities.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b04ebfaad1d268755a31b3734065efb4a78e7bdb6dfcd2160ee7e0ae1db4ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/biome_module_graph/src/type_inference/profiling/display/verbose.rs:244-253 | crates/biome_module_graph/src/type_inference/profiling/display/verbose.rs:294-306 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/type_inference/profiling/display/verbose.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"54688b4d7a12d1d783c917a54576920fcacc69488f11eb0295db0a017d2f3d4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/biome_rule_options/src/no_tailwind_restricted_classes.rs:60-77 | crates/biome_rule_options/src/no_tailwind_restricted_classes.rs:103-120 \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/biome_rule_options/src/no_tailwind_restricted_classes.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b795a42dbf91d35cc19b8d81bd4909b87a9e39425e26bb5ca1c0b9671aa639"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/biome_embeds/src/visitor.rs:584-607 | crates/biome_embeds/src/visitor.rs:628-648 \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/biome_embeds/src/visitor.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b91cd3a9ea3ee587605be904831a8572e8a910526cd10828f5a1fde1b8f9d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/biome_graphql_formatter/src/graphql/definitions/directive_definition.rs:14-51 | crates/biome_graphql_formatter/src/graphql/definitions/fragment_definition.rs:12-41 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_graphql_formatter/src/graphql/definitions/directive_definition.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"b308fefd6ee3b2c2ad9fc38eb1e3f31dffd2c043e3dac63622f007579a0fa63e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/biome_html_analyze/src/lint/a11y/use_button_type.rs:137-159 | crates/biome_js_analyze/src/lint/a11y/use_button_type.rs:204-228 \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/biome_html_analyze/src/lint/a11y/use_button_type.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3693c48ab18aeb96a12924cbf524d3ed96ed18431b8ce06bdf16b104f45fd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/biome_js_analyze/src/lint/nursery/no_unnecessary_string_trim.rs:157-171 | crates/biome_js_analyze/src/lint/nursery/use_string_starts_ends_with.rs:131-149 \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/biome_js_analyze/src/lint/nursery/no_unnecessary_string_trim.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb5f6bc127e20b2a3a61d1c41a9780b8b07d3ca2f495e4b761e554aa1cc811f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/biome_graphql_formatter/src/graphql/auxiliary/union_member_types.rs:51-70 | crates/biome_js_formatter/src/ts/types/union_type.rs:163-185 \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/biome_graphql_formatter/src/graphql/auxiliary/union_member_types.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"63314b7f73e33081073a6ca237ebca1fff2e35a25ebc6ff95770d7a70443464a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/biome_grit_patterns/src/grit_context.rs:321-347 | crates/biome_grit_patterns/src/grit_context.rs:354-379 \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/biome_grit_patterns/src/grit_context.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"961e3da9df5c199af67d449c0478e0031cacf73b61f57494084bf64f8d5f7c8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/biome_html_analyze/src/lint/nursery/no_undeclared_classes.rs:162-186 | crates/biome_js_analyze/src/lint/nursery/no_undeclared_classes.rs:172-196 \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/biome_html_analyze/src/lint/nursery/no_undeclared_classes.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"895ba10da354f753ce33f16f52c612c306b4ab8cd571d5bffc300c3444732294"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/biome_js_analyze/src/lint/nursery/no_dynamic_delete.rs:179-193 | crates/biome_js_analyze/src/lint/nursery/no_process_exit.rs:72-90 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_dynamic_delete.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bdc40b2116fc551b931734c32357be615cb3a3889d0f1d83ed1c5a10e0f3f40"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/biome_json_analyze/src/lint/nursery/use_package_json_cpu.rs:67-87 | crates/biome_json_analyze/src/lint/nursery/use_package_json_engines.rs:77-97 \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/biome_json_analyze/src/lint/nursery/use_package_json_cpu.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a0f8b3d4273f2a7ce8b38f51c5bd7603604c221cac17983bf227535666fdbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/biome_cli/src/service/unix.rs:82-96 | crates/biome_cli/src/service/windows.rs:31-45 \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/biome_cli/src/service/unix.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"42375879b77fc8addf14e5de414b7100b169ac3371a08cdc0c67183ad8837736"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 23\u002B corresponding lines): crates/biome_graphql_formatter/src/graphql/extensions/interface_type_extension.rs:12-44 | crates/biome_graphql_formatter/src/graphql/extensions/object_type_extension.rs:12-44 | crates/biome_js_formatter/src/ts/bindings/type_parameter.rs:10-32 \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/biome_graphql_formatter/src/graphql/extensions/interface_type_extension.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"9313b1db4a51d02290d0d834313ea6d6e9239ba3b209dac28fdeddde71350e9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/biome_html_analyze/src/lint/a11y/no_header_scope.rs:76-92 | crates/biome_js_analyze/src/lint/a11y/no_header_scope.rs:74-93 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/a11y/no_header_scope.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"acaefc7c5a9eb1cb6f9823be4d1c07f60354fa2a3fa704ff85617d746d2924a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/biome_js_type_info/src/inferred_type.rs:1548-1568 | crates/biome_js_type_info/src/inferred_type.rs:1683-1702 \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/biome_js_type_info/src/inferred_type.rs"},"region":{"startLine":1548}}}],"partialFingerprints":{"codehealthFindingId/v1":"42617062c852d914de87dad81cfd4644612c8974b2357d7550b777c818884d99"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/biome_css_formatter/src/css/statements/unknown_block_at_rule.rs:9-33 | crates/biome_css_formatter/src/css/statements/unknown_value_at_rule.rs:10-36 \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/biome_css_formatter/src/css/statements/unknown_block_at_rule.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2a408c743dfcc32f4353b136e2bd20de1003f2d8cc6beb495c03df3889eb258"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/biome_html_analyze/src/lint/a11y/use_focusable_interactive.rs:83-102 | crates/biome_js_analyze/src/lint/a11y/use_focusable_interactive.rs:82-100 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/a11y/use_focusable_interactive.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"4848183ace5c3d7f2efd1cb58e0a478bc3d728ed1ed865bdade89502e18085ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/biome_markdown_parser/src/syntax/list.rs:610-631 | crates/biome_markdown_parser/src/syntax/list.rs:1132-1153 \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/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be0358d14a6326de471b37ecd36cce18c4b41e2c047a448e9faf01289129278"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/biome_json_analyze/src/lint/nursery/use_package_json_valid_cpu.rs:208-224 | crates/biome_json_analyze/src/lint/nursery/use_package_json_valid_license.rs:176-197 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_json_analyze/src/lint/nursery/use_package_json_valid_cpu.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d9b67fc2fcca015c4832adcc415f716c1fcaf3a1ec5c189ec244d222e0a3141"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 19\u002B corresponding lines): crates/biome_service/src/file_handlers/css.rs:433-451 | crates/biome_service/src/file_handlers/graphql.rs:169-187 | crates/biome_service/src/file_handlers/html.rs:630-648 | crates/biome_service/src/file_handlers/javascript.rs:635-653 | crates/biome_service/src/file_handlers/json.rs:404-422 | crates/biome_service/src/file_handlers/md.rs:355-373 | crates/biome_service/src/file_handlers/yaml.rs:313-331 \u2014 These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/css.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"571da635643d9e2ccb90f62e7a9663762e8510889e1aa79be53d705a5af779c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/biome_yaml_formatter/src/yaml/auxiliary/flow_mapping.rs:7-30 | crates/biome_yaml_formatter/src/yaml/auxiliary/flow_sequence.rs:7-30 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_yaml_formatter/src/yaml/auxiliary/flow_mapping.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ab47c50a936d68fc2eb42926874c31dd29771826b16625634aa819eed4314a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/biome_js_analyze/src/lint/suspicious/no_alert.rs:133-148 | crates/biome_js_analyze/src/lint/suspicious/no_alert.rs:153-175 \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/biome_js_analyze/src/lint/suspicious/no_alert.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b2a4a58a6ea8f93ffbfc9750c344d30402672b8683e56190c3d45f71e5a142"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 28\u002B corresponding lines): crates/biome_js_analyze/src/utils/batch.rs:295-322 | crates/biome_js_analyze/src/utils/batch.rs:331-360 | crates/biome_js_analyze/src/utils/batch.rs:369-402 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 28 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/biome_js_analyze/src/utils/batch.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"45bd4854f2d8173c51d3e2070732f9f390596ad28953df7d94710a464741019e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/biome_lsp/src/server.rs:828-849 | crates/biome_lsp/src/server.rs:864-885 \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/biome_lsp/src/server.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"215ecb9e9b9dc498f4aa2635d50332cf5a2e0fbb4f553b61b264f306db9896f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/biome_css_parser/src/syntax/at_rule/media.rs:387-406 | crates/biome_css_parser/src/syntax/scss/at_rule/media.rs:223-242 \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/biome_css_parser/src/syntax/at_rule/media.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"139186498ff5198a8f88048ac9282a18d4706fa0646b08849d417ab95566b2e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): crates/biome_embeds/src/visitor.rs:119-137 | crates/biome_embeds/src/visitor.rs:144-162 | crates/biome_embeds/src/visitor.rs:261-277 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_embeds/src/visitor.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"22513888c4d322a728cb34a540f9efbd224dfa6017f4acd8952e95b5e08b0582"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/biome_html_analyze/src/lint/nursery/use_tailwind_sorted_classes.rs:67-82 | crates/biome_js_analyze/src/lint/nursery/use_tailwind_sorted_classes.rs:78-92 \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/biome_html_analyze/src/lint/nursery/use_tailwind_sorted_classes.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ff7dc1d5c6c9c8e1706b12ba13edb6e18cd07859d62e8f383e23270bf13e09"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/biome_js_analyze/src/lint/complexity/no_playwright_useless_await.rs:124-141 | crates/biome_js_analyze/src/lint/correctness/no_unused_labels.rs:111-122 \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/biome_js_analyze/src/lint/complexity/no_playwright_useless_await.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3be7d221ab50ebb8af4ff171e92492e4ff4d4a5254e1f37550f76e55a1fc667"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/biome_react_compiler/src/convert_ast/expressions.rs:984-1005 | crates/biome_react_compiler/src/convert_ast/modules.rs:557-573 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_react_compiler/src/convert_ast/expressions.rs"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"b07f572d5bb80c97c856b57549970e66c55274d6aba9da20a509427ed5f2c68f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/biome_css_syntax/src/property_syntax/matcher.rs:26-49 | crates/biome_css_syntax/src/property_syntax/matcher.rs:75-96 \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/biome_css_syntax/src/property_syntax/matcher.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"942cc70784e1a5f78226a4c322274107458c25fe07800d8df138b5d8b49f84b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/biome_js_analyze/src/assist/source/use_sorted_keys.rs:306-330 | crates/biome_json_analyze/src/assist/source/use_sorted_keys.rs:142-162 \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/biome_js_analyze/src/assist/source/use_sorted_keys.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"83dfa8d0a8925939f58d94983dc1afb92657f41ccc56366ae0ff8759a4acc62e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/biome_markdown_formatter/src/words.rs:296-314 | crates/biome_markdown_formatter/src/words.rs:316-334 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_formatter/src/words.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"e23a2bf8f35c850502d204a02108959c1e32bbc16d25de472a126e2271938ccf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 27\u002B corresponding lines): crates/biome_css_parser/src/syntax/selector/pseudo_class/function_compound_selector.rs:23-50 | crates/biome_css_parser/src/syntax/selector/pseudo_class/function_custom_identifier.rs:22-48 | crates/biome_css_parser/src/syntax/selector/pseudo_class/function_nth.rs:41-71 | crates/biome_css_parser/src/syntax/selector/pseudo_element.rs:86-113 | crates/biome_css_parser/src/syntax/selector/pseudo_element.rs:187-214 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 27 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/biome_css_parser/src/syntax/selector/pseudo_class/function_compound_selector.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b7201a37f8cc078635b92aaed2fa426cb4a238622484ed59650cc6a71239cee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): crates/biome_graphql_analyze/src/assist/source/use_graphql_sorted_definitions.rs:118-134 | crates/biome_graphql_analyze/src/assist/source/use_graphql_sorted_variables.rs:94-117 | crates/biome_json_analyze/src/assist/source/use_sorted_package_json.rs:308-327 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_graphql_analyze/src/assist/source/use_graphql_sorted_definitions.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b98dc35503ee598f149b266e81220e2839a018edcee706e4ad1323872fbe6da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/biome_grit_patterns/src/pattern_compiler/not_compiler.rs:19-35 | crates/biome_grit_patterns/src/pattern_compiler/not_compiler.rs:44-60 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_patterns/src/pattern_compiler/not_compiler.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f2e5e0aecb086cb6cff842b08d77f8033dad3584f0586154354a75d899d3d01"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/biome_html_analyze/src/lint/a11y/no_interactive_element_to_noninteractive_role.rs:131-143 | crates/biome_html_analyze/src/lint/a11y/no_noninteractive_element_to_interactive_role.rs:124-136 \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/biome_html_analyze/src/lint/a11y/no_interactive_element_to_noninteractive_role.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec35d55c299be47729ae150f9a0d8ee6075b288153b4a613c4cb1204a095d2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/biome_html_syntax/src/static_value.rs:52-75 | crates/biome_js_syntax/src/static_value.rs:54-75 \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/biome_html_syntax/src/static_value.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"520f6feb52290957066d8653930ac5dbfd1d5bbb80a2cd64081f2da5855dc761"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/biome_js_analyze/src/lint/a11y/no_interactive_element_to_noninteractive_role.rs:142-154 | crates/biome_js_analyze/src/lint/a11y/no_noninteractive_element_to_interactive_role.rs:132-144 \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/biome_js_analyze/src/lint/a11y/no_interactive_element_to_noninteractive_role.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1821389cd15797ab41b9be19da3d377001023d5d8f9924764e8cd4230fb64ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/biome_formatter/src/lib.rs:1237-1255 | crates/biome_formatter/src/lib.rs:1261-1282 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_formatter/src/lib.rs"},"region":{"startLine":1237}}}],"partialFingerprints":{"codehealthFindingId/v1":"9638b42d0c682aa1101ebb5248f7be67269dbac63b0b0ec7394fccb72215ecbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/biome_html_analyze/src/lint/a11y/no_label_without_control.rs:119-144 | crates/biome_js_analyze/src/lint/a11y/no_label_without_control.rs:131-156 \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/biome_html_analyze/src/lint/a11y/no_label_without_control.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"0663a469caa7e68a47fb349cc634f26407296bcd4275736d118f0ec44f71a5c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/biome_html_analyze/src/lint/correctness/no_restricted_elements.rs:88-104 | crates/biome_js_analyze/src/lint/correctness/no_restricted_elements.rs:96-112 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/correctness/no_restricted_elements.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f793780c5af8d67d56017dffe0b6df106414d54d118c5d614d3ed90070ae05"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/biome_js_analyze/src/lint/nursery/no_tanstack_query_rest_destructuring.rs:154-186 | crates/biome_yaml_analyze/src/lint/suspicious/no_empty_source.rs:128-156 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_tanstack_query_rest_destructuring.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"d37d75a8aedd85c021105df0af281a8542f2b61599b1db857cd213a07f11c7d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/biome_js_analyze/src/lint/style/use_grouped_accessor_pairs.rs:199-227 | crates/biome_js_analyze/src/lint/style/use_grouped_accessor_pairs.rs:279-305 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_grouped_accessor_pairs.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c6cf4164b414d7de78fdce38dceaf0083410fe36bdf33c0b277e6529f3dfe4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): crates/biome_css_parser/src/syntax/at_rule/tailwind.rs:108-133 | crates/biome_css_parser/src/syntax/at_rule/tailwind.rs:173-191 | crates/biome_css_parser/src/syntax/at_rule/tailwind.rs:194-224 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_parser/src/syntax/at_rule/tailwind.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c3fa865930cf5e7518b8c6bb3adb413cc1228daabbba09a4c6819b458a2ec9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/biome_html_analyze/src/lint/a11y/no_label_without_control.rs:92-117 | crates/biome_js_analyze/src/lint/a11y/no_label_without_control.rs:106-129 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/a11y/no_label_without_control.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"82924b8ed35b9a871240c087a6bce3dbcca08edf29cf2c583e858e966625a373"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): crates/biome_html_parser/src/syntax/svelte.rs:72-91 | crates/biome_html_parser/src/syntax/svelte.rs:457-486 | crates/biome_html_parser/src/syntax/svelte.rs:756-773 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_parser/src/syntax/svelte.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"29db0506248653d75be3d3e883f56e4bcd88290c25c8dc31d09a6d5d75c8b8b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/biome_js_semantic/src/semantic_model/reference.rs:22-36 | crates/biome_js_semantic/src/semantic_model/reference.rs:38-52 \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/biome_js_semantic/src/semantic_model/reference.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6d3f12af4a3ae7d45156974e9e9c427513d717a908dcd7e0cb2d453fbe5a6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/biome_service/src/db/state.rs:764-794 | crates/biome_service/src/db/state.rs:796-819 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/db/state.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcbb2a687c2ad9f21de7df3b263921779d3dcba8c4ef25c1f8635457c9b48a7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): crates/biome_css_formatter/src/context.rs:221-229 | crates/biome_graphql_formatter/src/context.rs:192-200 | crates/biome_html_formatter/src/context.rs:235-254 | crates/biome_json_formatter/src/context.rs:275-285 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_formatter/src/context.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc66cc980cfd62864201b54c73109252d07795ad5f003516807d8781db437675"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/biome_css_formatter/src/utils/string_utils.rs:257-275 | crates/biome_js_formatter/src/utils/string_utils.rs:330-348 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_formatter/src/utils/string_utils.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ede575e5393bdba5ed160e23cda557111100582f2b3818ae6d6f8a3b33f1a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/biome_js_formatter/src/js/expressions/bigint_literal_expression.rs:18-35 | crates/biome_js_formatter/src/ts/types/bigint_literal_type.rs:13-34 \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/biome_js_formatter/src/js/expressions/bigint_literal_expression.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"b722745a8604ce5355a69dcdaff9c05631bf4d187a3585046bf008f42f82a290"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/biome_rowan/src/cursor/node.rs:785-805 | crates/biome_rowan/src/cursor/node.rs:854-874 \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/biome_rowan/src/cursor/node.rs"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c33a3fee85ce94b3c62e6472f8bfefb59e7052b6dc1a255c2ab5bec2df1639"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): crates/biome_service/src/settings.rs:1111-1139 | crates/biome_service/src/settings.rs:1165-1187 | crates/biome_service/src/settings.rs:1235-1254 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/settings.rs"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e5229dbfc34411f8841ae146117ab466de71c01201a3d7f46180a44d7fa55f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 28\u002B corresponding lines): crates/biome_graphql_analyze/src/lint/correctness/no_duplicate_argument_names.rs:58-85 | crates/biome_graphql_analyze/src/lint/correctness/no_duplicate_enum_value_names.rs:79-106 | crates/biome_graphql_analyze/src/lint/correctness/no_duplicate_field_definition_names.rs:112-139 | crates/biome_graphql_analyze/src/lint/correctness/no_duplicate_input_field_names.rs:58-85 | crates/biome_graphql_analyze/src/lint/correctness/no_duplicate_variable_names.rs:59-86 | crates/biome_graphql_analyze/src/lint/suspicious/no_duplicate_graphql_operation_name.rs:80-113 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 28 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_graphql_analyze/src/lint/correctness/no_duplicate_argument_names.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f43162d363aa86245a14aa1a633fae59c7d9bb57275fa4c219fef51292dda5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/biome_grit_parser/src/parser/patterns.rs:323-342 | crates/biome_grit_parser/src/parser/patterns.rs:354-371 \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/biome_grit_parser/src/parser/patterns.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4dc65a0f2c462a5c92ba1e71e3587ac4161f64bdf4d294c220e2e79786ddd83"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/biome_html_analyze/src/lint/style/use_vue_consistent_v_bind_style.rs:73-97 | crates/biome_html_analyze/src/lint/style/use_vue_consistent_v_on_style.rs:72-96 \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/biome_html_analyze/src/lint/style/use_vue_consistent_v_bind_style.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba12f2084c9cac1e63487d2f05605d4314f6a6c65097f770c3bec436b6810a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/biome_js_analyze/src/lint/correctness/no_invalid_builtin_instantiation.rs:96-116 | crates/biome_js_analyze/src/lint/style/use_consistent_builtin_instantiation.rs:94-117 \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/biome_js_analyze/src/lint/correctness/no_invalid_builtin_instantiation.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"deec414a05b2de8c72749c068c543bcba97c2b4224c5f88ea54f2eed768c6dc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/biome_js_analyze/src/lint/correctness/no_unused_private_class_members.rs:445-466 | crates/biome_js_analyze/src/lint/style/use_readonly_class_properties.rs:363-382 \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/biome_js_analyze/src/lint/correctness/no_unused_private_class_members.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"8204b9eb9c07c2ca84e99fc249c54eb34372efb145c9c5f666e14a66382b9e9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/biome_js_analyze/src/lint/performance/use_dom_node_text_content.rs:304-324 | crates/biome_js_analyze/src/lint/performance/use_dom_node_text_content.rs:336-356 \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/biome_js_analyze/src/lint/performance/use_dom_node_text_content.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f7ebb18b7763832b2db39b8dead8da9fe52907c1ff367a30d223c5c2c4d091"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/biome_js_formatter/src/js/classes/static_initialization_block_class_member.rs:17-37 | crates/biome_js_formatter/src/ts/auxiliary/module_block.rs:11-30 \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/biome_js_formatter/src/js/classes/static_initialization_block_class_member.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"1beaeded6af9ff38b9fb79b93ee913c3451de93e45cb2d9245a4e16448662b9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): crates/biome_markdown_parser/src/syntax/header.rs:304-317 | crates/biome_markdown_parser/src/syntax/inline/emphasis.rs:821-835 | crates/biome_markdown_parser/src/syntax/mod.rs:1713-1727 \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/biome_markdown_parser/src/syntax/header.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c04226a58ec42ff6959cdb2e950266b899bf84bdcc682f5516b9f0ea6b9cf4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/biome_module_graph/src/db/queries/type_inference/lookups.rs:279-300 | crates/biome_module_graph/src/db/queries/type_inference/lookups.rs:306-326 \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/biome_module_graph/src/db/queries/type_inference/lookups.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ae69deb7fdc5911f3a248412e11c4d177b17005d120ec773611ecb8ad9dc2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): crates/biome_module_graph/src/db/queries/type_inference/calls/implementation.rs:149-163 | crates/biome_module_graph/src/db/queries/type_inference/calls/implementation.rs:437-451 | crates/biome_module_graph/src/db/queries/type_inference/calls/implementation.rs:605-633 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/queries/type_inference/calls/implementation.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"60591215cdd1fca780da1fa7d7d220bbdf11f83fb9b7d8658abc5e0b3d875bae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/biome_tailwind_parser/src/lexer/mod.rs:111-124 | crates/biome_tailwind_parser/src/lexer/mod.rs:127-140 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_tailwind_parser/src/lexer/mod.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e3e240ef5db1447341fce18ae21060e0a7fbe4083ecc6fa3d099510dd62530"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/biome_css_analyze/src/lint/nursery/no_unused_classes.rs:98-119 | crates/biome_js_analyze/src/lint/nursery/no_return_array_push.rs:150-169 \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/biome_css_analyze/src/lint/nursery/no_unused_classes.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"df410d9aa6c68fba0cf2e29eb0bd19023d6efe8e8fde3878e0e700aa110f4ce8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/biome_html_analyze/src/lint/nursery/no_non_scalable_viewport.rs:54-71 | crates/biome_js_analyze/src/lint/nursery/no_non_scalable_viewport.rs:56-74 \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/biome_html_analyze/src/lint/nursery/no_non_scalable_viewport.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7f7873ebe162cd419f5195fc91f0cbfdafd8ce3c9c54e410dc872e4734a44bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/biome_js_analyze/src/lint/correctness/use_parse_int_radix.rs:117-136 | crates/biome_js_analyze/src/lint/style/use_numeric_separators.rs:202-225 \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/biome_js_analyze/src/lint/correctness/use_parse_int_radix.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5169aa04febaea748c615b8a5037c53fd6f39b4cf89f8fbc4c37801f1b7717"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/biome_js_parser/src/syntax/object.rs:420-439 | crates/biome_js_parser/src/syntax/typescript/statement.rs:27-48 \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/biome_js_parser/src/syntax/object.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"0048cf1cf09d68498c63bf646eeafe1ccf379393bfdf9fc73ded2559f75e2370"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/biome_markdown_formatter/src/words.rs:449-465 | crates/biome_markdown_formatter/src/words.rs:467-483 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_formatter/src/words.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"bceb5448e334e3d03ad47fbd65247b2141fbca647d2658a50f53108f4ebf6b83"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/biome_markdown_parser/src/syntax/fenced_code_block.rs:557-583 | crates/biome_markdown_parser/src/syntax/mod.rs:669-697 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/fenced_code_block.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"99861a30720f40a4d2c81cbfcb2fe7aa90a1d72550baab2ae6643a1ab7599689"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/biome_react_compiler/src/convert_ast/expressions.rs:940-957 | crates/biome_react_compiler/src/convert_ast/expressions.rs:962-979 \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/biome_react_compiler/src/convert_ast/expressions.rs"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c1852dd9758a1238dc4995ffa37c8352f1aa5d574f5a031c129610c959aa54"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 16\u002B corresponding lines): crates/biome_service/src/workspace/server.rs:3276-3298 | crates/biome_service/src/workspace/server.rs:3303-3324 | crates/biome_service/src/workspace/server.rs:3361-3376 | crates/biome_service/src/workspace/server.rs:3381-3400 | crates/biome_service/src/workspace/server.rs:3402-3421 | crates/biome_service/src/workspace/server.rs:4327-4351 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/workspace/server.rs"},"region":{"startLine":3276}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7f5568270d730a71d50eee3b766d5c98fb2f109fc2f2e29df8b506942488ec7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/biome_formatter_test/src/snapshot_builder.rs:48-60 | crates/biome_formatter_test/src/snapshot_builder.rs:90-107 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_formatter_test/src/snapshot_builder.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed8a0852d1aa57575e69ca7aca4490007604eaa45cfd2c92a876e30efd86eaac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/biome_html_analyze/src/lint/a11y/use_focusable_interactive.rs:58-81 | crates/biome_js_analyze/src/lint/a11y/use_focusable_interactive.rs:61-80 \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/biome_html_analyze/src/lint/a11y/use_focusable_interactive.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f11e4cd8da09b2f1c8826bbdb093ee04881652900ab4924df0aea5f648065b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 20\u002B corresponding lines): crates/biome_html_parser/src/syntax/angular.rs:12-37 | crates/biome_html_parser/src/syntax/angular.rs:56-81 | crates/biome_html_parser/src/syntax/angular.rs:83-108 | crates/biome_html_parser/src/syntax/angular.rs:110-129 | crates/biome_html_parser/src/syntax/angular.rs:131-150 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_parser/src/syntax/angular.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f51c3219679f027092e31178c15683f4d42ca8f1f5e17c4ba8610147853979f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): crates/biome_html_parser/src/syntax/mod.rs:396-418 | crates/biome_parser/src/parse_recovery.rs:85-105 | crates/biome_parser/src/parse_recovery.rs:132-152 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_parser/src/syntax/mod.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"eadb487df1efbaac2e772a627c42d691c338888fbf427fa3c4acd4659151efa8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/biome_js_analyze/src/lint/complexity/use_arrow_function.rs:331-348 | crates/biome_js_syntax/src/parentheses/expression.rs:434-449 \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/biome_js_analyze/src/lint/complexity/use_arrow_function.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc04b4ccb252624cb99bd2585afcb82824c93c2c0bbd0d233f08ee2c0848618"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/biome_json_analyze/src/lint/suspicious/no_duplicate_object_keys.rs:78-101 | crates/biome_yaml_analyze/src/lint/nursery/no_duplicate_map_keys.rs:82-109 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_json_analyze/src/lint/suspicious/no_duplicate_object_keys.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b0f70fc15cf24bc0025a7f3c2d05b352d011d87ccc60325a01351be239cf1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/biome_markdown_parser/src/lib.rs:79-94 | crates/biome_markdown_parser/src/lib.rs:189-205 \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/biome_markdown_parser/src/lib.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c85c97e4fcada7bdca4bddd0064cbb522081e80f4fced3fa0884778abf5e78"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/biome_css_parser/src/syntax/at_rule/charset.rs:52-71 | crates/biome_css_parser/src/syntax/selector/mod.rs:782-804 \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/biome_css_parser/src/syntax/at_rule/charset.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c9c12e613eaeb6250e68f8c55456e1fbd1300ae210d33be09b3fe00ff4e73c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/biome_graphql_analyze/src/assist/source/use_sorted_enum_members.rs:184-198 | crates/biome_graphql_analyze/src/assist/source/use_sorted_selection_set.rs:233-247 \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/biome_graphql_analyze/src/assist/source/use_sorted_enum_members.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d62a57ca2b5c37f27452140bedbecceac7c3a6c5c0b4059646100f24fb6d02"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/biome_js_analyze/src/lint/complexity/use_index_of.rs:304-319 | crates/biome_js_analyze/src/lint/complexity/use_index_of.rs:339-354 \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/biome_js_analyze/src/lint/complexity/use_index_of.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f9a83e5e423c9758bf24655d0e34afb800da2dc39d0cb8f5ce3e970c95b015b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/biome_js_semantic/src/semantic_model/binding.rs:583-595 | crates/biome_js_semantic/src/semantic_model/binding.rs:598-610 \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/biome_js_semantic/src/semantic_model/binding.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"caac375b586bebf5c1cad9ebdbd2981978eb432ed9198b14577b0886c8560995"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 29\u002B corresponding lines): crates/biome_grit_parser/src/lexer/mod.rs:147-175 | crates/biome_json_parser/src/lexer/mod.rs:134-163 | crates/biome_parser/src/lexer.rs:88-117 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 29 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/biome_grit_parser/src/lexer/mod.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"6670ba19a65db5cea147f40dc3e5d7fbf9ed8903ae7ba718477e0a03cb4d5649"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/biome_html_analyze/src/lint/a11y/no_svg_without_title.rs:190-202 | crates/biome_js_analyze/src/lint/a11y/no_svg_without_title.rs:207-219 \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/biome_html_analyze/src/lint/a11y/no_svg_without_title.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"6917b347cd2779572fccc09a07f6a4882d24bc483e2258c63f71f6f780d17d34"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/biome_js_analyze/src/assist/source/organize_imports/specifiers_attributes.rs:60-77 | crates/biome_js_analyze/src/assist/source/organize_imports/specifiers_attributes.rs:293-309 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/assist/source/organize_imports/specifiers_attributes.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ae93209a1b5e0f43aef42ff89726a0976378a0f250d20d30e19cf896e1254f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/biome_js_analyze/src/lint/nursery/no_array_sort_for_min_max.rs:431-444 | crates/biome_js_analyze/src/lint/nursery/use_atomic_updates.rs:595-606 | crates/biome_js_syntax/src/expr_ext.rs:1422-1434 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_array_sort_for_min_max.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd841e474e004572827cd97e56855025baf70042f98764db9f1f0dbd02a803b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/biome_js_analyze/src/lint/nursery/no_confusing_array_splice.rs:411-424 | crates/biome_js_analyze/src/lint/nursery/no_useless_splice.rs:471-492 \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/biome_js_analyze/src/lint/nursery/no_confusing_array_splice.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"cceba3d3673b14514e51f57f683a49b5a8bcedb2b84f8f32a1add09575042a90"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/biome_service/src/db/mod.rs:442-454 | crates/biome_service/src/db/mod.rs:1128-1142 \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/biome_service/src/db/mod.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbdab241e236f9408922d4d2d0645718d64f46b9bc241afca1c1cfba8ea5031f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/biome_js_parser/src/syntax/module.rs:1416-1429 | crates/biome_js_parser/src/syntax/module.rs:1441-1453 \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/biome_js_parser/src/syntax/module.rs"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7133064d6cc72f9d04a9bf8b2fc46ac3d6aa0df2c4017fdcdd97fe12ef56e07"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 25\u002B corresponding lines): crates/biome_service/src/file_handlers/css.rs:285-310 | crates/biome_service/src/file_handlers/graphql.rs:273-298 | crates/biome_service/src/file_handlers/grit.rs:170-195 | crates/biome_service/src/file_handlers/html.rs:511-535 | crates/biome_service/src/file_handlers/javascript.rs:487-512 | crates/biome_service/src/file_handlers/json.rs:293-318 | crates/biome_service/src/file_handlers/md.rs:207-232 | crates/biome_service/src/file_handlers/yaml.rs:162-187 \u2014 These 8 members are one piece of code written 8 times and then edited apart: every two of them correspond over at least 25 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/css.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"8318fa5f305786f4ded24930b9eaa4c64be92f6b82f8365c6f74978234a5c92a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 26\u002B corresponding lines): crates/biome_service/src/file_handlers/css.rs:312-337 | crates/biome_service/src/file_handlers/graphql.rs:300-325 | crates/biome_service/src/file_handlers/grit.rs:197-222 | crates/biome_service/src/file_handlers/html.rs:457-482 | crates/biome_service/src/file_handlers/javascript.rs:514-539 | crates/biome_service/src/file_handlers/json.rs:320-345 | crates/biome_service/src/file_handlers/md.rs:234-259 | crates/biome_service/src/file_handlers/yaml.rs:189-214 \u2014 These 8 members are one piece of code written 8 times and then edited apart: every two of them correspond over at least 26 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/css.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"bffcf4dc62b2e81d38832096508f4d6b0b1f18f27c42589f486387672ce0006a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 26\u002B corresponding lines): crates/biome_service/src/file_handlers/css.rs:339-364 | crates/biome_service/src/file_handlers/graphql.rs:327-352 | crates/biome_service/src/file_handlers/grit.rs:224-249 | crates/biome_service/src/file_handlers/html.rs:484-509 | crates/biome_service/src/file_handlers/javascript.rs:541-566 | crates/biome_service/src/file_handlers/json.rs:347-372 | crates/biome_service/src/file_handlers/md.rs:261-286 | crates/biome_service/src/file_handlers/yaml.rs:216-241 \u2014 These 8 members are one piece of code written 8 times and then edited apart: every two of them correspond over at least 26 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/css.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aee4cd459536a6f0d91b7d16c2c1cfc4e3c80dc6248fb343781a03084129434"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/biome_deserialize/src/json.rs:44-61 | crates/biome_deserialize/src/yaml/mod.rs:56-73 \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/biome_deserialize/src/json.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7ef5c58fce140d30792cdb00fed02b2dd9719dfbc1f65adfcf34a6ecf39e39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/biome_html_analyze/src/lint/nursery/no_tailwind_legacy_utilities.rs:93-108 | crates/biome_js_analyze/src/lint/nursery/no_tailwind_legacy_utilities.rs:93-104 \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/biome_html_analyze/src/lint/nursery/no_tailwind_legacy_utilities.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5b3c47cec32ece35ef2ae772325e6574564768cdf99aec763e156a61df8546"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/biome_html_syntax/src/static_value.rs:31-39 | crates/biome_js_syntax/src/static_value.rs:32-41 \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/biome_html_syntax/src/static_value.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"be2d914325e1549aa6ef86bba05e9340251c574a45d64d787d84bd5ae129f199"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/biome_js_analyze/src/lint/correctness/no_unused_function_parameters.rs:108-129 | crates/biome_js_analyze/src/lint/suspicious/no_parameters_only_used_in_recursion.rs:352-368 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/no_unused_function_parameters.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a00cb3b726527c92d94c7e3682c01a6ab22a9eea32f91d7ea69f13b55ecc30"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/biome_js_analyze/src/lint/suspicious/no_global_is_finite.rs:59-76 | crates/biome_js_analyze/src/lint/suspicious/no_global_is_nan.rs:60-77 \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/biome_js_analyze/src/lint/suspicious/no_global_is_finite.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"32602a8db593942eb9ff746a14cc0aaa295891d09d375365b2a6d4fd134738cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 17\u002B corresponding lines): crates/biome_service/src/file_handlers/css.rs:408-424 | crates/biome_service/src/file_handlers/graphql.rs:144-160 | crates/biome_service/src/file_handlers/grit.rs:275-291 | crates/biome_service/src/file_handlers/html.rs:605-621 | crates/biome_service/src/file_handlers/javascript.rs:610-626 | crates/biome_service/src/file_handlers/json.rs:379-395 | crates/biome_service/src/file_handlers/md.rs:330-346 | crates/biome_service/src/file_handlers/yaml.rs:267-283 \u2014 These 8 members are one piece of code written 8 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/css.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"f87e7df4d7305a92af78abd21384c5e36198390fb972f829c5da41a414c0c22c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/biome_tailwind_parser/src/lexer/mod.rs:454-471 | crates/biome_tailwind_parser/src/lexer/mod.rs:512-539 \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/biome_tailwind_parser/src/lexer/mod.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"90edfa104ebe40d65b96e091e366c0195db3b3539a8d0941d31860878e8baa5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/biome_css_parser/src/syntax/scss/identifiers/interpolated_regular.rs:151-171 | crates/biome_css_parser/src/syntax/scss/identifiers/interpolated_selector.rs:151-173 \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/biome_css_parser/src/syntax/scss/identifiers/interpolated_regular.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"223256f3d978256bf0bb372c6f1da528c822b4eb51408da38e63d0b22a2542c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 16\u002B corresponding lines): crates/biome_graphql_parser/src/parser/definitions/enum.rs:39-57 | crates/biome_graphql_parser/src/parser/definitions/input_object.rs:40-58 | crates/biome_graphql_parser/src/parser/definitions/interface.rs:50-71 | crates/biome_graphql_parser/src/parser/definitions/object.rs:39-60 | crates/biome_graphql_parser/src/parser/definitions/scalar.rs:30-45 | crates/biome_graphql_parser/src/parser/definitions/schema.rs:38-55 | crates/biome_graphql_parser/src/parser/definitions/union.rs:44-62 \u2014 These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_graphql_parser/src/parser/definitions/enum.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"d171196d54eed2e71c9c00ecb916a7e1a92a017361ed897f307e40c15990b4ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): crates/biome_js_analyze/src/lint/a11y/no_aria_hidden_on_focusable.rs:139-150 | crates/biome_js_analyze/src/lint/a11y/no_header_scope.rs:95-108 | crates/biome_js_analyze/src/lint/a11y/no_noninteractive_tabindex.rs:135-147 | crates/biome_js_analyze/src/lint/a11y/use_valid_aria_role.rs:161-174 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/a11y/no_aria_hidden_on_focusable.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0bdfb9d74d07ef8134684f9361d8a0e6f264a3726b7451f6e1ba32a984c9e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/biome_js_analyze/src/lint/complexity/no_useless_continue.rs:108-118 | crates/biome_js_analyze/src/lint/suspicious/no_debugger.rs:69-81 \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/biome_js_analyze/src/lint/complexity/no_useless_continue.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"337a539de3e80e1475954ebe5ee708d39cc535fc6ba856e746fdc3a2d60e13c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): crates/biome_js_analyze/src/lint/nursery/use_explicit_return_type.rs:407-434 | crates/biome_js_analyze/src/lint/nursery/use_explicit_type.rs:632-652 | crates/biome_js_analyze/src/lint/nursery/use_explicit_type.rs:676-698 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_explicit_return_type.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b42e8ab7b0235f0bf75b086638c589b7bf484899126d07cc358deeec9bc997"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/biome_js_analyze/src/lint/nursery/use_vue_consistent_prop_name_casing.rs:157-175 | crates/biome_js_analyze/src/lint/nursery/use_vue_registered_component_name_casing.rs:134-152 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_vue_consistent_prop_name_casing.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ebae4b4c8b11dee1dd6e95ba54bfcd96faa6327f3d834d5a02b0e6845836a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): crates/biome_js_analyze/src/lint/style/no_playwright_wait_for_selector.rs:84-102 | crates/biome_js_analyze/src/lint/suspicious/no_playwright_wait_for_navigation.rs:79-97 | crates/biome_js_analyze/src/lint/suspicious/no_playwright_wait_for_timeout.rs:79-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 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/no_playwright_wait_for_selector.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f049b8f7957af4784e14ce0e090ccf35de77bf2e8d413df0c4c8e760b9223f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/biome_js_type_info/src/format_inferred_type_info.rs:699-721 | crates/biome_js_type_info/src/format_inferred_type_info.rs:725-749 \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/biome_js_type_info/src/format_inferred_type_info.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b465f6c05116128a1fdfb025262837b0d8c0640c968684346aba9513cc70df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/biome_js_type_info/src/local_inference.rs:3463-3483 | xtask/codegen/src/generate_global_types/collect.rs:686-706 \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/biome_js_type_info/src/local_inference.rs"},"region":{"startLine":3463}}}],"partialFingerprints":{"codehealthFindingId/v1":"f351ae187982355d0ef906f7c02a25f8066d083c81614032bb6f912585367cc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/biome_module_graph/src/format_module_graph.rs:414-438 | crates/biome_module_graph/src/format_module_graph.rs:449-469 \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/biome_module_graph/src/format_module_graph.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"2772ed00867849cf26a94937e9fe7c6aa114be482291767833fb69b55fc52e43"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/biome_graphql_analyze/src/assist/source/use_sorted_enum_members.rs:108-128 | crates/biome_graphql_analyze/src/assist/source/use_sorted_selection_set.rs:125-138 \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/biome_graphql_analyze/src/assist/source/use_sorted_enum_members.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c6be1bcafd9007a1e09d53edb0eb72afb3546a5e2c5e55802c747c3959734ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 20\u002B corresponding lines): crates/biome_module_graph/src/type_inference/profiling/display/compact.rs:394-413 | crates/biome_module_graph/src/type_inference/profiling/display/compact.rs:505-524 | crates/biome_module_graph/src/type_inference/profiling/display/verbose.rs:211-234 | crates/biome_module_graph/src/type_inference/profiling/display/verbose.rs:261-284 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/type_inference/profiling/display/compact.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e136eb4195fdad96dde37a64a4340c17f3248ac5e345c880192b7e125216a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): crates/biome_react_compiler/src/convert_ast/statements.rs:441-454 | crates/biome_react_compiler/src/convert_ast/statements.rs:459-473 | crates/biome_react_compiler/src/convert_ast/statements.rs:478-493 \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/biome_react_compiler/src/convert_ast/statements.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32629195ef5b9c033cf551c58be0e23744dfcec4c800ef5b51a56c79818776b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/biome_js_analyze/src/lint/complexity/use_math_min_max.rs:238-250 | crates/biome_js_analyze/src/lint/complexity/use_math_min_max.rs:305-317 \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/biome_js_analyze/src/lint/complexity/use_math_min_max.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d1819c0858dab87ee23c675a417ba45678320cf90cf767965e8ebc6ab2b3ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): crates/biome_js_analyze/src/lint/nursery/no_array_sort_for_min_max.rs:585-598 | crates/biome_js_analyze/src/lint/nursery/no_array_sort_for_min_max.rs:602-620 | crates/biome_vue_semantic/src/semantic_model/component.rs:2579-2597 \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/biome_js_analyze/src/lint/nursery/no_array_sort_for_min_max.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3531ab913112427d017cdb04833fa62cd869654462fac4c223973066f2c522a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/biome_js_analyze/src/lint/nursery/no_vue_deprecated_scoped_slots.rs:116-126 | crates/biome_js_analyze/src/lint/suspicious/use_namespace_keyword.rs:79-88 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_vue_deprecated_scoped_slots.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc12d48644d7d703e911a3eb4529300dc30a976fd63b6f648b8c4c2fa318b89d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/biome_js_formatter/src/ts/classes/getter_signature_class_member.rs:16-41 | crates/biome_js_formatter/src/ts/classes/setter_signature_class_member.rs:15-42 \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/biome_js_formatter/src/ts/classes/getter_signature_class_member.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f6a438ede741c33b01679ae86110f8e32e7bdfe765f341f5fa1202ed01349a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/biome_js_parser/src/syntax/typescript/types.rs:1368-1393 | crates/biome_js_parser/src/syntax/typescript/types.rs:1678-1698 \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/biome_js_parser/src/syntax/typescript/types.rs"},"region":{"startLine":1368}}}],"partialFingerprints":{"codehealthFindingId/v1":"34164924494afa2b39624b38ea288ef7b31a2d8e282f5443734cfb7a009f11df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/biome_js_runtime/src/ast.rs:295-309 | crates/biome_js_runtime/src/ast.rs:363-377 \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/biome_js_runtime/src/ast.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"22e730e680bb612b88253429351b3d07016823e5f3c0007e0083d46bac84e381"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/biome_markdown_parser/src/parser.rs:1275-1298 | crates/biome_markdown_parser/src/syntax/link_block.rs:599-615 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/parser.rs"},"region":{"startLine":1275}}}],"partialFingerprints":{"codehealthFindingId/v1":"f56d678f88edc84a61f9ce3352e84009444e802d6b56a10a73ff5f1827f9fc4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/biome_yaml_formatter/src/comments.rs:247-265 | crates/biome_yaml_formatter/src/yaml/auxiliary/root.rs:34-58 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_yaml_formatter/src/comments.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"22fdd62dac96f6ced2121ac151419b58200b51e869fdcad8747ae0b8bcb505cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/biome_css_formatter/src/comments.rs:850-866 | crates/biome_css_formatter/src/scss/auxiliary/variable_declaration.rs:191-209 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_formatter/src/comments.rs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f8a1854c72f969d6ec31be7380f0c0d2314050f2d080b45233564e39b5fe19d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/biome_grit_patterns/src/grit_binding.rs:76-87 | crates/biome_grit_patterns/src/grit_binding.rs:202-212 \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/biome_grit_patterns/src/grit_binding.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"458d0bbd1dd2eeb5666be1483d52a06c95f182b944182a455f609a2419dac6e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/biome_js_analyze/src/services/semantic_class.rs:69-80 | crates/biome_js_analyze/src/services/turborepo.rs:68-81 | crates/biome_js_analyze/src/services/vue.rs:376-387 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/services/semantic_class.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"3000aa2a69c0367845bba2577dee38e3017560990a2f08991d4846f9e1b5f820"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/biome_css_analyze/src/lint/nursery/use_logical_properties.rs:1029-1045 | crates/biome_tailwind_logic/src/class_category.rs:572-592 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_analyze/src/lint/nursery/use_logical_properties.rs"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"73052278f93d72ee82a043961784b747ab7f6b4093a537aa24939548561ea689"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/biome_html_analyze/src/lint/a11y/no_ambiguous_anchor_text.rs:75-91 | crates/biome_js_analyze/src/lint/a11y/no_ambiguous_anchor_text.rs:77-96 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/a11y/no_ambiguous_anchor_text.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc4426e2241cc3af692be3d0e461ae9f0643d1c8932e4fec17598ef6327f45b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/biome_html_analyze/src/lint/a11y/use_aria_props_for_role.rs:101-116 | crates/biome_js_analyze/src/lint/a11y/use_aria_props_for_role.rs:110-128 \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/biome_html_analyze/src/lint/a11y/use_aria_props_for_role.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2bf02f0cf17b73bfcf9c3c16e35cb26f9e9b6ca6a904fed38cd34d71a17c30c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/biome_js_parser/src/syntax/typescript/types.rs:1135-1148 | crates/biome_js_parser/src/syntax/typescript/types.rs:1150-1165 \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/biome_js_parser/src/syntax/typescript/types.rs"},"region":{"startLine":1135}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad7a25757d3c5a7c2b9a5fb3250d94f449dc4df8c6b19a4aa3306bc16e2d323"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/biome_service/src/file_handlers/svelte.rs:73-97 | crates/biome_service/src/file_handlers/vue.rs:73-100 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/svelte.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc9451cd451f3c58b9e3479ee4e0d6ade9f55e41216428ee20c0c22fdf8315c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): crates/biome_service/src/settings.rs:2671-2684 | crates/biome_service/src/settings.rs:2689-2702 | crates/biome_service/src/settings.rs:2707-2723 \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/biome_service/src/settings.rs"},"region":{"startLine":2671}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb7c429cec7c5bfce21fb2f832583a245f26c3df459da51151a97f0daf495c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/biome_html_analyze/src/lint/a11y/use_alt_text.rs:163-178 | crates/biome_js_analyze/src/lint/a11y/use_alt_text.rs:157-167 \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/biome_html_analyze/src/lint/a11y/use_alt_text.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb7d0be48913218bb6ce8911ee6a2f44ae8eae6e9b13df59d44f348a0f3a848f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/biome_html_analyze/src/lint/nursery/use_tailwind_sorted_classes.rs:95-108 | crates/biome_js_analyze/src/lint/nursery/use_tailwind_sorted_classes.rs:117-136 \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/biome_html_analyze/src/lint/nursery/use_tailwind_sorted_classes.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"af1499fd677c7797f26080751a93b85da02976994dd2768e1e6950c6bf56a681"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/biome_js_analyze/src/lint/nursery/no_xor_as_exponentiation.rs:93-103 | crates/biome_js_analyze/src/lint/style/use_const.rs:166-183 | crates/biome_js_analyze/src/lint/style/use_node_assert_strict.rs:73-88 \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/biome_js_analyze/src/lint/nursery/no_xor_as_exponentiation.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"4893b20417c652b50c815bc745d068bf8e230928e87b40b9f61022d3aec178c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/biome_markdown_parser/src/syntax/html_block.rs:329-358 | crates/biome_markdown_parser/src/syntax/html_block.rs:370-395 \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/biome_markdown_parser/src/syntax/html_block.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"769e3c140a640c8fc0ca0abe67f46b51608760ea13b608d3730c63834e34e986"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 22\u002B corresponding lines): crates/biome_css_parser/src/token_source.rs:71-95 | crates/biome_graphql_parser/src/token_source.rs:32-55 | crates/biome_html_parser/src/token_source.rs:298-321 | crates/biome_js_parser/src/token_source.rs:41-62 | crates/biome_markdown_parser/src/token_source.rs:87-115 | crates/biome_yaml_parser/src/token_source.rs:44-69 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_parser/src/token_source.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"698076c8e8d1d85c397e3cc89aab98add8218a63a02d9d5e55526e05dca5d2dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/biome_html_analyze/src/lint/nursery/no_disabled_attribute.rs:418-431 | crates/biome_html_analyze/src/lint/nursery/no_disabled_attribute.rs:437-450 \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/biome_html_analyze/src/lint/nursery/no_disabled_attribute.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"7349e819d0b3a04bfde8bab7c05cfa2afd97af0f9be925383f452815f3e93a13"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/biome_markdown_parser/src/to_html.rs:1889-1906 | crates/biome_markdown_syntax/src/text_ext.rs:44-61 \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/biome_markdown_parser/src/to_html.rs"},"region":{"startLine":1889}}}],"partialFingerprints":{"codehealthFindingId/v1":"1759e3dc06d316bde8603bc0b0447662999dd34169d33873f1f9f8b29d99fe90"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/biome_service/src/settings.rs:1143-1160 | crates/biome_service/src/settings.rs:1261-1275 \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/biome_service/src/settings.rs"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe0193e9c77b556b604cd710aa9790d00d20f81802485d7aaa539f5420a3a45"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): crates/biome_css_formatter/src/css/lists/attr_name_list.rs:35-56 | crates/biome_css_formatter/src/css/lists/syntax_component_list.rs:33-48 | crates/biome_graphql_formatter/src/graphql/lists/union_member_type_list.rs:34-49 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_formatter/src/css/lists/attr_name_list.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"796d74b5c4bc705f317f1a086072971f837e69044cb12b17ee2e8b1bb95e95ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): crates/biome_html_analyze/src/lint/nursery/no_obsolete_attributes.rs:109-127 | crates/biome_js_analyze/src/lint/a11y/use_valid_aria_props.rs:89-106 | crates/biome_js_analyze/src/lint/nursery/no_obsolete_attributes.rs:111-129 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/nursery/no_obsolete_attributes.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f4e2ef6584fcbc118805b7c60b2bc4d9f52538c937fd4fcde03d9b4193a9982"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/biome_js_analyze/src/lint/nursery/no_playwright_unsafe_references.rs:465-478 | crates/biome_js_analyze/src/lint/nursery/no_playwright_unsafe_references.rs:484-492 \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/biome_js_analyze/src/lint/nursery/no_playwright_unsafe_references.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"6332af228499f228e7b48b6d2ae089d90b954f5af660d8a0914eb29b475d74b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/biome_markdown_parser/src/syntax/fenced_code_block.rs:139-151 | crates/biome_markdown_parser/src/syntax/mod.rs:1923-1939 \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/biome_markdown_parser/src/syntax/fenced_code_block.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae5000e5339f591e777743f38f31482a6462924c04a28c935a8b26ad57582f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/biome_service/src/diagnostics.rs:638-651 | crates/biome_service/src/diagnostics.rs:653-666 \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/biome_service/src/diagnostics.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"131ef8f29374b194dc82b7f48cc0adbe05d7601af71b85ebfc6b9596522e6713"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/biome_yaml_parser/src/lexer/mod.rs:912-922 | crates/biome_yaml_parser/src/lexer/mod.rs:935-948 \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/biome_yaml_parser/src/lexer/mod.rs"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c6fc63ffb48013269befd873e97d5172181ebc4480a1bbf6238f718d4e0664"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/biome_css_formatter/src/scss/auxiliary/nesting_declaration.rs:8-30 | crates/biome_html_formatter/src/svelte/auxiliary/debug_block.rs:9-26 \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/biome_css_formatter/src/scss/auxiliary/nesting_declaration.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cac08c2d3610f4a317c5fdbbaa1cb966b4c5d8310d158feefd6de6677b6bd8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/biome_css_parser/src/syntax/at_rule/color_profile.rs:32-58 | crates/biome_css_parser/src/syntax/at_rule/counter_style.rs:32-55 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_parser/src/syntax/at_rule/color_profile.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"77ada3bf7bd9d5b0db7cada10a41c577b6715906fbc61d2df0edcc96387d4079"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 24\u002B corresponding lines): crates/biome_css_parser/src/syntax/at_rule/font_palette_values.rs:36-59 | crates/biome_css_parser/src/syntax/at_rule/position_try.rs:36-59 | crates/biome_css_parser/src/syntax/at_rule/property.rs:35-58 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 24 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_parser/src/syntax/at_rule/font_palette_values.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"569df07cc7f0ae291ad3f05b056bae90c938e8c7f517e8bbbbdd4782e5fa0102"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/biome_graphql_parser/src/parser/definitions/field.rs:76-95 | crates/biome_graphql_parser/src/parser/definitions/field.rs:152-172 \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/biome_graphql_parser/src/parser/definitions/field.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7b33d1e9eff2df7aeb01d0fbc77b6fbe3362034bc6acc737577f7cb8dc40f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/biome_grit_formatter/src/context.rs:145-152 | crates/biome_markdown_formatter/src/context.rs:257-264 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_formatter/src/context.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"33cf74711baba71bd9133482f0146283677cc973e611ef9958cff8537b9f8bcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/biome_html_analyze/src/lint/a11y/no_positive_tabindex.rs:84-102 | crates/biome_js_analyze/src/lint/a11y/no_positive_tabindex.rs:156-174 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/a11y/no_positive_tabindex.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4783c6fefa7551b3cb23f31003604ee5d41805b5c6a758488875de9eb57e328"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/biome_html_analyze/src/lint/a11y/use_valid_autocomplete.rs:99-117 | crates/biome_js_analyze/src/lint/a11y/use_valid_autocomplete.rs:104-128 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/a11y/use_valid_autocomplete.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"a663fb1b165b995220efb511cb2211b3b82c0eead9583c3bb48476f4f8672285"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): crates/biome_html_parser/src/lexer/mod.rs:535-550 | crates/biome_html_parser/src/lexer/mod.rs:619-633 | crates/biome_html_parser/src/lexer/mod.rs:636-650 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_parser/src/lexer/mod.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2d31a67fa1ce9411fd45f074a3119d5db1132de86c6164551ea19a285a86b5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/biome_js_analyze/src/lint/nursery/use_string_starts_ends_with.rs:893-903 | crates/biome_js_analyze/src/lint/nursery/use_string_starts_ends_with.rs:911-923 \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/biome_js_analyze/src/lint/nursery/use_string_starts_ends_with.rs"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"6158a760dc2c09ff4b683e54a66dc9752503a6663d8cd6657a7d242f0fb095a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 18\u002B corresponding lines): crates/biome_module_graph/src/db/queries/type_inference/lookups.rs:72-89 | crates/biome_module_graph/src/db/queries/type_inference/lookups.rs:107-124 | crates/biome_module_graph/src/db/queries/type_inference/lookups.rs:142-159 | crates/biome_module_graph/src/db/queries/type_inference/lookups.rs:173-190 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/queries/type_inference/lookups.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"83079a344293965fd7481b4d34f9cc5f40c1230fd61fb452f67fe1d0b2c31410"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/biome_module_graph/src/db/type_inference/expressions.rs:110-121 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1962-1976 \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/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e319ef34d5d98dbedb13f9f653ff62597de243143b277a95d14b5bc055ba8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/biome_console/src/write/termcolor.rs:21-41 | crates/biome_console/src/write/termcolor.rs:43-61 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_console/src/write/termcolor.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e046489a3310d51b5fc343cfe91ec36f7e6ba6445ee8bfd81c86604d7516c8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/biome_css_parser/src/syntax/at_rule/mod.rs:109-130 | crates/biome_css_parser/src/syntax/selector/pseudo_class/mod.rs:61-82 \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/biome_css_parser/src/syntax/at_rule/mod.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a85f2a8a7c38c639f958c770b20b88913dac7f0402f1b2ef6953664427b082"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/biome_deserialize/src/impls.rs:23-39 | crates/biome_deserialize/src/impls.rs:67-83 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_deserialize/src/impls.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8819df59d7c39126b03790d1255279e7d29eccb7660e1aab44a7ac1e95ff5ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/biome_graphql_semantic/src/semantic_model/model.rs:118-129 | crates/biome_graphql_semantic/src/semantic_model/model.rs:154-166 \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/biome_graphql_semantic/src/semantic_model/model.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a9938072a20b112a8079ac41dc9d39fc04cf9d873b4e0fd7fee45d3334bd7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/biome_grit_patterns/src/pattern_compiler/if_compiler.rs:15-24 | crates/biome_grit_patterns/src/pattern_compiler/if_compiler.rs:33-42 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_patterns/src/pattern_compiler/if_compiler.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab58eb8a60369ebc91abdb67ada996243573107eae53a55e825cb0679f5e026"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/biome_html_syntax/src/lib.rs:111-126 | crates/biome_json_syntax/src/lib.rs:95-111 \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/biome_html_syntax/src/lib.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"47fa376c9cbdbad8477a96ffbc133a401fadfea5e6ace6c9944dc100aa468765"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/biome_markdown_parser/src/to_html.rs:1964-1980 | crates/biome_package/src/node_js_package/package_json.rs:369-389 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/to_html.rs"},"region":{"startLine":1964}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ad285849ef619cb06ed60564446a2e71971671fe347733f0d42c9a504be1a95"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/biome_analyze/src/shared/sort_attributes.rs:20-29 | crates/biome_analyze/src/shared/sort_attributes.rs:31-40 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_analyze/src/shared/sort_attributes.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"d55a8da4d9e662d916109131063951a5de0813c26d8230c55b6c06979f28233a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 23\u002B corresponding lines): crates/biome_graphql_formatter/src/graphql/definitions/input_value_definition.rs:12-37 | crates/biome_graphql_formatter/src/graphql/definitions/variable_definition.rs:12-37 | crates/biome_js_formatter/src/ts/module/import_type.rs:10-32 \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/biome_graphql_formatter/src/graphql/definitions/input_value_definition.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"26652095c94f1fe424beb6c9c14dc9da4c06c86343f66aada8af54e898149b54"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/biome_graphql_parser/src/parser/definitions/fragment.rs:17-33 | crates/biome_graphql_parser/src/parser/definitions/operation.rs:111-129 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_graphql_parser/src/parser/definitions/fragment.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96775fbea5de8ecf30238d632fbc769faf59672d5fea7973b92fcab2306e93b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/biome_grit_parser/src/parser/patterns.rs:685-708 | crates/biome_grit_parser/src/parser/predicates.rs:243-261 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_parser/src/parser/patterns.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"5640066716a4eafb907f1e864dab439a3a2aa66ed9b580433dcc547363efd7a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 9\u002B corresponding lines): crates/biome_grit_patterns/src/grit_built_in_functions.rs:208-220 | crates/biome_grit_patterns/src/grit_built_in_functions.rs:414-426 | crates/biome_grit_patterns/src/grit_built_in_functions.rs:462-474 | crates/biome_grit_patterns/src/grit_built_in_functions.rs:530-538 | crates/biome_grit_patterns/src/grit_built_in_functions.rs:568-578 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_patterns/src/grit_built_in_functions.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca02be5bddd6aec521a0a1bd501a1f40316796afb3b17824a593a804e945aa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 20\u002B corresponding lines): crates/biome_html_formatter/src/svelte/auxiliary/each_block.rs:8-27 | crates/biome_html_formatter/src/vue/auxiliary/v_for_tuple_binding.rs:8-28 | crates/biome_js_formatter/src/js/expressions/import_call_expression.rs:12-31 | crates/biome_js_formatter/src/ts/expressions/import_type_arguments.rs:7-27 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_formatter/src/svelte/auxiliary/each_block.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"323509969678024a0a0802fd2f99b7a769e4c5b6deb928353a9f06054c962a68"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/biome_js_analyze/src/ast_utils.rs:142-159 | crates/biome_js_analyze/src/lint/nursery/no_accidental_bitwise_operators.rs:300-314 \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/biome_js_analyze/src/ast_utils.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"a40fd6259e2568ff70b09b5608feba7fa9a71f627b8b18235caf9ee71736989c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/biome_js_type_info/src/interned_types.rs:1889-1901 | crates/biome_js_type_info/src/interned_types.rs:3113-3126 \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/biome_js_type_info/src/interned_types.rs"},"region":{"startLine":1889}}}],"partialFingerprints":{"codehealthFindingId/v1":"1446f77ab4a88dadc9b4a729b936ce4abbba52a9d05cccdd41ef2b219358a1c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): crates/biome_service/src/db/state.rs:1029-1043 | crates/biome_service/src/db/state.rs:1052-1074 | crates/biome_service/src/db/state.rs:1117-1136 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/db/state.rs"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f24c28db0e7da072a579afd5e40484a3b827e69abeb128b54abb981deb4dc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 20\u002B corresponding lines): crates/biome_graphql_formatter/src/graphql/auxiliary/field.rs:8-32 | crates/biome_graphql_formatter/src/graphql/extensions/schema_extension.rs:12-35 | crates/biome_grit_formatter/src/grit/auxiliary/language_declaration.rs:11-33 | crates/biome_html_formatter/src/svelte/auxiliary/each_as_keyed_item.rs:7-26 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_graphql_formatter/src/graphql/auxiliary/field.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84e78243f0eac6ae0cf2c4376b03e18c63dfdc141e4847df13d4886e0540566"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/biome_markdown_parser/src/syntax/fenced_code_block.rs:253-270 | crates/biome_markdown_parser/src/syntax/fenced_code_block.rs:278-288 \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/biome_markdown_parser/src/syntax/fenced_code_block.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"32b1cde2e6a30ce99e16e2ba84c6fdf91ee059002edf2209cc18d7e2e8314f6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/biome_package/src/license/expression.rs:199-207 | crates/biome_package/src/license/expression.rs:210-218 \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/biome_package/src/license/expression.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a7a6d27cf7c17cf21db77101e7be63a62534b905b71084adb4b21161271e940"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/biome_react_compiler/src/convert_ast/statements.rs:6-18 | crates/biome_react_compiler/src/convert_ast/statements.rs:498-512 \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/biome_react_compiler/src/convert_ast/statements.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6dcd1013aacf510b1bf76102b374246db18f20957716ba83bab900f59f74fa4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/biome_css_formatter/src/css/auxiliary/declaration.rs:9-32 | crates/biome_js_formatter/src/js/statements/debugger_statement.rs:13-26 \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/biome_css_formatter/src/css/auxiliary/declaration.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"b503191e34c09fc71c1437249782d0e62bcdf8c76ad1c998eeaa0fc1c278332c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 11\u002B corresponding lines): crates/biome_grit_patterns/src/pattern_compiler/and_compiler.rs:27-37 | crates/biome_grit_patterns/src/pattern_compiler/and_compiler.rs:65-75 | crates/biome_grit_patterns/src/pattern_compiler/any_compiler.rs:15-26 | crates/biome_grit_patterns/src/pattern_compiler/any_compiler.rs:35-46 | crates/biome_grit_patterns/src/pattern_compiler/list_compiler.rs:20-31 | crates/biome_grit_patterns/src/pattern_compiler/or_compiler.rs:15-26 | crates/biome_grit_patterns/src/pattern_compiler/or_compiler.rs:35-46 \u2014 These 7 members are one piece of code written 7 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 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_patterns/src/pattern_compiler/and_compiler.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"609911584a07d63b648313701ee50805ebba37d5d457d7bd6422bca3babcc611"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 22\u002B corresponding lines): crates/biome_html_formatter/src/svelte/auxiliary/else_clause.rs:9-30 | crates/biome_html_formatter/src/svelte/auxiliary/else_if_clause.rs:9-37 | crates/biome_html_formatter/src/svelte/auxiliary/if_opening_block.rs:9-34 | crates/biome_html_formatter/src/svelte/auxiliary/snippet_opening_block.rs:13-38 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_formatter/src/svelte/auxiliary/else_clause.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a3436489fd2d3734e8b205eafc29084b71677b23517d4eb0d067bc1a7ddf6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/biome_js_parser/src/syntax/typescript/types.rs:230-246 | crates/biome_js_parser/src/syntax/typescript/types.rs:2229-2239 \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/biome_js_parser/src/syntax/typescript/types.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"526a9b0d82d451ec6871dccb8ab52b23e40188ffd4e420d36e7ef22920519fd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/biome_rowan/src/cursor.rs:255-268 | crates/biome_rowan/src/cursor.rs:269-282 \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/biome_rowan/src/cursor.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"80708b6c28adc588d67ad4d63e47fd3cbfe086cea9569e37aac7f39f3303f344"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/biome_syntax_codegen/src/ast.rs:529-538 | xtask/codegen/src/js_kinds_src.rs:567-576 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_syntax_codegen/src/ast.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"f244ba459387649aa2353c0e069f9cd4170528ecbbb2e045d014513c73695d6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/biome_cli/src/commands/inspect.rs:212-228 | crates/biome_cli/src/commands/mod.rs:912-935 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/commands/inspect.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba7e59a7b0130e0088220158229138eee150c6a87b5df635c5aca0474932ea98"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/biome_configuration/src/editorconfig.rs:375-386 | crates/biome_configuration/src/editorconfig.rs:388-399 \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/biome_configuration/src/editorconfig.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc6fbf2046476cac097038be09ca900188333b0ae34d2f26774f51fa8126f7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): crates/biome_css_analyze/src/lib.rs:113-132 | crates/biome_css_analyze/src/lib.rs:147-169 | crates/biome_js_analyze/src/lib.rs:436-451 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_analyze/src/lib.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"c45d8c1136cc67a693d0a0d71dbd3994c1423ce2f99ab3689fd06da350dd254e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 15\u002B corresponding lines): crates/biome_css_formatter/src/css/auxiliary/container_at_rule_declarator.rs:13-33 | crates/biome_css_formatter/src/tailwind/statements/source_at_rule.rs:7-32 | crates/biome_grit_formatter/src/grit/auxiliary/rewrite.rs:7-21 | crates/biome_js_formatter/src/js/auxiliary/catch_clause.rs:10-24 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_formatter/src/css/auxiliary/container_at_rule_declarator.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"b39065d0b997ad84a5bebd11ed516f19425fda8a3ca9e2ffef0f0590cfcab29e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/biome_css_formatter/src/css/auxiliary/list_of_component_values_expression.rs:16-32 | crates/biome_css_formatter/src/scss/auxiliary/expression.rs:12-28 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_formatter/src/css/auxiliary/list_of_component_values_expression.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"48275eb12141341644b4ec0cf352a5d294a8876e9db4e1ccaf6befe1cb0d80d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 15\u002B corresponding lines): crates/biome_css_formatter/src/scss/auxiliary/module_configuration.rs:9-26 | crates/biome_css_formatter/src/scss/auxiliary/supports_declaration.rs:9-27 | crates/biome_grit_formatter/src/grit/auxiliary/within.rs:8-22 | crates/biome_grit_formatter/src/grit/patterns/pattern_contains.rs:8-22 | crates/biome_js_formatter/src/ts/types/infer_type.rs:11-25 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_formatter/src/scss/auxiliary/module_configuration.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3eed2f1aa86c3fdb7593540c2887c410ec07be432a786390cb1e3b2d1153c48"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): crates/biome_html_analyze/src/lint/a11y/no_aria_hidden_on_focusable.rs:119-129 | crates/biome_js_analyze/src/lint/a11y/no_redundant_roles.rs:137-146 | crates/biome_js_analyze/src/lint/complexity/no_useless_empty_export.rs:104-113 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/a11y/no_aria_hidden_on_focusable.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"17044d739bf5a87b3af3e42c33d8614ce1c9b3411ab33ae3d46dcb24ceb01fc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/biome_html_analyze/src/lint/a11y/no_label_without_control.rs:150-168 | crates/biome_js_analyze/src/lint/a11y/no_label_without_control.rs:162-174 \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/biome_html_analyze/src/lint/a11y/no_label_without_control.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8da689be103a06fc4c0defe1a5222cf672cf60539853f0968f233042b74c8c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): crates/biome_js_analyze/src/lint/a11y/no_access_key.rs:103-113 | crates/biome_js_analyze/src/lint/a11y/use_valid_aria_props.rs:108-122 | crates/biome_js_analyze/src/lint/complexity/no_useless_constructor.rs:245-255 | crates/biome_js_analyze/src/lint/suspicious/no_redundant_use_strict.rs:192-203 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/a11y/no_access_key.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d1823343ff62f001cc6cae875023cabe63ff946ee4bb5cf5cccdece5057bc8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/biome_markdown_parser/src/to_html.rs:1558-1571 | crates/biome_markdown_parser/src/to_html.rs:1579-1595 \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/biome_markdown_parser/src/to_html.rs"},"region":{"startLine":1558}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e7bcea0fc6b612bcddfa093ce805ff0fe47a7971d2a89b115670290f910a26"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/biome_module_graph/src/js_module_info/flow/builder.rs:105-119 | crates/biome_module_graph/src/js_module_info/flow/builder.rs:252-267 \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/biome_module_graph/src/js_module_info/flow/builder.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"a613bf732c59ce7c4fa1f5f40a872045a9d385846e0a9ee66256f5ee5159e7f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/biome_css_analyze/src/fonts.rs:278-299 | crates/biome_css_syntax/src/property_syntax/matcher.rs:166-182 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_analyze/src/fonts.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4108b38b33fbe38c102d52f3adeb15b8f04bfe5b55bd96c9f1da15cd7f2f21c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 16\u002B corresponding lines): crates/biome_css_analyze/src/lint/style/no_excessive_lines_per_file.rs:118-133 | crates/biome_graphql_analyze/src/lint/style/no_excessive_lines_per_file.rs:118-133 | crates/biome_html_analyze/src/lint/style/no_excessive_lines_per_file.rs:118-133 | crates/biome_js_analyze/src/lint/style/no_excessive_lines_per_file.rs:132-147 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\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/biome_css_analyze/src/lint/style/no_excessive_lines_per_file.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"41ed70f0cf80ba55f764bfb203a8d31807676077aea30d3af70bc401c40452f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/biome_graphql_analyze/src/lint/correctness/no_duplicate_variable_names.rs:51-57 | crates/biome_graphql_analyze/src/lint/suspicious/no_duplicate_fields.rs:200-209 \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/biome_graphql_analyze/src/lint/correctness/no_duplicate_variable_names.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af60a99f124427384fa26b36218d4c342b0ffca239516e747848f7d15fa7622"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 10\u002B corresponding lines): crates/biome_html_analyze/src/lint/a11y/no_access_key.rs:91-101 | crates/biome_html_analyze/src/lint/a11y/no_autofocus.rs:105-115 | crates/biome_html_analyze/src/lint/a11y/no_distracting_elements.rs:89-100 | crates/biome_html_analyze/src/lint/a11y/no_header_scope.rs:94-104 | crates/biome_html_analyze/src/lint/a11y/use_anchor_content.rs:162-173 | crates/biome_html_analyze/src/lint/a11y/use_valid_aria_props.rs:92-104 | crates/biome_html_analyze/src/lint/nursery/no_svelte_at_debug_tags.rs:73-84 | crates/biome_html_analyze/src/lint/nursery/use_svelte_shorthand_directive.rs:126-135 \u2014 These 8 members are one piece of code written 8 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 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/a11y/no_access_key.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"d107b9722a24aa761b3255bb0cb8ac6bd4b3d70183339d3cc460233bbedc01af"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/biome_js_analyze/src/assist/source/organize_imports/specifiers_attributes.rs:139-155 | crates/biome_js_analyze/src/assist/source/organize_imports/specifiers_attributes.rs:217-233 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/assist/source/organize_imports/specifiers_attributes.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb074c40ed4d0b65d59e186caa7c1c9e3c7af0829f2c5dc8b3b34f88929cb495"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/biome_js_analyze/src/lint/complexity/no_useless_string_concat.rs:809-829 | crates/biome_js_analyze/src/lint/style/use_unicode_regex.rs:370-382 \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/biome_js_analyze/src/lint/complexity/no_useless_string_concat.rs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"38cda576667d1744834852941e19653cbf2404365087b731a3dd7575094fefb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/biome_js_analyze/src/lint/nursery/no_vue_deprecated_destroyed_lifecycle.rs:206-214 | crates/biome_js_analyze/src/lint/nursery/use_vue_registered_component_name_casing.rs:239-250 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_vue_deprecated_destroyed_lifecycle.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"d393c5cf761e1c7f867d5cd2b74389b6a3d946bdc2d88e2520833188b1e84ae1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/biome_service/src/file_handlers/html.rs:790-800 | crates/biome_service/src/file_handlers/yaml.rs:444-456 \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/biome_service/src/file_handlers/html.rs"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a6845657e22db5634145db5a27a8349b62e9ef6874bb66d7277cf8e7e49f115"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/biome_grit_parser/src/lexer/mod.rs:265-280 | crates/biome_grit_parser/src/lexer/mod.rs:282-297 \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/biome_grit_parser/src/lexer/mod.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"54b33fc70985ef1034018fa27c0fba78ee8a3156b3b961e4651705966de01d1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/biome_js_analyze/src/lint/nursery/no_magic_array_flat_depth.rs:78-95 | crates/biome_js_analyze/src/lint/nursery/use_lowercase_test_title.rs:151-168 \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/biome_js_analyze/src/lint/nursery/no_magic_array_flat_depth.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c03bd3ed4162a7452da8cec2c866dff8da32c64b0c148dda99f871fbccc33bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/biome_js_analyze/src/lint/style/use_throw_new_error.rs:100-113 | crates/biome_js_analyze/src/lint/suspicious/no_playwright_page_pause.rs:80-98 \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/biome_js_analyze/src/lint/style/use_throw_new_error.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5dd495c375608a967f6628623c3a39882b579cc2e27a32474bd802faa635525"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/biome_js_analyze/src/lint/suspicious/no_evolving_types.rs:109-129 | crates/biome_js_analyze/src/lint/suspicious/no_implicit_any_let.rs:74-94 \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/biome_js_analyze/src/lint/suspicious/no_evolving_types.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab7f6f78e5dcccbb2cd6adc49170cfc9c133f3da8c2be150ca04f083481e970e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/biome_js_semantic/src/semantic_model/scope.rs:215-230 | crates/biome_js_semantic/src/semantic_model/scope.rs:247-262 \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/biome_js_semantic/src/semantic_model/scope.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba06a69b72094da010dcf72ab724fc8a3ab32fa3b71bb105b84fab60a41aaf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/biome_css_analyze/src/lint/suspicious/no_empty_source.rs:77-92 | crates/biome_graphql_analyze/src/lint/suspicious/no_empty_source.rs:78-93 \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/biome_css_analyze/src/lint/suspicious/no_empty_source.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d80e8cf7981c185fcfcca2743ed667c057d72f2972941c11ef3cb6984d008de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/biome_css_parser/src/lexer/source_cursor.rs:73-93 | crates/biome_json_parser/src/lexer/mod.rs:212-229 \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/biome_css_parser/src/lexer/source_cursor.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6684278aabbf39a69769488739c15379203c1f011d84b1bca24b8129574ccf3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/biome_css_parser/src/syntax/at_rule/function.rs:135-152 | crates/biome_css_parser/src/syntax/at_rule/function.rs:160-177 \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/biome_css_parser/src/syntax/at_rule/function.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04325c35d8ff28225d926ee9e68dafc16125ffee07b3af4c1448c6d408a1fb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/biome_css_syntax/src/scss_ext/expression.rs:95-111 | crates/biome_css_syntax/src/scss_ext/expression.rs:116-135 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_syntax/src/scss_ext/expression.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"669515359834f6ee78c44972999dec9197a03825ce1500cebccbdd0929f7efd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): crates/biome_html_analyze/src/lint/nursery/no_vue_v_text_v_html_on_component.rs:105-124 | crates/biome_js_analyze/src/lint/correctness/no_const_assign.rs:82-97 | crates/biome_js_analyze/src/lint/suspicious/no_unassigned_variables.rs:116-133 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/nursery/no_vue_v_text_v_html_on_component.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"78eb97f8b86d6b179056336e53c3ab6198632091afe355cf0a9ec57fa9af0d40"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/biome_js_analyze/src/lint/nursery/no_vue_lifecycle_after_await.rs:86-93 | crates/biome_js_analyze/src/lint/nursery/no_vue_watch_after_await.rs:86-93 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_vue_lifecycle_after_await.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a7b5ac0fc77af2519e10426d41f02e0f6f0048715dcaa4e1f7bbd49ec57e713"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 24\u002B corresponding lines): crates/biome_js_formatter/src/js/classes/getter_class_member.rs:11-37 | crates/biome_js_formatter/src/js/objects/getter_object_member.rs:11-34 | crates/biome_js_formatter/src/ts/types/constructor_type.rs:12-39 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 24 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/js/classes/getter_class_member.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceff07110640bfc45f42f339b76961759db5338474e8e49d88a4367ac765283f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/biome_js_formatter/src/js/statements/while_statement.rs:12-37 | crates/biome_js_formatter/src/ts/assignments/type_assertion_assignment.rs:17-39 \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/biome_js_formatter/src/js/statements/while_statement.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a08864e22dc84a0cd8c2fac1d9b59b61f85d3b2391165255d89795f6b2f5357"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/biome_css_formatter/src/comments.rs:207-227 | crates/biome_css_formatter/src/comments.rs:231-248 \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/biome_css_formatter/src/comments.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e8370914796813862d8f3373b9fdc79ba6e6798470ba73eb182ec985995706"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): crates/biome_diagnostics_macros/src/generate.rs:54-70 | crates/biome_diagnostics_macros/src/generate.rs:72-88 | crates/biome_diagnostics_macros/src/generate.rs:235-254 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_diagnostics_macros/src/generate.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69d4f68322ed21e4d911c461b5cbecff9203aea75298da1a4407d2a488d5748"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/biome_embeds/src/data.rs:229-250 | crates/biome_html_analyze/src/lint/nursery/no_vue_deprecated_router_link_tag_prop.rs:160-174 \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/biome_embeds/src/data.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e5ac9e25f7b23ed1bb179b08c08fc20f0b3d49f74eedfe899bfccf67bbadfb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 15\u002B corresponding lines): crates/biome_graphql_formatter/src/graphql/auxiliary/inline_fragment.rs:12-27 | crates/biome_js_formatter/src/js/statements/break_statement.rs:13-27 | crates/biome_js_formatter/src/js/statements/continue_statement.rs:13-27 | crates/biome_js_formatter/src/js/statements/try_finally_statement.rs:11-26 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_graphql_formatter/src/graphql/auxiliary/inline_fragment.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d0f0aaad10fc00c0d1cab6662ceab1ec6a0246892ef3e9410293f66002927b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/biome_html_analyze/src/lint/nursery/no_astro_set_html_directive.rs:53-61 | crates/biome_html_analyze/src/lint/nursery/use_astro_client_only_directive_value.rs:56-63 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/nursery/no_astro_set_html_directive.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a8a21fc67deece05d451385590cf3a61511884c12e409569d107eb7b547be72"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/biome_js_analyze/src/lint/correctness/no_private_imports.rs:279-293 | crates/biome_js_analyze/src/lint/correctness/no_unresolved_imports.rs:258-272 \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/biome_js_analyze/src/lint/correctness/no_private_imports.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcfdbc673e02cefb7980ceb2a43b55a9294cdee6b9059aa593afc8ae16da364e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/biome_js_analyze/src/lint/nursery/no_new_require.rs:74-90 | crates/biome_js_analyze/src/lint/nursery/no_svelte_add_event_listener.rs:110-126 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_new_require.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a9be5cd52fd2f32676e12d804e1288635c09ce5ee268f95252861d14a8f0ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/biome_js_formatter/src/js/lists/module_item_list.rs:10-28 | crates/biome_js_formatter/src/js/lists/statement_list.rs:10-25 \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/biome_js_formatter/src/js/lists/module_item_list.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"d045edade3ed93e5d29a4122141d96a388bb8b5291016f48bb6dd5ae6272fd55"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/biome_markdown_parser/src/syntax/list.rs:252-258 | crates/biome_markdown_parser/src/syntax/quote.rs:631-640 \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/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"39e1810912cf215805c706dd931c23819c235ecd802f60293e9213e9b5063696"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 13\u002B corresponding lines): xtask/codegen/src/generate_global_types/compare.rs:515-533 | xtask/codegen/src/generate_global_types/compare.rs:536-548 | xtask/codegen/src/generate_global_types/compare.rs:551-563 | xtask/codegen/src/generate_global_types/compare.rs:566-578 | xtask/codegen/src/generate_global_types/compare.rs:581-593 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/generate_global_types/compare.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a93e16a45705cda1fea8f6371a4ac71293bdf856229f19531c1643185ea4fb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/biome_css_formatter/src/css/auxiliary/function_at_rule_declarator.rs:14-39 | crates/biome_css_formatter/src/css/statements/namespace_at_rule.rs:7-28 \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/biome_css_formatter/src/css/auxiliary/function_at_rule_declarator.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"be2e643ebe9e7f91ad7390a7b9cae99de564c69557d387beddbd42a44649bcb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): crates/biome_css_formatter/src/css/pseudo/pseudo_class_nth.rs:8-30 | crates/biome_html_formatter/src/svelte/value/directive_value.rs:17-37 | crates/biome_markdown_formatter/src/markdown/auxiliary/reference_image.rs:7-31 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_formatter/src/css/pseudo/pseudo_class_nth.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"9176b0bd6a421b602b95201dd13faa625af0805eb6f282f941a36545676768fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/biome_css_parser/src/syntax/scss/at_rule/import_at_rule.rs:71-89 | crates/biome_css_parser/src/syntax/scss/at_rule/import_at_rule.rs:102-119 \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/biome_css_parser/src/syntax/scss/at_rule/import_at_rule.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e8ca801d072f1a93031ea88f297c8e67d76ef5275c3a48bc8ac89cec253a6d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/biome_css_syntax/src/property_syntax/matcher.rs:250-260 | crates/biome_css_syntax/src/property_syntax/matcher.rs:390-401 \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/biome_css_syntax/src/property_syntax/matcher.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"db0150e375a37b81903b9d2d450c54870ea87bed071126c30c4736e4646fa4b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/biome_fs/src/fs/os.rs:100-118 | crates/biome_fs/src/fs/os.rs:120-138 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_fs/src/fs/os.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca580218c142d5bcf387833d1e06198d9f5844aa89943a1e8a7d9775365a3e51"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/biome_js_analyze/src/lint/complexity/no_useless_string_raw.rs:91-106 | crates/biome_js_analyze/src/lint/style/no_unused_template_literal.rs:123-148 \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/biome_js_analyze/src/lint/complexity/no_useless_string_raw.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"934e89af8b18d15d497756ac1063c5a9a6f06711f3ff4b8c9818f009752e5d44"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/biome_js_analyze/src/lint/nursery/use_vue_valid_default_prop.rs:360-373 | crates/biome_js_analyze/src/lint/nursery/use_while_loop_condition.rs:310-325 \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/biome_js_analyze/src/lint/nursery/use_vue_valid_default_prop.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e5b2d9fd42cc39316b5bc2330d59c6ef4e6d1d6d12c1037b5e0457f04f4fe7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/biome_js_analyze/src/lint/suspicious/no_constant_binary_expressions.rs:491-506 | crates/biome_js_analyze/src/lint/suspicious/no_constant_binary_expressions.rs:599-611 \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/biome_js_analyze/src/lint/suspicious/no_constant_binary_expressions.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7119249d392434212d61d3e99c460e9eddef04d69f07161dcac36e38baf8dfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/biome_markdown_parser/src/syntax/list.rs:3454-3470 | crates/biome_markdown_parser/src/syntax/mod.rs:719-735 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":3454}}}],"partialFingerprints":{"codehealthFindingId/v1":"082a94570deb88d4abde0b21041f4dc96a8699a93231850723de2857eba90ef0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/biome_markdown_parser/src/syntax/mod.rs:1186-1199 | crates/biome_markdown_parser/src/syntax/mod.rs:2272-2292 \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/biome_markdown_parser/src/syntax/mod.rs"},"region":{"startLine":1186}}}],"partialFingerprints":{"codehealthFindingId/v1":"a382daf2b31c0060f7a1708f14691a48f644f9ca7da614de751c6ce232131964"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/biome_html_analyze/src/assist/source/use_sorted_attributes.rs:213-219 | crates/biome_js_analyze/src/assist/source/use_sorted_attributes.rs:169-175 \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/biome_html_analyze/src/assist/source/use_sorted_attributes.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf343a4ad70f196a68d2f5c4b6a5e6f57077c0fe3cc70c4e61ef25522facdc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/biome_html_analyze/src/lint/nursery/no_vue_deprecated_slot_attribute.rs:197-213 | crates/biome_html_analyze/src/lint/nursery/no_vue_deprecated_slot_scope.rs:103-119 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/nursery/no_vue_deprecated_slot_attribute.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"532ba16289f39658ec831d088de86a53725afc299ac399a082cb853cc38de773"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/biome_js_analyze/src/lint/nursery/no_object_constructor.rs:180-188 | crates/biome_js_analyze/src/lint/nursery/use_simplified_boolean_return.rs:316-326 \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/biome_js_analyze/src/lint/nursery/no_object_constructor.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e12088a68ca8aa96ea47d89e2a69bfa34bd251badae1479339b96a5ad583f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/biome_js_analyze/src/lint/nursery/no_shared_branch_code.rs:373-384 | crates/biome_js_analyze/src/lint/nursery/use_atomic_updates.rs:611-622 \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/biome_js_analyze/src/lint/nursery/no_shared_branch_code.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"608d07fa502ab66559e25fa255ed0ebd65a1765ea09ea9ea3d5786d090b6dc94"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/biome_js_analyze/src/lint/suspicious/no_loop_func.rs:205-214 | crates/biome_js_analyze/src/react/hooks.rs:55-64 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/no_loop_func.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ac1e11b651a8a9e6b7b041025a00aba63fb15140003891739ebde19550a8f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/biome_markdown_formatter/src/gfm/lists/table_cell_list.rs:8-16 | crates/biome_markdown_formatter/src/gfm/lists/table_delimiter_cell_list.rs:8-16 \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/biome_markdown_formatter/src/gfm/lists/table_cell_list.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a3410438f2e67e30fa2211f44298511dd9c405f500e0e2f60b404b9a4d1cb82"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): crates/biome_rowan/src/cursor.rs:234-243 | crates/biome_rowan/src/cursor.rs:244-253 | crates/biome_rowan/src/cursor/node.rs:320-330 | crates/biome_rowan/src/cursor/node.rs:343-353 \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/biome_rowan/src/cursor.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a5d714fe23b64d9475d598ece06a2a158378865831a581e7bb43718655752d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/biome_service/src/file_handlers/html.rs:1637-1649 | crates/biome_service/src/file_handlers/html.rs:1670-1683 \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/biome_service/src/file_handlers/html.rs"},"region":{"startLine":1637}}}],"partialFingerprints":{"codehealthFindingId/v1":"58cd43858f3831149f3af7937c82e554133b08155511cfb163ed596a1e2c36c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/biome_tailwind_logic/src/syntax_service.rs:697-707 | crates/biome_tailwind_logic/src/syntax_service.rs:715-725 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_tailwind_logic/src/syntax_service.rs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"f140a48d48747286997aca8a8809afa176a21ceb0d7eaab0e33443f477116cda"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): xtask/codegen/src/generate_global_types/compare.rs:399-419 | xtask/codegen/src/generate_global_types/compare.rs:426-440 \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":"xtask/codegen/src/generate_global_types/compare.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec1fd034ff032c25ecf12df3f15e8e7a5cbb416161bc46e12512dd231ea3b66"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/biome_analyze/src/categories.rs:341-348 | crates/biome_analyze/src/categories.rs:352-359 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_analyze/src/categories.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"441272a5115d307ad1f9d010b4ffa5a92b7d9bad68c8f3d8e6d96e1e03135047"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/biome_css_analyze/src/lint/correctness/no_unmatchable_anb_selector.rs:164-175 | crates/biome_js_analyze/src/lint/nursery/no_invalid_file_input_accept.rs:178-188 \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/biome_css_analyze/src/lint/correctness/no_unmatchable_anb_selector.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dfd34405f9146eac7bb909264b793dc62827f4954672a3f9f6fe65cd4aa0293"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/biome_css_parser/src/lexer/scan_cursor.rs:463-476 | crates/biome_css_parser/src/lexer/scan_cursor.rs:483-498 \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/biome_css_parser/src/lexer/scan_cursor.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ee7a79d073818df987b7e9d680a33e28605d513341eed759f7c25fa110009a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 17\u002B corresponding lines): crates/biome_css_parser/src/syntax/at_rule/container/mod.rs:285-304 | crates/biome_css_parser/src/syntax/at_rule/container/mod.rs:445-463 | crates/biome_css_parser/src/syntax/at_rule/container/mod.rs:601-620 | crates/biome_css_parser/src/syntax/at_rule/container/mod.rs:782-798 | crates/biome_css_parser/src/syntax/at_rule/import.rs:197-216 | crates/biome_css_parser/src/syntax/value/if.rs:230-250 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_parser/src/syntax/at_rule/container/mod.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e79be30eb0f011e69b9e99bbe01d5a93c0420609ca5ecadb77c8f0a21efb60"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/biome_html_parser/src/syntax/svelte.rs:800-813 | crates/biome_html_parser/src/syntax/svelte.rs:815-827 | crates/biome_html_parser/src/syntax/vue.rs:182-194 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_parser/src/syntax/svelte.rs"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cb507822bfe12195aa748cfeb82125ec8147a2bc7eb911de1e7795b286b1049"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/biome_js_analyze/src/lint/nursery/no_useless_spread.rs:509-520 | crates/biome_js_analyze/src/lint/nursery/use_better_dom_traversing.rs:359-371 \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/biome_js_analyze/src/lint/nursery/no_useless_spread.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff2850671b76235f751dcbbf4e1e11ca170a1d419925f85ffe6bf732b6e473e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): crates/biome_js_formatter/src/ts/auxiliary/getter_signature_type_member.rs:15-37 | crates/biome_js_formatter/src/ts/auxiliary/property_signature_type_member.rs:15-35 | crates/biome_js_formatter/src/ts/auxiliary/setter_signature_type_member.rs:15-39 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/ts/auxiliary/getter_signature_type_member.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed0c35b28d9fcf08e5df4ff687e828a8489720944130e676b18cdf27f2529c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/biome_markdown_parser/src/syntax/mod.rs:700-717 | crates/biome_markdown_parser/src/syntax/mod.rs:801-820 \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/biome_markdown_parser/src/syntax/mod.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e06957e7a7afd63b70a6082e6e7622100b7e791d68864ac9253eaf85260407"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): crates/biome_module_graph/src/db/type_inference/expressions.rs:397-408 | crates/biome_module_graph/src/db/type_inference/expressions.rs:414-428 | crates/biome_module_graph/src/db/type_inference/expressions.rs:434-448 | crates/biome_module_graph/src/db/type_inference/expressions.rs:454-468 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"81537b58eb3036d75ba979e616f94d38289a36c5f40126709664272a5efb7e85"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/biome_react_compiler/src/convert_ast/identifiers.rs:390-404 | crates/biome_react_compiler/src/convert_ast/statements.rs:682-693 \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/biome_react_compiler/src/convert_ast/identifiers.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bd726087a32a7774a2b7ae006451248a88fc9f95e82adaa49f33357c25cf6d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): crates/biome_service/src/settings.rs:1624-1635 | crates/biome_service/src/settings.rs:1644-1655 | crates/biome_service/src/settings.rs:1658-1669 | crates/biome_service/src/settings.rs:1694-1705 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/settings.rs"},"region":{"startLine":1624}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ce0997098f36294b4318df9bbf5090e0eff163605b2a8cc3d725fee7159b02"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/biome_css_parser/src/syntax/property/mod.rs:326-331 | crates/biome_graphql_parser/src/parser/definitions/operation.rs:269-278 \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/biome_css_parser/src/syntax/property/mod.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1f34f44d0b5c37e501dca39163c236e39ab7325b2d1094533e425e47191d60"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/biome_css_parser/src/syntax/scss/value/function.rs:43-56 | crates/biome_css_parser/src/syntax/scss/value/function.rs:73-81 \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/biome_css_parser/src/syntax/scss/value/function.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"c88d6620a6b46e926e0c2a576ef4e9561df1f92a05889761b15f2b1af8fbcbbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/biome_formatter/src/comments.rs:1281-1295 | crates/biome_formatter/src/comments.rs:1335-1349 \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/biome_formatter/src/comments.rs"},"region":{"startLine":1281}}}],"partialFingerprints":{"codehealthFindingId/v1":"87600b7ddcafd05a8e4e0fd4ee92e8fad2984acdde8fe8cb1ccdb1e70f2664b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/biome_html_analyze/src/lint/a11y/no_aria_hidden_on_focusable.rs:103-117 | crates/biome_js_analyze/src/lint/a11y/no_aria_hidden_on_focusable.rs:123-137 \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/biome_html_analyze/src/lint/a11y/no_aria_hidden_on_focusable.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"053f8854362652dbb4a9366f4592ad3796f00cbedce23d1b44eeb3f30493d3e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/biome_html_analyze/src/lint/a11y/no_static_element_interactions.rs:68-94 | crates/biome_js_analyze/src/lint/a11y/no_static_element_interactions.rs:72-93 \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/biome_html_analyze/src/lint/a11y/no_static_element_interactions.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"779045d895834616e018dece9fbd518b22a50594584cf65e061160765f37f0d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/biome_html_analyze/src/lint/security/use_iframe_sandbox.rs:61-78 | crates/biome_js_analyze/src/lint/security/use_iframe_sandbox.rs:81-98 \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/biome_html_analyze/src/lint/security/use_iframe_sandbox.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0584fdece9be3bfcf285246146a6879cab27241464ead0c1b7772c835c5d49"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/biome_html_parser/src/syntax/astro.rs:112-128 | crates/biome_html_parser/src/syntax/svelte.rs:1493-1507 \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/biome_html_parser/src/syntax/astro.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d4153f4f7301734885a35cab112956e87e212835b837446e83dd296b159bb4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/biome_js_analyze/src/lint/nursery/no_unnecessary_string_trim.rs:308-322 | crates/biome_js_analyze/src/lint/nursery/use_global_regex_in_match_all.rs:202-216 \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/biome_js_analyze/src/lint/nursery/no_unnecessary_string_trim.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"671632d03686714547822c090c7b9c0715d3f0e705d1ab1ccde8693709b5528a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): crates/biome_js_analyze/src/lint/nursery/no_vue_expose_after_await.rs:136-156 | crates/biome_js_analyze/src/lint/nursery/no_vue_lifecycle_after_await.rs:95-114 | crates/biome_js_analyze/src/lint/nursery/no_vue_watch_after_await.rs:95-114 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_vue_expose_after_await.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"30953da7099288c83319a29adfef91355bfa536b7b906054f73baeaf6445ed08"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/biome_js_analyze/src/lint/nursery/use_explicit_return_type.rs:669-683 | crates/biome_js_analyze/src/lint/nursery/use_explicit_type.rs:839-851 \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/biome_js_analyze/src/lint/nursery/use_explicit_return_type.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"4675ef5a1e60f6abf4cd6ed8cb5dd2e616164b5048648c6009b1d945e3335055"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/biome_js_parser/src/syntax/typescript/types.rs:1210-1220 | crates/biome_js_parser/src/syntax/typescript/types.rs:1478-1489 \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/biome_js_parser/src/syntax/typescript/types.rs"},"region":{"startLine":1210}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e1b4b09112b850e9f56fe47b20beffaa8713755bb040d01fcc1ed0253fdd35f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/biome_js_syntax/src/stmt_ext.rs:93-102 | crates/biome_js_syntax/src/stmt_ext.rs:121-130 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_syntax/src/stmt_ext.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f56f241fd7560deb6a1eb61f3d9dcc77ca621e91cd598b5343ba47f31ac2bcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/biome_package/src/node_js_package/tsconfig_json.rs:55-63 | crates/biome_package/src/node_js_package/turbo_json.rs:128-136 \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/biome_package/src/node_js_package/tsconfig_json.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"7674ebf3e2d35a85257ac4e0a6c04af3f298d3a8b1f1f0adc33e5d0304f8b69e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/biome_plugin_loader/src/lib.rs:519-532 | crates/biome_service/src/configuration.rs:1095-1113 \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/biome_plugin_loader/src/lib.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"c29e191ddb62e3436a6cf602ed8fab50055d1f23c350fddff9d7c8dc4eecd3fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 15\u002B corresponding lines): crates/biome_yaml_parser/src/lexer/mod.rs:864-883 | crates/biome_yaml_parser/src/lexer/mod.rs:1092-1106 | crates/biome_yaml_parser/src/lexer/mod.rs:1244-1265 | crates/biome_yaml_parser/src/lexer/mod.rs:1267-1285 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_yaml_parser/src/lexer/mod.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5da497eddfd07e766a40b9d782325b59b9f4b406b514e5772331bb1cc19531"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/biome_css_analyze/src/lint/suspicious/no_duplicate_custom_properties.rs:99-116 | crates/biome_css_analyze/src/lint/suspicious/no_duplicate_properties.rs:108-125 \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/biome_css_analyze/src/lint/suspicious/no_duplicate_custom_properties.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7f312ece5f59beaf1bcd3985a4f7c885602a6d90f1a04a7142044c528b28335"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/biome_css_parser/src/syntax/at_rule/tailwind.rs:298-309 | crates/biome_css_parser/src/syntax/at_rule/tailwind.rs:354-366 | crates/biome_css_parser/src/syntax/at_rule/tailwind.rs:369-380 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_parser/src/syntax/at_rule/tailwind.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a96e4f94b60d7835644239d543df314411c5ba1388a5450a0b33c90e232bd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 15\u002B corresponding lines): crates/biome_grit_parser/src/parser/definitions.rs:161-176 | crates/biome_grit_parser/src/parser/literals.rs:127-141 | crates/biome_grit_parser/src/parser/patterns.rs:541-555 | crates/biome_grit_parser/src/parser/predicates.rs:225-240 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_parser/src/parser/definitions.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"4acd7ffe0cc5a1b2e720427ec05b53638f195f801084a72db685b6a3d7052100"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): crates/biome_js_analyze/src/lint/complexity/use_math_min_max.rs:894-902 | crates/biome_js_analyze/src/lint/complexity/use_math_min_max.rs:905-914 | crates/biome_js_analyze/src/lint/nursery/no_misleading_return_type/analysis.rs:906-915 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/complexity/use_math_min_max.rs"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e63ef8a19fdec3c43b3cf222f41ee60792b1beced79cd0029081b915e2a123"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/biome_js_analyze/src/lint/nursery/use_explicit_return_type.rs:507-521 | crates/biome_js_analyze/src/lint/nursery/use_explicit_type.rs:722-736 \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/biome_js_analyze/src/lint/nursery/use_explicit_return_type.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c4e1330709a359d9a1ef35652657b437d4b0b82d5fd21fd053cb3dda35ac84"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): crates/biome_js_control_flow/src/nodes/do_while.rs:26-48 | crates/biome_js_control_flow/src/nodes/switch_stmt.rs:28-46 | crates/biome_js_control_flow/src/nodes/while_stmt.rs:26-48 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_control_flow/src/nodes/do_while.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ee95e0966828826b83ec16f8352078713c6161810a40b7cbf3f0f49d1cf7a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/biome_js_formatter/src/js/lists/object_member_list.rs:12-25 | crates/biome_js_formatter/src/ts/lists/enum_member_list.rs:12-25 \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/biome_js_formatter/src/js/lists/object_member_list.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"51861a40f524b0ad71b25f6b3bcf92451ca01982c058aa7e37c0588a7ec9645b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/biome_js_formatter/src/js/objects/literal_member_name.rs:13-35 | crates/biome_js_formatter/src/ts/objects/literal_enum_member_name.rs:10-25 \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/biome_js_formatter/src/js/objects/literal_member_name.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc29a68e1752421a92880fa0222a3f96da9e2adcb0d774ad9af289722bbe5e1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/biome_js_type_info/src/format_inferred_type_info.rs:767-779 | crates/biome_js_type_info/src/format_inferred_type_info.rs:783-795 \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/biome_js_type_info/src/format_inferred_type_info.rs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"151062da530eddbd11fc8d1c5f2d9db5c8094bc4cc4c193c57a196621dd66038"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/biome_json_parser/src/lexer/mod.rs:190-206 | crates/biome_parser/src/lexer.rs:252-268 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_json_parser/src/lexer/mod.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c2e0dedd24f610e2f44a8daf8d9a2b5a78611cfeae44a1700775f97c127cb19"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 9\u002B corresponding lines): crates/biome_lsp/src/server.rs:528-537 | crates/biome_lsp/src/server.rs:539-549 | crates/biome_lsp/src/server.rs:554-563 | crates/biome_lsp/src/server.rs:568-576 | crates/biome_lsp/src/server.rs:581-591 | crates/biome_lsp/src/server.rs:596-606 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/server.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e508c36ad2c3e7acd94acaedd620b55d898e6100a0e8259bc82de4bcc15000"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/biome_rowan/src/serde_impls.rs:30-36 | crates/biome_rowan/src/serde_impls.rs:43-53 \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/biome_rowan/src/serde_impls.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"d555faf4666b26aad3062b6250cfffca03ad82b47f217b2cae604427dacd3baf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 8\u002B corresponding lines): crates/biome_css_parser/src/lib.rs:265-277 | crates/biome_graphql_parser/src/lib.rs:153-166 | crates/biome_grit_parser/src/lib.rs:124-136 | crates/biome_html_parser/src/lib.rs:132-144 | crates/biome_js_parser/src/parse.rs:426-433 | crates/biome_json_parser/src/lib.rs:157-169 | crates/biome_yaml_parser/src/lib.rs:119-131 \u2014 These 7 members are one piece of code written 7 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 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_parser/src/lib.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"e719775b63de6f2ba688537402d8658262032bf6dabb625ebab333438ef90c00"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): crates/biome_css_parser/src/syntax/scss/at_rule/extend_at_rule.rs:26-46 | crates/biome_css_parser/src/syntax/scss/at_rule/forward_at_rule.rs:25-43 | crates/biome_css_parser/src/syntax/scss/at_rule/use_at_rule.rs:26-42 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_parser/src/syntax/scss/at_rule/extend_at_rule.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc45f6e7b87a1119f414c16f9bdbde9b0c0b63cb6fd711ef1e5bb0c3d7419a94"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/biome_css_parser/src/syntax/scss/at_rule/function_at_rule.rs:24-38 | crates/biome_css_parser/src/syntax/scss/at_rule/mixin_at_rule.rs:23-37 \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/biome_css_parser/src/syntax/scss/at_rule/function_at_rule.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a2a355352cb706590a88217c18555839b6db2562f1b04b354e628050f498f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/biome_css_parser/src/syntax/scss/identifiers/interpolated_selector.rs:54-66 | crates/biome_css_parser/src/syntax/scss/identifiers/interpolated_selector.rs:76-93 \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/biome_css_parser/src/syntax/scss/identifiers/interpolated_selector.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb2fa7247f9cf434c2c055c84cda9f62b535a9a9e189f8e183c1419d2392af2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/biome_deserialize_macros/src/deserializable_derive.rs:632-643 | crates/biome_deserialize_macros/src/deserializable_derive.rs:667-678 \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/biome_deserialize_macros/src/deserializable_derive.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f73a2f3c44d709b6c0a1eb2f241cfaf6636a4e4326e476c27cd407961f549c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 22\u002B corresponding lines): crates/biome_graphql_analyze/src/lint/correctness/use_lone_anonymous_operation.rs:100-124 | crates/biome_graphql_analyze/src/lint/style/use_lone_executable_definition.rs:109-130 | crates/biome_js_analyze/src/lint/style/use_consistent_enum_value_type.rs:139-160 | crates/biome_js_analyze/src/lint/suspicious/no_duplicate_enum_values.rs:158-179 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_graphql_analyze/src/lint/correctness/use_lone_anonymous_operation.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"24726832ce6a9bf919f6049cee73e778e7bf19a13747ff3bc7ee46264ecfb4a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/biome_js_analyze/src/lint/suspicious/no_double_equals.rs:95-112 | crates/biome_js_analyze/src/lint/suspicious/no_equals_to_null.rs:60-71 \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/biome_js_analyze/src/lint/suspicious/no_double_equals.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea2d71c29cec79ec016a3228731c3baa19fdcffa42e9f9518474d28c6a80c9cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/biome_js_analyze/src/lint/suspicious/no_playwright_force_option.rs:104-121 | crates/biome_js_analyze/src/lint/suspicious/no_playwright_networkidle.rs:116-133 \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/biome_js_analyze/src/lint/suspicious/no_playwright_force_option.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"c148bce1773e99ca7c7c693fcb703d5f81b602cd6e6ae2655420928bb594c0ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 19\u002B corresponding lines): crates/biome_json_parser/src/lexer/mod.rs:109-128 | crates/biome_markdown_parser/src/lexer/mod.rs:717-735 | crates/biome_parser/src/lexer.rs:159-178 | crates/biome_yaml_parser/src/lexer/mod.rs:1807-1828 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_json_parser/src/lexer/mod.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"06404cc77fbbae47af1114119cac3be1a736a1ef89492b1dd879201aec6b5018"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): crates/biome_css_formatter/src/css/auxiliary/query_feature_range.rs:9-28 | crates/biome_css_formatter/src/css/auxiliary/query_feature_range_interval.rs:13-38 | crates/biome_css_formatter/src/css/auxiliary/query_feature_reverse_range.rs:13-32 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_formatter/src/css/auxiliary/query_feature_range.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd3fac4f772b48ce224bfccbca7ab2dc4f892dcae3ce8e3e5a762b20e161abf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 7\u002B corresponding lines): crates/biome_css_parser/src/lib.rs:61-73 | crates/biome_graphql_parser/src/lib.rs:28-40 | crates/biome_grit_parser/src/lib.rs:26-38 | crates/biome_html_parser/src/lib.rs:22-34 | crates/biome_js_parser/src/parse.rs:315-321 | crates/biome_json_parser/src/lib.rs:56-68 | crates/biome_tailwind_parser/src/lib.rs:49-61 | crates/biome_yaml_parser/src/lib.rs:22-34 \u2014 These 8 members are one piece of code written 8 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_parser/src/lib.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe712e993f1a576b4a743cbfa822ce7e149313569d64e7dde204a72a95c9ba11"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/biome_css_syntax/src/lib.rs:213-225 | crates/biome_graphql_syntax/src/lib.rs:105-118 | crates/biome_js_syntax/src/lib.rs:180-192 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_syntax/src/lib.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a956fd484f5091cb3e9004c066f819c8eaf8bc20ec6836903b8b9479e26f26"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/biome_css_syntax/src/scss_ext/map.rs:57-67 | crates/biome_css_syntax/src/scss_ext/map.rs:83-94 \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/biome_css_syntax/src/scss_ext/map.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ab715c31b74471215c837524a54571c197dde9ea9f9ad03adf6626c9d3e451"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/biome_diagnostics/src/display.rs:776-782 | crates/biome_diagnostics/src/display/message.rs:79-87 \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/biome_diagnostics/src/display.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"f293b4e99d107655908d94075be992f812bfbbb642845190e511fa2328c95698"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/biome_js_analyze/src/lint/nursery/no_undeclared_classes.rs:274-285 | crates/biome_js_analyze/src/lint/nursery/use_vue_separate_static_class.rs:101-111 \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/biome_js_analyze/src/lint/nursery/no_undeclared_classes.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"06251a0ddaecff71a6779ee6e2bdff3f7d920c30dde436beac79dee1f1434c6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/biome_js_parser/src/syntax/module.rs:1462-1477 | crates/biome_js_parser/src/syntax/typescript/statement.rs:233-250 \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/biome_js_parser/src/syntax/module.rs"},"region":{"startLine":1462}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfde536d1c3757604194d74af0ff2a8eae201ab5f5dac44f0b6f1e94a8d0dcf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/biome_js_parser/src/syntax/stmt.rs:1703-1717 | crates/biome_js_parser/src/syntax/stmt.rs:1720-1737 \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/biome_js_parser/src/syntax/stmt.rs"},"region":{"startLine":1703}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca3f74305e925c1b72ca1c4e53fd5cebc4806baac4dad33e7759c4d52fa0a5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/biome_js_type_info/src/builders.rs:251-267 | crates/biome_js_type_info/src/builders.rs:272-287 \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/biome_js_type_info/src/builders.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"d953242415746c93567f9c20692c538d417b2d2737cbde5e55986227239be28a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/biome_markdown_parser/src/syntax/link_block.rs:621-647 | crates/biome_markdown_parser/src/syntax/link_block.rs:652-667 \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/biome_markdown_parser/src/syntax/link_block.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"2316bfeb981a655b07c14ec8917756e12b5f6ebf1ca0badc579af6746c7d9335"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/biome_parser/src/lexer.rs:592-599 | crates/biome_parser/src/lexer.rs:618-630 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_parser/src/lexer.rs"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"53fdabe9d5f176c28db593894f45f7d481761071c5fa47304297843bf56b502d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/biome_yaml_parser/src/lexer/mod.rs:901-910 | crates/biome_yaml_parser/src/lexer/mod.rs:924-933 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_yaml_parser/src/lexer/mod.rs"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5da0fb600ff2ee3cb5204de6a6af5c0b02991e0cd7f734ee3a3640521ddf9d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/biome_css_analyze/src/fonts.rs:265-273 | crates/biome_css_syntax/src/property_syntax/matcher.rs:153-161 \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/biome_css_analyze/src/fonts.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1880c9b874ff6b6ba93820338c4ae8d70a6e1cbce8c4453ae4ac08eace8fadb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 14\u002B corresponding lines): crates/biome_css_formatter/src/css/lists/attr_name_list.rs:13-26 | crates/biome_css_formatter/src/css/lists/syntax_component_list.rs:11-24 | crates/biome_graphql_formatter/src/graphql/lists/union_member_type_list.rs:12-25 | crates/biome_js_formatter/src/ts/lists/union_type_variant_list.rs:60-75 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_formatter/src/css/lists/attr_name_list.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae42cf9fb28c0dcace5e050412e91e654664a2601f0405873fae5ba6d5b3de9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/biome_db/src/testing.rs:127-139 | crates/biome_db/src/testing.rs:169-180 \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/biome_db/src/testing.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"0077b0fad7b354f58d45e28237da22696990f514c46d02cf77658567dc90d48c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/biome_diagnostics/src/display_github.rs:113-129 | crates/biome_diagnostics/src/display_github.rs:131-149 | crates/biome_markdown_parser/src/to_html.rs:2031-2043 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_diagnostics/src/display_github.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b97b44dd3d64e3024825c82d8f11de479a48a3e0607305a3e8a0459def3436"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/biome_grit_patterns/src/pattern_compiler/contains_compiler.rs:12-20 | crates/biome_grit_patterns/src/pattern_compiler/within_compiler.rs:12-20 \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/biome_grit_patterns/src/pattern_compiler/contains_compiler.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"81995a9013b9e7e21be1eb759cadfb427621b71b401a6d2baabfaf9bce691e47"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/biome_js_analyze/src/lint/correctness/no_unused_imports.rs:610-619 | crates/biome_js_analyze/src/lint/correctness/use_hook_at_top_level.rs:648-657 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/no_unused_imports.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"034b9854bcc7064e18393fe374f36a55fca9f3020d61187185eadc6333153d35"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/biome_js_analyze/src/lint/nursery/no_extend_native.rs:145-155 | crates/biome_js_analyze/src/lint/nursery/no_implied_eval.rs:237-249 \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/biome_js_analyze/src/lint/nursery/no_extend_native.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd08330eedbac0e5e958fbec2286d70a460f13a77eae763bf2674eade5a2f4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/biome_js_type_info/src/type_relation.rs:2188-2202 | crates/biome_module_graph/src/db/type_inference/lookup.rs:1028-1040 \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/biome_js_type_info/src/type_relation.rs"},"region":{"startLine":2188}}}],"partialFingerprints":{"codehealthFindingId/v1":"d42c9ba324874916d364f3629a3cb33bc5d9f2c6a82efa0427421689697df8eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/biome_package/src/node_js_package/tsconfig_json.rs:67-81 | crates/biome_package/src/node_js_package/turbo_json.rs:140-154 \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/biome_package/src/node_js_package/tsconfig_json.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e31028c049a7f6407ad9a6893fc4fcf1285e5a648b6f371308d6ac545592fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/biome_rowan/src/cursor/node.rs:244-255 | crates/biome_rowan/src/cursor/node.rs:257-268 | crates/biome_rowan/src/cursor/node.rs:274-285 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_rowan/src/cursor/node.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ae4b054c5b27c0a6efefbbbae9e382deaddfeba62ecf51a0d14abe538e98be"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): crates/biome_service/src/file_handlers/html/parse_embedded_nodes.rs:734-749 | crates/biome_service/src/file_handlers/html/parse_embedded_nodes.rs:797-808 | crates/biome_service/src/file_handlers/html/parse_embedded_nodes.rs:813-824 | crates/biome_service/src/file_handlers/html/parse_embedded_nodes.rs:899-910 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/html/parse_embedded_nodes.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"b24c55de0232d7cec485922c5a0e08ffed4419a21b6573a3b244b9e8cfa9b183"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/biome_tailwind_logic/src/use_tailwind_sorted_classes/sort_v4_variants.rs:649-656 | crates/biome_tailwind_logic/src/use_tailwind_sorted_classes/sort_v4_variants.rs:759-766 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_tailwind_logic/src/use_tailwind_sorted_classes/sort_v4_variants.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b73140aa56413e922ffa9ef6009cff83bf92b46e22a6d419e22198d54967d91"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 13\u002B corresponding lines): xtask/codegen/src/generate_global_types/collect.rs:362-374 | xtask/codegen/src/generate_global_types/collect.rs:381-396 | xtask/codegen/src/generate_global_types/collect.rs:403-415 | xtask/codegen/src/generate_global_types/collect.rs:422-434 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/generate_global_types/collect.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bfa1eb73fd171420baa5213c25193d8845dae0f02f9079b8344825047c1f54d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/biome_css_formatter/src/scss/auxiliary/interpolation.rs:73-94 | crates/biome_css_formatter/src/scss/auxiliary/map_expression_pair.rs:193-209 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_formatter/src/scss/auxiliary/interpolation.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4d177748c48d7030f550af4da4ae25da75ace556185b5e45f7d4cfd8f872583"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/biome_formatter/src/diagnostics.rs:37-57 | crates/biome_formatter/src/diagnostics.rs:124-139 \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/biome_formatter/src/diagnostics.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a224445cd7da4b0fc67d1456a4d3ab86ee957c5114581f2cb5028bb1b1f1556"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 17\u002B corresponding lines): crates/biome_grit_parser/src/parser/patterns.rs:227-244 | crates/biome_grit_parser/src/parser/patterns.rs:711-728 | crates/biome_grit_parser/src/parser/patterns.rs:731-748 | crates/biome_grit_parser/src/parser/patterns.rs:804-820 | crates/biome_grit_parser/src/parser/patterns.rs:889-907 | crates/biome_grit_parser/src/parser/patterns.rs:948-965 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_parser/src/parser/patterns.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"5686f1582e1248d934e98ac132ef0797edace906c2d722b5a0fa60fa4ed0d210"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/biome_grit_parser/src/parser/patterns.rs:620-633 | crates/biome_grit_parser/src/parser/patterns.rs:751-764 \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/biome_grit_parser/src/parser/patterns.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bc26b62e5ef72ec954ddfa8eaa733a24f5110ab391b0dabb2d1a5b7b06c9c96"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/biome_html_analyze/src/lint/a11y/no_access_key.rs:73-89 | crates/biome_js_analyze/src/lint/a11y/no_access_key.rs:85-101 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/a11y/no_access_key.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"989c52c87869f181644aa8f82e01b7f9aec04e7946e5de3805d8b010957821ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/biome_html_analyze/src/lint/nursery/no_vue_undeclared_directives.rs:138-152 | crates/biome_js_analyze/src/lint/nursery/no_dangling_underscore.rs:115-132 \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/biome_html_analyze/src/lint/nursery/no_vue_undeclared_directives.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b165d8867a7d887508ccfa1147ce4bc647e9e749ed4b75d5902689363647005"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 12\u002B corresponding lines): crates/biome_html_parser/src/syntax/svelte.rs:862-874 | crates/biome_html_parser/src/syntax/svelte.rs:903-914 | crates/biome_html_parser/src/syntax/svelte.rs:916-927 | crates/biome_html_parser/src/syntax/svelte.rs:929-940 | crates/biome_html_parser/src/syntax/svelte.rs:957-968 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_parser/src/syntax/svelte.rs"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5d17da14ba31baa74de038ba0b8bf7e502ba6979e874c5183ed3aa551d63e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/biome_js_semantic/src/semantic_model/closure.rs:205-218 | crates/biome_js_semantic/src/semantic_model/scope.rs:190-201 \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/biome_js_semantic/src/semantic_model/closure.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b04d5903db30bb2b2e57fd7e4dda84eb58d79bb74fe133b217a69277597c10c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/biome_js_type_info/src/interned_types.rs:2383-2398 | crates/biome_js_type_info/src/type_data.rs:1245-1258 \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/biome_js_type_info/src/interned_types.rs"},"region":{"startLine":2383}}}],"partialFingerprints":{"codehealthFindingId/v1":"562058d2071fdb98fe9cd4733391e791dc5842a2715d3cf203192b33b7fdd97d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/biome_markdown_parser/src/syntax/list.rs:3164-3173 | crates/biome_markdown_parser/src/syntax/mod.rs:656-666 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":3164}}}],"partialFingerprints":{"codehealthFindingId/v1":"9048b3f5c04f4020a293663d39f1183b394f636b329bfadf4f0f85c65ceadc96"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): crates/biome_markdown_parser/src/syntax/list.rs:3502-3510 | crates/biome_markdown_parser/src/syntax/list.rs:3517-3525 | crates/biome_markdown_parser/src/syntax/list.rs:3581-3589 | crates/biome_markdown_parser/src/syntax/list.rs:3594-3602 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":3502}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e68cdf403b769288579f8cd90705321a13ced64008d7d2ca063e4af62dd391"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/biome_tailwind_logic/src/use_tailwind_sorted_classes/arbitrary_value_match.rs:603-620 | crates/biome_tailwind_logic/src/use_tailwind_sorted_classes/arbitrary_value_match.rs:622-642 \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/biome_tailwind_logic/src/use_tailwind_sorted_classes/arbitrary_value_match.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce3237ecc5039cf0b2fbc9fea31c0c26eb6f3bfabb2078ed822e7cdfaf9905bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/biome_tailwind_parser/src/syntax/css_value.rs:265-276 | crates/biome_tailwind_parser/src/syntax/css_value.rs:387-397 \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/biome_tailwind_parser/src/syntax/css_value.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"18200efbf3db2c1a65eae603182f141cd8dca470adafcf10c4fc174fdc19fd3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/biome_configuration/src/analyzer/mod.rs:1155-1172 | crates/biome_configuration/src/analyzer/mod.rs:1174-1191 \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/biome_configuration/src/analyzer/mod.rs"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f7fedcfcc613554525682621fed77c121847690f5755fec50acfdbb453f50e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/biome_graphql_analyze/src/assist/source/use_graphql_sorted_variables.rs:254-261 | crates/biome_graphql_analyze/src/assist/source/use_sorted_type_fields.rs:254-261 | crates/biome_graphql_analyze/src/utils.rs:51-58 \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/biome_graphql_analyze/src/assist/source/use_graphql_sorted_variables.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bd1c41c779a9c4304e3993003f39a5ceb726389213f1c9939b7c5d09d30e40d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/biome_graphql_parser/src/parser/argument.rs:72-85 | crates/biome_graphql_parser/src/parser/value.rs:225-234 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_graphql_parser/src/parser/argument.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef7599bbf3923771a06bb04c8cf86443e0fa99a68d7da22ac3a8560cd7fc6f12"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/biome_html_analyze/src/lint/a11y/no_noninteractive_tabindex.rs:114-128 | crates/biome_js_analyze/src/lint/a11y/no_noninteractive_tabindex.rs:118-133 \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/biome_html_analyze/src/lint/a11y/no_noninteractive_tabindex.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86c58c6c24742908ed8ae5e7b679c72e060fb36861660633334e7a9537b14ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/biome_html_analyze/src/lint/nursery/no_vue_deprecated_inline_template.rs:69-76 | crates/biome_html_analyze/src/lint/nursery/no_vue_deprecated_slot_scope.rs:95-101 \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/biome_html_analyze/src/lint/nursery/no_vue_deprecated_inline_template.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02ad380f03d00a3ef98e62b525addab496a215c9698b484847c040a46fbb06e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/biome_js_analyze/src/lint/a11y/use_heading_content.rs:134-148 | crates/biome_js_analyze/src/lint/nursery/use_control_label.rs:261-278 \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/biome_js_analyze/src/lint/a11y/use_heading_content.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"0069ef3a5f03e072f47746b959b2b4d5c89f7d93d9ddeefe5d38ee27026b1302"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/biome_js_analyze/src/lint/complexity/no_implicit_coercions.rs:516-533 | crates/biome_js_analyze/src/lint/nursery/no_useless_type_conversion.rs:455-466 \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/biome_js_analyze/src/lint/complexity/no_implicit_coercions.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a6234a3f6494770f7e93bbb916984eeda346a54a482848def02bc3401949b3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/biome_js_parser/src/syntax/auxiliary.rs:29-37 | crates/biome_js_parser/src/syntax/stmt.rs:510-523 \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/biome_js_parser/src/syntax/auxiliary.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"32489fe2d29d4e833f90a4adf210894177d2a0ea3ad4a367efa06784a0afb4c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/biome_js_parser/src/syntax/expr.rs:1034-1052 | crates/biome_js_parser/src/syntax/jsx/mod.rs:799-810 | crates/biome_js_parser/src/syntax/object.rs:396-411 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_parser/src/syntax/expr.rs"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa431401ee12382500ae459f9b7b46b5e0eef9f5bacbdf55403c360a37542f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): crates/biome_js_type_info/src/inferred_type.rs:1491-1500 | crates/biome_js_type_info/src/inferred_type.rs:1502-1511 | crates/biome_js_type_info/src/inferred_type.rs:1513-1522 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/inferred_type.rs"},"region":{"startLine":1491}}}],"partialFingerprints":{"codehealthFindingId/v1":"d77b1498c38e0578131b33704a64f1b62639cb41209f50a25238b05ee6631be9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): crates/biome_markdown_formatter/src/markdown/lists/block_list.rs:717-725 | crates/biome_markdown_formatter/src/markdown/lists/block_list.rs:748-756 | crates/biome_markdown_formatter/src/markdown/lists/block_list.rs:762-770 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_formatter/src/markdown/lists/block_list.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d276ae86ab41c37271c09e8fa7efca7f452879fc2aa6d45028a6d185ced50b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 10\u002B corresponding lines): crates/biome_project_layout/src/project_layout.rs:49-58 | crates/biome_project_layout/src/project_layout.rs:120-129 | crates/biome_project_layout/src/project_layout.rs:139-150 | crates/biome_project_layout/src/project_layout.rs:446-456 | crates/biome_project_layout/src/project_layout.rs:476-486 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_project_layout/src/project_layout.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2c99f184bd03425444abd3333bf5488ec2888ecc2a191159b979af680b4731"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/biome_service/src/file_handlers/md.rs:429-446 | crates/biome_service/src/file_handlers/md.rs:450-467 \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/biome_service/src/file_handlers/md.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"25988ce4c86ec69aae1cd6ee919df8ffa402a9d90aeb1dc7023da6be4597c5f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/biome_configuration/src/lib.rs:994-1001 | crates/biome_configuration/src/lib.rs:1005-1016 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_configuration/src/lib.rs"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"aab4ef9edbde7e78fe2e590735e962c8a26c06088f542c6fe34b98d488a36a7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 15\u002B corresponding lines): crates/biome_css_formatter/src/css/auxiliary/attribute_matcher.rs:8-22 | crates/biome_css_formatter/src/css/auxiliary/root.rs:9-23 | crates/biome_graphql_formatter/src/graphql/auxiliary/root.rs:8-22 | crates/biome_yaml_formatter/src/yaml/auxiliary/folded_scalar.rs:9-24 | crates/biome_yaml_formatter/src/yaml/auxiliary/literal_scalar.rs:9-24 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_formatter/src/css/auxiliary/attribute_matcher.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"a613d1f44b30bd1519c80f85467d5d90f7244f39cc968c859cd9a72ad96b51e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/biome_css_parser/src/lexer/mod.rs:1965-1976 | crates/biome_graphql_parser/src/lexer/mod.rs:124-135 \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/biome_css_parser/src/lexer/mod.rs"},"region":{"startLine":1965}}}],"partialFingerprints":{"codehealthFindingId/v1":"a555245b3e362f90251b3c78bb5b69d3026283b35c5f19a7dd163ab38eed59d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 13\u002B corresponding lines): crates/biome_grit_parser/src/parser/definitions.rs:111-123 | crates/biome_grit_parser/src/parser/predicates.rs:154-168 | crates/biome_grit_parser/src/parser/predicates.rs:171-185 | crates/biome_grit_parser/src/parser/predicates.rs:350-364 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_parser/src/parser/definitions.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba0420702c8912a18b9f86e022d0aa536a8935af9d78c16f72f2ca1be6a9038"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 13\u002B corresponding lines): crates/biome_grit_parser/src/parser/definitions.rs:146-158 | crates/biome_grit_parser/src/parser/patterns.rs:258-273 | crates/biome_grit_parser/src/parser/patterns.rs:586-600 | crates/biome_grit_parser/src/parser/patterns.rs:603-617 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_parser/src/parser/definitions.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe8de2a972c800a31320bf74a045ebff1aaa263fa1fbb1bb906382358ce7c204"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 14\u002B corresponding lines): crates/biome_grit_parser/src/parser/patterns.rs:131-144 | crates/biome_grit_parser/src/parser/patterns.rs:200-213 | crates/biome_grit_parser/src/parser/patterns.rs:287-304 | crates/biome_grit_parser/src/parser/patterns.rs:307-320 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_parser/src/parser/patterns.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"37df2b4d6c1b043192d0ab2b8aa62d13812cc5900e8a778d70783c84ee45053f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/biome_html_parser/src/syntax/svelte.rs:547-557 | crates/biome_html_parser/src/syntax/svelte.rs:559-569 \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/biome_html_parser/src/syntax/svelte.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85470b7c8dd5171248f94ee7ca33b87437bc4424f512550e66c42b7b2e33404"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/biome_html_syntax/src/element_ext.rs:41-51 | crates/biome_html_syntax/src/element_ext.rs:53-63 \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/biome_html_syntax/src/element_ext.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b6b1513804eb63f61cb17b5f7f367b739aeb567606dc25fe548eb022850e1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 9\u002B corresponding lines): crates/biome_js_analyze/src/lint/correctness/no_process_global.rs:69-77 | crates/biome_js_analyze/src/lint/security/no_global_eval.rs:70-78 | crates/biome_js_analyze/src/lint/suspicious/no_global_is_finite.rs:49-57 | crates/biome_js_analyze/src/lint/suspicious/no_global_is_nan.rs:50-58 | crates/biome_js_analyze/src/lint/suspicious/use_is_array.rs:57-67 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/no_process_global.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"702f1c1e2b05cafdfeef218bee14fd03f4a0857c1a33da0f32d70bc5c50880a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/biome_yaml_parser/src/parser/flow.rs:91-101 | crates/biome_yaml_parser/src/parser/flow.rs:103-113 \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/biome_yaml_parser/src/parser/flow.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"07953e7a529653a21593132d067bea59bb75fa38e866ddb477351bd51e595873"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/biome_css_parser/src/syntax/scss/selector/interpolated_pseudo.rs:109-120 | crates/biome_css_parser/src/syntax/scss/selector/interpolated_pseudo.rs:172-183 \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/biome_css_parser/src/syntax/scss/selector/interpolated_pseudo.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ede2ba4df8468620c5535d620f60adefd4372a19ad122d3dcd559ed8822956"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/biome_css_parser/src/syntax/selector/mod.rs:718-732 | crates/biome_css_parser/src/syntax/selector/mod.rs:744-758 \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/biome_css_parser/src/syntax/selector/mod.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"99fdde02dd1674be7914078044d7126ba9ec46096b0e4ce997738e491e8b98fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/biome_css_syntax/src/property_ext.rs:7-21 | crates/biome_js_analyze/src/frameworks/playwright.rs:12-28 \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/biome_css_syntax/src/property_ext.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2bd355584df1ab638557e0efa72ce7f73ee9f6bad27d920a2ae75aef11cacf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/biome_formatter/src/comments/map.rs:211-217 | crates/biome_formatter/src/comments/map.rs:220-226 | crates/biome_formatter/src/comments/map.rs:229-235 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_formatter/src/comments/map.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f689ae449752e00a5b78369d34d06e84dc9b17078f7971c811b2e371d1c8bff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/biome_graphql_parser/src/parser/directive.rs:51-64 | crates/biome_js_parser/src/syntax/class.rs:2759-2774 \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/biome_graphql_parser/src/parser/directive.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b9aefa23cb24cf82c3676a82f00bd793906925b79eb543f8a1b9776535dac31"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/biome_html_analyze/src/lint/a11y/no_noninteractive_element_interactions.rs:115-129 | crates/biome_js_analyze/src/lint/a11y/no_noninteractive_element_interactions.rs:123-140 \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/biome_html_analyze/src/lint/a11y/no_noninteractive_element_interactions.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe7d9f3ae76057b67ec65274c4c2982a9931ad90c2e3e8db967de55b96fddd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/biome_html_analyze/src/lint/nursery/use_vue_valid_v_is.rs:182-192 | crates/biome_html_analyze/src/lint/nursery/use_vue_valid_v_model.rs:367-377 | crates/biome_html_analyze/src/lint/nursery/use_vue_valid_v_show.rs:161-171 \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/biome_html_analyze/src/lint/nursery/use_vue_valid_v_is.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd673e91206ac30758a10c38c89e7a8e59e0254d2c021286e4c3b17c2835d4b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/biome_js_analyze/src/lint/complexity/no_excessive_nested_callbacks.rs:142-162 | crates/biome_js_analyze/src/lint/nursery/no_excessive_statements_per_function.rs:206-225 \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/biome_js_analyze/src/lint/complexity/no_excessive_nested_callbacks.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ce0e03d3e32359c607054b8693f1aff74f40fa4af1fca2976773bbbb08b315"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/biome_js_analyze/src/lint/suspicious/no_useless_regex_backrefs.rs:217-225 | crates/biome_js_analyze/src/lint/suspicious/no_useless_regex_backrefs.rs:226-234 \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/biome_js_analyze/src/lint/suspicious/no_useless_regex_backrefs.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"16965d959b2e24f89380f44ff89cd9911378b9f669f5fe72a313399ffeeb34b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 10\u002B corresponding lines): crates/biome_js_analyze/src/services/embedded.rs:62-72 | crates/biome_js_analyze/src/services/embedded.rs:74-84 | crates/biome_js_analyze/src/services/embedded.rs:86-95 | crates/biome_js_analyze/src/services/embedded.rs:97-106 | crates/biome_js_analyze/src/services/embedded.rs:108-117 | crates/biome_js_analyze/src/services/embedded.rs:122-131 | crates/biome_js_analyze/src/services/embedded.rs:138-147 \u2014 These 7 members are one piece of code written 7 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 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/services/embedded.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"9422dd487e6103db4ee82a7b0419cf4c178ef96b48042f42a130e6ac4499758f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/biome_js_syntax/src/parameter_ext.rs:233-242 | crates/biome_js_syntax/src/parameter_ext.rs:334-343 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_syntax/src/parameter_ext.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d626ead6b67d892bef1e99e79c9d5866943634ae703dc29069cd4b75f28e2b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/biome_css_parser/src/syntax/scss/identifiers/identifier.rs:68-78 | crates/biome_css_parser/src/syntax/scss/identifiers/module_member_access.rs:51-67 \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/biome_css_parser/src/syntax/scss/identifiers/identifier.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d53ca5994e67b5a951470f15061ac04c068ce9d951f5b64b31caa8820d1c83"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/biome_css_parser/src/syntax/value/dimension.rs:52-77 | crates/biome_tailwind_parser/src/syntax/css_value.rs:165-175 \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/biome_css_parser/src/syntax/value/dimension.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed46a4996b227f5437039e86161b577530eb7476d7b280cf0944a2ee909802df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/biome_diagnostics/src/context.rs:573-584 | crates/biome_diagnostics/src/context.rs:586-597 \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/biome_diagnostics/src/context.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"8127647b0904b0c951b7ca3e6ef3fae56344541cada3230491c36f00f7adb205"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/biome_embeds/src/bindings.rs:55-65 | crates/biome_embeds/src/bindings.rs:71-82 | crates/biome_embeds/src/bindings.rs:88-99 \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/biome_embeds/src/bindings.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"8447784f00a6421b3656897e1ee978be3ba2f7dc9c2fd30b5fb8b661a999dd3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/biome_grit_formatter/src/grit/auxiliary/version.rs:7-27 | crates/biome_html_formatter/src/svelte/auxiliary/each_opening_block.rs:7-27 \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/biome_grit_formatter/src/grit/auxiliary/version.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee363e647e6ed168f9ae37fbe8de357c79c70f634ae7cc2c42c89e8a27b7de1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/biome_grit_patterns/src/grit_binding.rs:109-115 | crates/biome_grit_patterns/src/grit_binding.rs:117-123 \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/biome_grit_patterns/src/grit_binding.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"30dd43de241ccaf545679acf6177234dd5c69bcb6546f40060c00cddbe2adb39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/biome_html_parser/src/syntax/vue.rs:289-298 | crates/biome_html_parser/src/syntax/vue.rs:300-313 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_parser/src/syntax/vue.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"b56794d95dc45fd01efb2c25391d01e40a6751fe1aa79772d81272493e8f1f5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/biome_js_analyze/src/lint/a11y/use_key_with_mouse_events.rs:112-122 | crates/biome_js_analyze/src/lint/a11y/use_key_with_mouse_events.rs:124-134 \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/biome_js_analyze/src/lint/a11y/use_key_with_mouse_events.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec6026fb615a61149964ef50d321295b4b9aaa8724d73ecd9d37790f7f747a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 17\u002B corresponding lines): crates/biome_js_parser/src/lexer/mod.rs:1915-1931 | crates/biome_js_parser/src/lexer/mod.rs:1964-1980 | crates/biome_js_parser/src/lexer/mod.rs:1983-1999 | crates/biome_js_parser/src/lexer/mod.rs:2002-2018 | crates/biome_js_parser/src/lexer/mod.rs:2046-2062 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_parser/src/lexer/mod.rs"},"region":{"startLine":1915}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a7888ad4cfdc9895ffc8636d6e1d5820867dcd3dc9e883900eb9fd042d4fa6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/biome_js_syntax/src/numbers.rs:83-90 | crates/biome_js_syntax/src/unescape.rs:73-80 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_syntax/src/numbers.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd657843f70b8d180c7e8e5c2335850a1b031ad865dc1d6565e747282848d8ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/biome_module_graph/src/db/queries/type_inference/calls.rs:85-96 | crates/biome_module_graph/src/db/queries/type_inference/calls.rs:117-130 \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/biome_module_graph/src/db/queries/type_inference/calls.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a996a5de123841e6eef87dfa08a2d04687fe828e4c0aa07bf7d094dbe89c8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/biome_resolver/src/lib.rs:1373-1387 | crates/biome_resolver/src/lib.rs:1389-1403 \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/biome_resolver/src/lib.rs"},"region":{"startLine":1373}}}],"partialFingerprints":{"codehealthFindingId/v1":"4521e36a5c80308f625a28cf164d0e28e30bf065efa88a49a4d41325db4c5083"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/biome_rowan/src/cursor/node.rs:901-906 | crates/biome_rowan/src/cursor/node.rs:1101-1106 \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/biome_rowan/src/cursor/node.rs"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"01593af46ff0d64a16ee267900c9d0c572a20f7a58403f82b4dcc393131daa33"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/biome_css_formatter/src/context.rs:105-116 | crates/biome_graphql_formatter/src/context.rs:76-87 | crates/biome_grit_formatter/src/context.rs:73-84 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_formatter/src/context.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"a759cca8c06c4ad5261009099baf851134b30b1babf4a5317ab84d6d89ccf2e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/biome_css_parser/src/syntax/at_rule/container/mod.rs:307-321 | crates/biome_css_parser/src/syntax/at_rule/container/mod.rs:623-639 | crates/biome_css_parser/src/syntax/value/if.rs:528-538 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 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/biome_css_parser/src/syntax/at_rule/container/mod.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad932760ab0069a1237e8357a16b92e4409411aa4a1cd89b5dd393abdaf4320d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 12\u002B corresponding lines): crates/biome_graphql_parser/src/parser/definitions/enum.rs:19-35 | crates/biome_graphql_parser/src/parser/definitions/input_object.rs:20-36 | crates/biome_graphql_parser/src/parser/definitions/interface.rs:27-46 | crates/biome_graphql_parser/src/parser/definitions/object.rs:17-35 | crates/biome_graphql_parser/src/parser/definitions/scalar.rs:15-26 | crates/biome_graphql_parser/src/parser/definitions/union.rs:24-40 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_graphql_parser/src/parser/definitions/enum.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c18bc817d342479ee3389da80a580e62d7f794b0cb6268b5c5c014612d0497b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 13\u002B corresponding lines): crates/biome_grit_parser/src/parser/literals.rs:190-202 | crates/biome_grit_parser/src/parser/patterns.rs:841-855 | crates/biome_grit_parser/src/parser/patterns.rs:858-872 | crates/biome_grit_parser/src/parser/patterns.rs:932-945 | crates/biome_grit_parser/src/parser/patterns.rs:968-983 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_parser/src/parser/literals.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"499f8df4f75ef90383d2d50eaed554041e567eef0b5247e2f996bc81db7a0e7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/biome_html_parser/src/syntax/svelte.rs:278-289 | crates/biome_html_parser/src/syntax/svelte.rs:1051-1062 | crates/biome_html_parser/src/syntax/svelte.rs:1416-1423 \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/biome_html_parser/src/syntax/svelte.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"9436c4a119a23406b6928ca47b1d5f4c1fdf7979c9a86fdcbf38358cde835b0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): crates/biome_js_parser/src/syntax/typescript/types.rs:176-185 | crates/biome_js_parser/src/syntax/typescript/types.rs:196-205 | crates/biome_js_parser/src/syntax/typescript/types.rs:548-558 | crates/biome_js_parser/src/syntax/typescript/types.rs:1124-1133 \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/biome_js_parser/src/syntax/typescript/types.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e179006f568186a95a0fd651780d0b47008dff23255f63ae2b16d5f9d80b84d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/biome_markdown_parser/src/lexer/mod.rs:1304-1323 | crates/biome_markdown_parser/src/lexer/mod.rs:1369-1392 \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/biome_markdown_parser/src/lexer/mod.rs"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"376e042b90dfe2299f6d7720e1b8893ddcc09eb099fede10113e18f9d1ed31b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/biome_markdown_parser/src/syntax/list.rs:2544-2560 | crates/biome_markdown_parser/src/syntax/table.rs:257-269 \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/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":2544}}}],"partialFingerprints":{"codehealthFindingId/v1":"b624437eda9c30a0cd1b151780d246ca1b5765e75976181ec93335fe5a4ceda1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/biome_parser/src/lib.rs:381-390 | crates/biome_parser/src/lib.rs:393-402 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_parser/src/lib.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1b3eb3d24f66720fd3418af915f283895f1b444b6a7b9fb4060f8ace7f6ab6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/biome_service/src/file_handlers/html/parse_embedded_nodes.rs:780-792 | crates/biome_service/src/file_handlers/html/parse_embedded_nodes.rs:917-929 \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/biome_service/src/file_handlers/html/parse_embedded_nodes.rs"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"b053e1ca283438e56990e5fe86c40c7f1af1557882e37e357093f11e45dc3e85"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/biome_service/src/file_handlers/mod.rs:255-263 | crates/biome_service/src/workspace/server.rs:257-267 \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/biome_service/src/file_handlers/mod.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbc89bceb4abfc93a45436635ce476b178178df2acc2d387126beaa57745e5a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/biome_css_analyze/src/lint/style/no_value_at_rule.rs:61-77 | crates/biome_css_analyze/src/lint/suspicious/no_important_in_keyframe.rs:93-110 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_analyze/src/lint/style/no_value_at_rule.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b9fc4b32321c81ed269fd4fcf3d9980c97f57c38b6ab688579cebd861aba936"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 18\u002B corresponding lines): crates/biome_css_formatter/src/css/auxiliary/supports_and_condition.rs:8-25 | crates/biome_css_formatter/src/css/auxiliary/supports_or_condition.rs:8-25 | crates/biome_css_formatter/src/css/auxiliary/value_at_rule_named_import_specifier.rs:16-33 | crates/biome_css_formatter/src/tailwind/statements/custom_variant_at_rule.rs:8-27 | crates/biome_css_formatter/src/tailwind/statements/utility_at_rule.rs:8-25 | crates/biome_css_formatter/src/tailwind/statements/variant_at_rule.rs:8-25 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_formatter/src/css/auxiliary/supports_and_condition.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c87dd42d2e95c8c156c74f1d3d9e675580d2086ff2687c7c319abec1e8395fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 14\u002B corresponding lines): crates/biome_css_parser/src/syntax/at_rule/container/mod.rs:329-347 | crates/biome_css_parser/src/syntax/at_rule/container/mod.rs:472-489 | crates/biome_css_parser/src/syntax/at_rule/container/mod.rs:756-774 | crates/biome_css_parser/src/syntax/at_rule/media.rs:369-382 | crates/biome_css_parser/src/syntax/at_rule/supports/mod.rs:255-272 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_parser/src/syntax/at_rule/container/mod.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f1cd49f7f04d9eb36fb24a46f7465daada4f9cefbda9d62cc95a400ef58ff43"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/biome_formatter/src/comments/map.rs:493-503 | crates/biome_formatter/src/comments/map.rs:505-515 \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/biome_formatter/src/comments/map.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a8176246c5a3d2c5f64475d3dacf10ac90a651582be8df86babdba9b9bde9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): crates/biome_graphql_parser/src/parser/value.rs:104-113 | crates/biome_js_parser/src/syntax/jsx/mod.rs:812-833 | crates/biome_js_parser/src/syntax/typescript/types.rs:563-572 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_graphql_parser/src/parser/value.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd6bb3ecbbbf506e102c6cb6bd07eaf2558ad25f91a1b6ecd209e79891985d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/biome_grit_formatter/src/grit/auxiliary/files.rs:7-25 | crates/biome_js_formatter/src/ts/classes/constructor_signature_class_member.rs:16-34 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_formatter/src/grit/auxiliary/files.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc2ad23ac21b2c5261383c85ea7cbc5dfb2378cdc50a7e4184e0b0ca6037dac1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/biome_html_analyze/src/lint/a11y/use_media_caption.rs:110-124 | crates/biome_js_analyze/src/lint/a11y/use_iframe_title.rs:106-120 \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/biome_html_analyze/src/lint/a11y/use_media_caption.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c7296c5d34ade4337b969a54dd3f510b6693feeaeb6697837966e030579ff4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/biome_js_parser/src/syntax/class.rs:1227-1239 | crates/biome_js_parser/src/syntax/expr.rs:1725-1734 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_parser/src/syntax/class.rs"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e08ad31997e5def637d7a3c69643ce93630083f2623b18919f73aaa2dd03f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/biome_js_syntax/src/parentheses/expression.rs:800-813 | crates/biome_js_syntax/src/parentheses/tstype.rs:52-62 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_syntax/src/parentheses/expression.rs"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aee359e4e0652cca074101761e4df9b69d70d5ee3c903adbb57822b86eab648"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 12\u002B corresponding lines): crates/biome_lsp/src/session.rs:844-855 | crates/biome_lsp/src/session.rs:858-869 | crates/biome_lsp/src/session.rs:872-883 | crates/biome_lsp/src/session.rs:886-897 | crates/biome_lsp/src/session.rs:900-911 | crates/biome_lsp/src/session.rs:937-948 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/session.rs"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd4eb4a4193ec46934aac407aa088e202ac675c68cb6577285c0e35bcad17f5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/biome_markdown_formatter/src/markdown/lists/block_list.rs:727-742 | crates/biome_markdown_formatter/src/bullet_list.rs:590-601 \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/biome_markdown_formatter/src/markdown/lists/block_list.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a27624d3b67fec01f5316f9635fed921563c5aacee2db23316d10e8d7a9e23"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/biome_js_analyze/src/lint/correctness/no_constructor_return.rs:84-96 | crates/biome_js_analyze/src/lint/correctness/no_setter_return.rs:100-113 \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/biome_js_analyze/src/lint/correctness/no_constructor_return.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a2e6437db794f2e864e9a788e28cc47c079dd8f6db4642060d555a45b95ab2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/biome_js_analyze/src/lint/correctness/no_private_imports.rs:335-353 | crates/biome_js_analyze/src/lint/correctness/no_private_imports.rs:360-380 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/no_private_imports.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"0889ee057a77d8b474debde5582acb75beb2bcf80f851962bb39f382244847ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/biome_js_analyze/src/lint/nursery/no_excessive_statements_per_function.rs:303-310 | crates/biome_js_analyze/src/lint/nursery/no_invalid_remove_event_listener.rs:173-179 \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/biome_js_analyze/src/lint/nursery/no_excessive_statements_per_function.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f27b50b03584bea36989af137396af5643d5b5eb72763af44274e4b93189bb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/biome_js_analyze/src/lint/performance/no_img_element.rs:101-114 | crates/biome_js_analyze/src/lint/suspicious/no_document_import_in_page.rs:85-98 \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/biome_js_analyze/src/lint/performance/no_img_element.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ae644f69d799fe98d7fc9ca215ff86bbc885a5cce26e67db9c90bb497060816"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/biome_js_syntax/src/jsx_ext.rs:46-52 | crates/biome_js_syntax/src/jsx_ext.rs:54-60 \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/biome_js_syntax/src/jsx_ext.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7408e370eb4cf3d1e978f4032418a7ff89ab9e1772982b14aebc5abc2488cad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/biome_json_analyze/src/lint/nursery/use_package_json_cpu.rs:57-65 | crates/biome_json_analyze/src/lint/nursery/use_package_json_engines.rs:62-75 \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/biome_json_analyze/src/lint/nursery/use_package_json_cpu.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed544d8b3a7c0a814760842dfbe6ad4be53b928fe3c9b33c6c0d6bddf6d037a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/biome_package/src/node_js_package/turbo_json.rs:118-126 | crates/biome_package/src/node_js_package/tsconfig_json.rs:45-53 \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/biome_package/src/node_js_package/turbo_json.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"c906862b47794e7a805483de5ebd7ed2e35fe71dac707e6b0157096aaf54033f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/biome_react_compiler/src/convert_ast/expressions.rs:925-935 | crates/biome_react_compiler/src/convert_ast/jsx.rs:190-200 \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/biome_react_compiler/src/convert_ast/expressions.rs"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"3648982a38426f85ff04c84d27537b21781e873ac3aec125adf998180198b500"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/biome_cli/src/logging.rs:160-169 | crates/biome_diagnostics/src/diagnostic.rs:154-162 \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/biome_cli/src/logging.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ead4e62be2ef5e5cf6902dae04869c08f1825f7c9c5a5bc1c118e78dce42c6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/biome_configuration/src/analyzer/mod.rs:460-473 | crates/biome_configuration/src/analyzer/mod.rs:505-520 \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/biome_configuration/src/analyzer/mod.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"afcdd509a6d804681abf79298fa044f12dcf919835fc9ac3d48851c57f20c5f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/biome_css_parser/src/syntax/at_rule/tailwind.rs:135-150 | crates/biome_css_parser/src/syntax/value/function/tailwind.rs:10-22 \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/biome_css_parser/src/syntax/at_rule/tailwind.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ce9b7cb2a746588709952d3bade4ce88fedf2202b622cc3060a91c7c050665"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 8\u002B corresponding lines): crates/biome_css_syntax/src/lib.rs:229-238 | crates/biome_html_syntax/src/lib.rs:153-160 | crates/biome_js_syntax/src/lib.rs:308-320 | crates/biome_json_syntax/src/lib.rs:115-124 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_syntax/src/lib.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d3d9c174e5c1146952e3721c9735544aa35b2a4cfb2ae2b8de98836bcd8c08c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/biome_graphql_semantic/src/semantic_model/binding.rs:51-59 | crates/biome_graphql_semantic/src/semantic_model/reference.rs:55-63 \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/biome_graphql_semantic/src/semantic_model/binding.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"18e614ce810c7a05d205435700659495ef4622047879f4bb27525a6482cbba6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/biome_grit_patterns/src/grit_target_node.rs:518-535 | crates/biome_grit_patterns/src/grit_target_node.rs:562-576 \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/biome_grit_patterns/src/grit_target_node.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca6b4da380d9bd3a00e6a5401af597efdf6bfc2aec324b958264fc801384838"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/biome_html_analyze/src/lint/a11y/use_html_lang.rs:72-85 | crates/biome_js_analyze/src/lint/a11y/use_html_lang.rs:100-113 \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/biome_html_analyze/src/lint/a11y/use_html_lang.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"d27223ab43d2d3d0fadc5a3c6487c65efb2290117a7e2432b3f8edf5260d960d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/biome_html_analyze/src/lint/a11y/use_valid_aria_role.rs:118-135 | crates/biome_js_analyze/src/lint/a11y/use_valid_aria_role.rs:145-159 \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/biome_html_analyze/src/lint/a11y/use_valid_aria_role.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1cf414c9c32bda0139906c1e6cb9f309f12dbf02a98cbc84f5b8fd614c2e04f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/biome_html_parser/src/syntax/vue.rs:400-410 | crates/biome_html_parser/src/syntax/vue.rs:412-422 | crates/biome_html_parser/src/syntax/vue.rs:456-468 \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/biome_html_parser/src/syntax/vue.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f825b331140be0bd719a8470622888a5e9c1675919ff0306b0d4f2061120f32"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): crates/biome_js_syntax/src/expr_ext.rs:302-307 | crates/biome_js_syntax/src/expr_ext.rs:310-315 | crates/biome_js_syntax/src/expr_ext.rs:318-323 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\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/biome_js_syntax/src/expr_ext.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c55557589936fa9cc793c9ccbe718ef43a8eb9c753b4322375ef79f54da8fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/biome_markdown_parser/src/syntax/list.rs:2492-2502 | crates/biome_markdown_parser/src/syntax/list.rs:2507-2514 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":2492}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd1fbe3e4603ac53b17d86773d760e0c37221bcf1d273946627db6519cb85078"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): crates/biome_package/src/node_js_package/mod.rs:36-44 | crates/biome_package/src/node_js_package/mod.rs:50-58 | crates/biome_package/src/node_js_package/mod.rs:88-96 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_package/src/node_js_package/mod.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"70499043178b17e3c89477fbb140a62d4284a3286597691abfea1e9b5b2940ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/biome_react_compiler/src/convert_ast/jsx.rs:159-167 | crates/biome_react_compiler/src/convert_ast/jsx.rs:274-282 \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/biome_react_compiler/src/convert_ast/jsx.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"4351bbe33c1ba16181d58528db3c4a60fa7c2c102f86fafa90b7e1240c1a120c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/biome_rule_options/src/use_nullish_coalescing.rs:147-155 | crates/biome_rule_options/src/no_undeclared_dependencies.rs:56-62 \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/biome_rule_options/src/use_nullish_coalescing.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"7514b696427e93a0cb9949455d81527be3d5f36084deeac234ab1854a5d9a41b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/biome_css_analyze/src/lint/nursery/no_undeclared_custom_properties.rs:78-93 | crates/biome_html_analyze/src/lint/nursery/use_vue_consistent_v_slot_style.rs:227-241 \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/biome_css_analyze/src/lint/nursery/no_undeclared_custom_properties.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d4f4e13348530f3999ddf980872bfbea618686aa5c0c61162efa0c8cba9ecf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): crates/biome_css_formatter/src/css/auxiliary/container_scroll_state_query_in_parens.rs:15-34 | crates/biome_css_formatter/src/css/auxiliary/type_function.rs:9-28 | crates/biome_css_formatter/src/scss/auxiliary/at_root_query.rs:9-26 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_formatter/src/css/auxiliary/container_scroll_state_query_in_parens.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f24c1d4ec3649aa1b551a04014f1bf504bbf0de0f1c08ea1d7f307f9cdd9ba1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): crates/biome_css_formatter/src/css/auxiliary/scope_at_rule_declarator.rs:13-26 | crates/biome_js_formatter/src/js/assignments/array_assignment_pattern_element.rs:15-24 | crates/biome_js_formatter/src/js/assignments/object_assignment_pattern_shorthand_property.rs:17-27 | crates/biome_js_formatter/src/js/module/import_bare_clause.rs:11-21 \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/biome_css_formatter/src/css/auxiliary/scope_at_rule_declarator.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6261c59aa9b8f4dede80959809b07f57a86f7877631e70e0097ea82821c3f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/biome_css_formatter/src/tailwind/auxiliary/theme_prefix_option.rs:8-25 | crates/biome_css_formatter/src/scss/auxiliary/module_member_access.rs:8-23 \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/biome_css_formatter/src/tailwind/auxiliary/theme_prefix_option.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e13971e7cb543942595065306e85d5ba512475cdb4f9a1b45230f2d3aaaf794"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/biome_js_analyze/src/lint/security/no_script_url.rs:164-181 | crates/biome_html_analyze/src/lint/security/no_script_url.rs:85-101 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/security/no_script_url.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c4b28018dcfb498a04c49df1883c747539b3d5029ce7050d9d2d65f6755b38"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/biome_js_analyze/src/lint/suspicious/no_catch_assign.rs:88-106 | crates/biome_js_analyze/src/lint/suspicious/no_ts_ignore.rs:87-108 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/no_catch_assign.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b89de6bef087b888bf69b224357164ec48fd109ca118e9444d8c0aee124a2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/biome_js_formatter/src/js/expressions/arrow_function_expression.rs:858-865 | crates/biome_js_analyze/src/lint/a11y/no_redundant_alt.rs:145-154 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/js/expressions/arrow_function_expression.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d811970a7d909d260f878223c4c7aa0a66fd8aefffe9955db2dc604b801a72"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/biome_service/src/file_handlers/html.rs:330-344 | crates/biome_service/src/file_handlers/json.rs:69-82 \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/biome_service/src/file_handlers/html.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"2030eb20553b69605d593f90cfd66542a8ea42a28ec21a1b105fed9680f8ed50"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): crates/biome_service/src/file_handlers/html.rs:773-781 | crates/biome_service/src/file_handlers/javascript.rs:1073-1081 | crates/biome_service/src/file_handlers/json.rs:525-533 | crates/biome_service/src/file_handlers/md.rs:518-526 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/html.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e805a6f569f4ec44507b93fb1093ab077a13a663429c29fd1e47b9c23a1bd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/biome_service/src/file_handlers/md.rs:487-497 | crates/biome_service/src/file_handlers/yaml.rs:398-407 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/md.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e2ecfd1e3d645cb857eff58b1fa00007829548cce071b40a2566e9e6ecdb2ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 17\u002B corresponding lines): crates/biome_css_formatter/src/css/auxiliary/custom_media_at_rule_declarator.rs:13-32 | crates/biome_css_formatter/src/css/auxiliary/media_at_rule_declarator.rs:13-46 | crates/biome_css_formatter/src/css/statements/page_at_rule.rs:8-25 | crates/biome_css_formatter/src/scss/statements/import_at_rule.rs:10-26 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_formatter/src/css/auxiliary/custom_media_at_rule_declarator.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf8adca692d603593a77e60123de2bd79b333bf6b5d3693496e6e6e37bf20403"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/biome_css_formatter/src/utils/scss_include_comments.rs:332-343 | crates/biome_css_formatter/src/utils/comment_trivia.rs:95-105 \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/biome_css_formatter/src/utils/scss_include_comments.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c3cd898b0cbd9cccef213a68214a57a4d29166c2e95788fb44950cc687fdd13"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): crates/biome_css_parser/src/syntax/scss/expression/list.rs:249-265 | crates/biome_css_parser/src/syntax/scss/identifiers/interpolated_identifier.rs:83-96 | crates/biome_css_parser/src/syntax/scss/value/interpolated_value.rs:232-247 \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/biome_css_parser/src/syntax/scss/expression/list.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e364af890bc3dbeb94289ffd1cee2a5a625e4e855b0cc4aaf442cf4fa66177a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 8\u002B corresponding lines): crates/biome_formatter_test/src/snapshot_builder.rs:69-78 | crates/biome_formatter_test/src/snapshot_builder.rs:109-120 | crates/biome_formatter_test/src/snapshot_builder.rs:173-180 | crates/biome_formatter_test/src/snapshot_builder.rs:198-208 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_formatter_test/src/snapshot_builder.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba945fcce39a049315110b5fe753cab91395a90c5d7052ee1162812b2f1e7b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/biome_graphql_formatter/src/graphql/extensions/scalar_type_extension.rs:12-31 | crates/biome_html_formatter/src/svelte/auxiliary/key_opening_block.rs:8-26 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_graphql_formatter/src/graphql/extensions/scalar_type_extension.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9086e0b99be944dd31b74cb0ea89dc4dde8aff6115edeee5b8844015bb2ddd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/biome_js_analyze/src/lint/nursery/no_confusing_array_splice.rs:284-291 | crates/biome_js_analyze/src/lint/nursery/use_string_starts_ends_with.rs:650-657 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_confusing_array_splice.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"25db1956d835b086514b925347f16fb604b9d9f8087bb4b27d8cd953a18f4f6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/biome_js_analyze/src/lint/nursery/no_unsafe_plus_operands.rs:239-246 | crates/biome_js_analyze/src/lint/nursery/use_nullish_coalescing.rs:995-1003 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_unsafe_plus_operands.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"6329b9c642cf88beacf7cf573de62da13ecf84706f80c72c785fb64bfc3a2fcf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/biome_js_analyze/src/lint/suspicious/no_undeclared_env_vars.rs:225-236 | crates/biome_js_analyze/src/lint/nursery/no_implied_eval.rs:222-232 \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/biome_js_analyze/src/lint/suspicious/no_undeclared_env_vars.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d8f7d01f8097d180262afa2fbdee005dbc17b59d6a48a9825b3d50af677582"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/biome_migrate/src/analyzers/all.rs:34-45 | crates/biome_migrate/src/analyzers/organize_imports.rs:62-73 \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/biome_migrate/src/analyzers/all.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"1311ca7b913018fff1ce9e25d71ff44296d70e32c557f2cc21f9f3f0c46b6d11"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): crates/biome_css_formatter/src/css/auxiliary/media_type_query.rs:13-24 | crates/biome_css_formatter/src/scss/selectors/partial_combinator_selector.rs:13-21 | crates/biome_js_formatter/src/js/module/export_named_shorthand_specifier.rs:15-23 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_formatter/src/css/auxiliary/media_type_query.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"852906a07bc9dbcff76a398b799d64f16e32adc20c4fef59160fdbb049afe0f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/biome_css_semantic/src/semantic_model/db.rs:144-153 | crates/biome_js_analyze/src/lint/nursery/use_better_dom_traversing.rs:373-381 \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/biome_css_semantic/src/semantic_model/db.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c7ff182c6e5227aa23d4976521ad615714bb3bc4ed51c1adde579c1e7a38b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): crates/biome_grit_patterns/src/grit_css_parser.rs:44-52 | crates/biome_grit_patterns/src/grit_js_parser.rs:52-60 | crates/biome_grit_patterns/src/grit_json_parser.rs:43-51 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_patterns/src/grit_css_parser.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d43403a7ec90c8e1d37eda5f4a7c898bba61a6b19315efe1bec27959fb41a16"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/biome_html_analyze/src/lint/a11y/no_distracting_elements.rs:75-87 | crates/biome_js_analyze/src/lint/a11y/no_distracting_elements.rs:70-82 | crates/biome_js_analyze/src/lint/suspicious/no_shadow_restricted_names.rs:73-87 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/a11y/no_distracting_elements.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7b2074741b3efbb70b2af2aeec73f677f69304e14ddd6568398725b6fe1e44d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/biome_html_analyze/src/lint/nursery/use_vue_consistent_event_hyphenation.rs:278-290 | crates/biome_ruledoc/src/lower.rs:262-271 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/nursery/use_vue_consistent_event_hyphenation.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9d6cca87c4635d0b22621409147ee66a6c2150ab0465348e537d874d1e3fcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/biome_service/src/workspace.rs:402-409 | crates/biome_service/src/workspace.rs:416-426 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/workspace.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"27bbc33d6cf47cc8625f516d56dc9a05d7525dd2af6c6d2d6d5a2294be685eb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/biome_css_parser/src/syntax/scss/at_rule/else_clause.rs:28-40 | crates/biome_css_parser/src/syntax/at_rule/mod.rs:291-302 \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/biome_css_parser/src/syntax/scss/at_rule/else_clause.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc216a12b604d04283f8b2ffbce3f6fb60be0be2fe906292c99e3a2a461e4bad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/biome_css_parser/src/syntax/scss/at_rule/mod.rs:114-127 | crates/biome_html_parser/src/syntax/svelte.rs:1396-1407 \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/biome_css_parser/src/syntax/scss/at_rule/mod.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"b365f13a386dc4b79de0cf1bc0e140ed0e4a59acf788e889ae227f4d23ab084d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/biome_js_analyze/src/lint/nursery/no_process_exit.rs:92-109 | crates/biome_js_analyze/src/lint/style/no_process_env.rs:89-103 \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/biome_js_analyze/src/lint/nursery/no_process_exit.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0e11398ea1d0e598205f3d54f4c6e02e7e6f772295636c6fea000d81466860"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/biome_js_analyze/src/lint/nursery/no_useless_qualifier.rs:382-390 | crates/biome_migrate/src/analyzers/no_restriected_globals.rs:114-122 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_useless_qualifier.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"546d73cf2dd9154d0e524c1158f163a6d1f130b349e5598a76c025206ee24651"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/biome_js_analyze/src/lint/nursery/use_while_loop_condition.rs:352-364 | crates/biome_js_analyze/src/lint/suspicious/no_shadow.rs:320-330 \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/biome_js_analyze/src/lint/nursery/use_while_loop_condition.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9a5fb7c0a4a205ca153d6c4e6da0ff57ee205fdac4c163542bd2f38e3eea58"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 17\u002B corresponding lines): crates/biome_css_formatter/src/scss/auxiliary/module_configuration_list.rs:14-30 | crates/biome_graphql_formatter/src/graphql/value/object_value.rs:8-26 | crates/biome_js_formatter/src/js/statements/with_statement.rs:12-32 | crates/biome_js_formatter/src/ts/auxiliary/call_signature_type_member.rs:15-34 | crates/biome_json_formatter/src/json/auxiliary/member.rs:9-25 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_formatter/src/scss/auxiliary/module_configuration_list.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"91dcf2db14c7a1cbc97f43b51cc17e606d116566afc5a31ddf7e50fd13128496"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/biome_css_parser/src/syntax/declaration.rs:233-241 | crates/biome_css_parser/src/syntax/scss/at_rule/extend_at_rule.rs:62-73 \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/biome_css_parser/src/syntax/declaration.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e698bad7ab2ece64bac85a4bca7fb6981e0015ef91658dde1451b1f1cb908e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/biome_css_parser/src/syntax/selector/mod.rs:674-685 | crates/biome_js_parser/src/syntax/module.rs:391-402 \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/biome_css_parser/src/syntax/selector/mod.rs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a2d390f4eb88ec786913d7e13753b5005ffd4de519f15baea924075fcdc27e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/biome_deserialize/src/diagnostics.rs:221-231 | crates/biome_parser/src/diagnostic.rs:102-110 \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/biome_deserialize/src/diagnostics.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"30c326c23c145851143728d87a11cf08878dee3c408de707ab60ff8065372354"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/biome_formatter/src/builders.rs:1529-1537 | crates/biome_formatter/src/builders.rs:2573-2579 \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/biome_formatter/src/builders.rs"},"region":{"startLine":1529}}}],"partialFingerprints":{"codehealthFindingId/v1":"e75288299a768cc458578182d4b21d705e07eccb588a9a34bd750faf64a4a472"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/biome_js_analyze/src/lint/nursery/use_vue_single_event_payload.rs:209-213 | crates/biome_js_analyze/src/lint/nursery/no_shared_branch_code.rs:283-287 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_vue_single_event_payload.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5930541b218e03baa32cc0038d4f8abe19b624d4aadc2638f6c87d1adc38cb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/biome_migrate/src/analyzers/all.rs:22-32 | crates/biome_migrate/src/analyzers/trailing_comma.rs:23-33 \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/biome_migrate/src/analyzers/all.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"5439dd081e18886919fa89d814cf4227d05d2467e9f22017ae36974ad9ee7b11"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 12\u002B corresponding lines): crates/biome_css_formatter/src/css/auxiliary/composes_import_specifier.rs:12-24 | crates/biome_css_formatter/src/css/auxiliary/supports_not_condition.rs:8-19 | crates/biome_css_formatter/src/css/auxiliary/value_at_rule_import_clause.rs:12-29 | crates/biome_css_formatter/src/scss/auxiliary/forward_as_clause.rs:9-25 | crates/biome_css_formatter/src/scss/auxiliary/use_as_clause.rs:9-23 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_formatter/src/css/auxiliary/composes_import_specifier.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"37dd672716fddc2948f540633a759d57ad91dd03f5198c4116092f8202564fcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/biome_css_parser/src/lexer/mod.rs:486-492 | crates/biome_json_parser/src/lexer/mod.rs:301-307 | crates/biome_parser/src/lexer.rs:323-329 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_parser/src/lexer/mod.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"764428df0d63c0d1c09fe4a1bfd8b7d0df6170ec0d511a5b9f1cf061bdb7ac09"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 13\u002B corresponding lines): crates/biome_graphql_analyze/src/assist/source/use_sorted_enum_members.rs:145-157 | crates/biome_graphql_analyze/src/assist/source/use_sorted_selection_set.rs:214-228 | crates/biome_graphql_analyze/src/assist/source/use_sorted_type_fields.rs:186-200 | crates/biome_graphql_analyze/src/assist/source/use_sorted_type_fields.rs:202-216 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_graphql_analyze/src/assist/source/use_sorted_enum_members.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ce97236f3e06581894cc356c7f8afbbbe06a38fe40dd88563e2722ff86dc18"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/biome_grit_patterns/src/grit_node.rs:46-54 | crates/biome_grit_patterns/src/grit_target_node.rs:377-385 \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/biome_grit_patterns/src/grit_node.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0cc967b5c1de4a5bd1b927c26894099c168a939fb7b94fadb607ac0be854524"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/biome_html_analyze/src/lint/a11y/no_redundant_alt.rs:102-118 | crates/biome_js_analyze/src/lint/a11y/no_redundant_alt.rs:126-142 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/a11y/no_redundant_alt.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c1029488940aeb81a425f61d3e82551651f42f3836e320f0c29189de8a76f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/biome_js_analyze/src/frameworks/mod.rs:94-101 | crates/biome_js_analyze/src/shared/node_process.rs:12-18 \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/biome_js_analyze/src/frameworks/mod.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"a00e64a9597d4329c82da40a7f25bf678e3e82bf942cc27d8252e0b257d50308"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 8\u002B corresponding lines): crates/biome_js_analyze/src/lint/nursery/no_eager_array_methods_in_loops.rs:386-394 | crates/biome_js_analyze/src/lint/nursery/no_invalid_fetch_options.rs:316-324 | crates/biome_js_analyze/src/lint/nursery/no_unreadable_for_of_expression.rs:350-358 | crates/biome_js_analyze/src/lint/nursery/use_global_regex_in_match_all.rs:189-198 | crates/biome_js_analyze/src/lint/nursery/use_math_trunc.rs:403-410 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_eager_array_methods_in_loops.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"d46e57f54943864e1125cb724037b166f40edd9454f1a0847580659c8ab5cf15"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/biome_js_parser/src/syntax/jsx/mod.rs:635-647 | crates/biome_js_parser/src/syntax/module.rs:1511-1521 \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/biome_js_parser/src/syntax/jsx/mod.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"6611bdae60978960f941f30f7ffad0022bdf002b6d4fdbf51b3839045153b503"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/biome_js_parser/src/syntax/module.rs:1333-1347 | crates/biome_js_parser/src/syntax/module.rs:1352-1371 \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/biome_js_parser/src/syntax/module.rs"},"region":{"startLine":1333}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8efe8c2589b57db746b4eacb56a670e58a6b43324aab7975d2b6996cb868937"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/biome_js_runtime/src/ast.rs:273-281 | crates/biome_js_runtime/src/ast.rs:283-293 \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/biome_js_runtime/src/ast.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"f51697642eb8290cf8f22637c8e120e0cd7e1abc5c014fbfbeff2bc6d39aa7f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/biome_js_semantic/src/lib.rs:22-28 | crates/biome_js_semantic/src/semantic_model/builder.rs:163-170 \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/biome_js_semantic/src/lib.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58c0d75151236dab4e26330e0cbc922f6f6aec548c5dc359b62d5ea706b8eda"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/biome_markdown_parser/src/lexer/mod.rs:1352-1363 | crates/biome_markdown_parser/src/syntax/table.rs:414-425 \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/biome_markdown_parser/src/lexer/mod.rs"},"region":{"startLine":1352}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f15156c4575b4088ac0c9ebe2bdd3da25dba42f758398b118724fb8bce46b24"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/biome_css_formatter/src/css/selectors/compound_selector.rs:8-23 | crates/biome_js_formatter/src/js/auxiliary/svelte_snippet_root.rs:7-21 \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/biome_css_formatter/src/css/selectors/compound_selector.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2e0acb3a9f75021ba22e08927d5002e2474f2f0af7f17770b95c64f8508200d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/biome_css_parser/src/syntax/scss/identifiers/identifier.rs:48-57 | crates/biome_graphql_parser/src/parser/variable.rs:8-18 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_parser/src/syntax/scss/identifiers/identifier.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"f325362627e4da807b936a547018ced46913c37a46f732c659d2565474952680"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/biome_css_parser/src/token_source.rs:58-69 | crates/biome_js_parser/src/token_source.rs:31-38 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_parser/src/token_source.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"b50ee1112aa86ea7ed0fcb22f689c59677a1084bdc0880317e8647cab5805600"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/biome_diagnostics/src/display/diff.rs:780-792 | crates/biome_diagnostics/src/display/frame.rs:433-445 \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/biome_diagnostics/src/display/diff.rs"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2abb4cab50bb7abf887b114c8419b98129338678daa3f9fe085dd7dc368e791"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/biome_graphql_analyze/src/lint/style/use_graphql_naming_convention.rs:61-76 | crates/biome_json_analyze/src/assist/source/use_sorted_package_json.rs:294-306 \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/biome_graphql_analyze/src/lint/style/use_graphql_naming_convention.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"743d8de1d7dd6740c66f78faaba055b91e2ac3245d77ff46bd9fabf80fc873b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/biome_js_parser/src/syntax/function.rs:1118-1127 | crates/biome_js_parser/src/syntax/typescript/types.rs:1039-1047 \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/biome_js_parser/src/syntax/function.rs"},"region":{"startLine":1118}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa34e351115bc0f6b73d676c5b2f94a61bea53a94b7ac61636a58ae65591c47"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/biome_js_syntax/src/parentheses/tstype.rs:184-194 | crates/biome_js_syntax/src/parentheses/expression.rs:968-993 \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/biome_js_syntax/src/parentheses/tstype.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc2f6daddb0661bb134bb6f2af098f92a06fceabe15596b389a360fad0f45474"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/biome_tailwind_parser/src/syntax/css_value.rs:364-374 | crates/biome_css_parser/src/syntax/value/function/expression.rs:78-88 \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/biome_tailwind_parser/src/syntax/css_value.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"774f86291d77215fe60883a5469d9a58ce45f5044e24dfc692be959637866f4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/biome_vue_semantic/src/semantic_model/component.rs:2436-2443 | crates/biome_js_analyze/src/frameworks/vue/vue_setup.rs:42-50 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_vue_semantic/src/semantic_model/component.rs"},"region":{"startLine":2436}}}],"partialFingerprints":{"codehealthFindingId/v1":"08acbae8a7c1b049fd688b73413f9e35c08dd3adc8b8bfea7de26139b4bbe853"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/biome_css_formatter/src/scss/statements/content_at_rule.rs:10-25 | crates/biome_css_formatter/src/tailwind/statements/theme_at_rule.rs:8-24 \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/biome_css_formatter/src/scss/statements/content_at_rule.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bea19e6e92d33fa1819773ac5804360b5280d25c4e17398397c8a29fc69a6db"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/biome_deserialize_macros/src/lib.rs:332-344 | crates/biome_diagnostics_macros/src/lib.rs:26-38 \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/biome_deserialize_macros/src/lib.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aee3a38df6b48f12efbbff8861a0de0282097e1e8521512be87441b2ff93e13"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/biome_js_parser/src/syntax/class.rs:65-72 | crates/biome_js_parser/src/syntax/function.rs:499-506 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_parser/src/syntax/class.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"67546fbee05e6159b05d606e2952109c2ad3d64561e72bcaa57e729a63a82659"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): crates/biome_cli/src/commands/inspect/plugins/mod.rs:105-113 | crates/biome_js_analyze/src/lint/nursery/no_js_restricted_properties.rs:266-274 | crates/biome_js_analyze/src/lint/nursery/use_consistent_boolean_name.rs:371-379 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/commands/inspect/plugins/mod.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"75dec56738daac3070ce66b9b3f985e32ab9aef43544420a9d26c7a62d9b2e0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): crates/biome_css_analyze/src/lint/correctness/no_unknown_media_feature_name.rs:119-136 | crates/biome_css_analyze/src/lint/correctness/no_unmatchable_anb_selector.rs:91-107 | crates/biome_css_analyze/src/lint/suspicious/no_empty_block.rs:73-90 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_analyze/src/lint/correctness/no_unknown_media_feature_name.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6ba36b4c38cd402ca29b8fa4793d92dddafd4ac370fcef2303700e93fd2d162"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/biome_css_formatter/src/css/properties/generic_property.rs:159-167 | crates/biome_css_formatter/src/scss/auxiliary/variable_declaration.rs:139-147 \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/biome_css_formatter/src/css/properties/generic_property.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f9d299acf336de49d3527ef1c0e8f3205eeb7373e35682cf373a64488ab9cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): crates/biome_css_parser/src/syntax/scss/selector/parent_selector.rs:181-190 | crates/biome_css_parser/src/syntax/selector/mod.rs:410-419 | crates/biome_css_parser/src/syntax/selector/nested_selector.rs:96-106 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_parser/src/syntax/scss/selector/parent_selector.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"d61525374f1466e691c36edddfdfdd1e63dbe005a776ed4bece6896f25499b2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/biome_js_analyze/src/lint/nursery/use_flat_math_min_max.rs:199-205 | crates/biome_js_formatter/src/utils/member_chain/mod.rs:571-577 \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/biome_js_analyze/src/lint/nursery/use_flat_math_min_max.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"36932be9b998745f52b00342346be9ee6c37f7552bacd42579a1424f485fcdca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): crates/biome_service/src/file_handlers/css.rs:524-534 | crates/biome_service/src/file_handlers/html.rs:719-727 | crates/biome_service/src/file_handlers/json.rs:495-504 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/css.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"df98ffe09bc6400d369ffea2efc49eca7e0390bfcf20ca8e38f7488029b7a77d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/biome_css_formatter/src/css/auxiliary/keyframes_item.rs:8-19 | crates/biome_css_formatter/src/css/auxiliary/nested_qualified_rule.rs:9-23 | crates/biome_css_formatter/src/css/auxiliary/qualified_rule.rs:9-23 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_formatter/src/css/auxiliary/keyframes_item.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dae3326d8ded3f728605c9483c6845caaa4d51b6f178505fac53e8b09e9fa37"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/biome_graphql_analyze/src/assist/source/use_sorted_selection_set.rs:101-112 | crates/biome_js_analyze/src/assist/source/use_sorted_keys.rs:209-220 | crates/biome_json_analyze/src/assist/source/use_sorted_keys.rs:221-232 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_graphql_analyze/src/assist/source/use_sorted_selection_set.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a44d2db3c25540906f413b39ec9e995c311118780bd364e046968a92eafc26b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/biome_graphql_parser/src/parser/definitions/operation.rs:132-138 | crates/biome_graphql_parser/src/parser/definitions/schema.rs:58-64 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_graphql_parser/src/parser/definitions/operation.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e7fff28866fe2cd198ed3e669ccfb1940584997e34426212ee6b451b5c36bfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/biome_graphql_semantic/src/semantic_model/model.rs:191-198 | crates/biome_js_semantic/src/semantic_model/model.rs:612-619 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_graphql_semantic/src/semantic_model/model.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"22852d45a088b52a5cec401cac9ce57544e2e379388013d1a286fd11407ca96d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/biome_js_analyze/src/lint/nursery/use_object_from_entries.rs:935-945 | crates/biome_js_analyze/src/lint/nursery/use_math_trunc.rs:585-591 \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/biome_js_analyze/src/lint/nursery/use_object_from_entries.rs"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b15c4fd5fffd8b98548a983c76dc26eacd9ffb8dfa344c076f40f2fc0e7728f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/biome_js_runtime/src/ast.rs:503-510 | crates/biome_js_runtime/src/semantic.rs:357-363 \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/biome_js_runtime/src/ast.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc15cbcf5c92ba04c8f9119618d23a1f4524a4366182794f6f7c47a7e1a7a1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/biome_markdown_parser/src/to_html.rs:135-145 | crates/biome_markdown_syntax/src/block_ext.rs:159-169 \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/biome_markdown_parser/src/to_html.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee0f35f6f7d68229c991bb094f3d8c91fe40ae7e1ee8ccea3797bfe42cc2e2f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/biome_html_analyze/src/lint/performance/no_sync_scripts.rs:79-93 | crates/biome_js_analyze/src/lint/performance/no_sync_scripts.rs:124-138 \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/biome_html_analyze/src/lint/performance/no_sync_scripts.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b9dd70b3a537f9b522a2ae6a682845f7e89c0938d4866301fc66423243ae688"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/biome_html_parser/src/token_source.rs:281-288 | crates/biome_tailwind_parser/src/token_source.rs:51-59 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_parser/src/token_source.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4e38043ed7a608a473470c96e708029af144ff86badd33e28c7fb4dba49202b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/biome_js_semantic/src/semantic_model/binding.rs:557-561 | crates/biome_js_semantic/src/semantic_model/reference.rs:200-204 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_semantic/src/semantic_model/binding.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"edbf6cc3aa2f6d6dad0cfa41bc136be55e247bf529044e2dc3f435e70e36acfd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 15\u002B corresponding lines): crates/biome_graphql_analyze/src/lint/style/use_deprecated_reason.rs:68-86 | crates/biome_js_analyze/src/lint/suspicious/no_empty_source.rs:148-165 | crates/biome_json_analyze/src/lint/nursery/use_consistent_object_keys.rs:165-182 | crates/biome_json_analyze/src/lint/style/no_top_level_literals.rs:84-98 | crates/biome_json_analyze/src/lint/suspicious/no_empty_object_keys.rs:88-102 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_graphql_analyze/src/lint/style/use_deprecated_reason.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"e17f430b6845b029cf65abbfacc8a815c677f2d5984ee7802fb81fd2fa0defe2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/biome_css_formatter/src/utils/scss_include_keyword_value.rs:42-48 | crates/biome_markdown_formatter/src/markdown/auxiliary/inline_italic.rs:212-218 \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/biome_css_formatter/src/utils/scss_include_keyword_value.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"89dc61fc372ec7d1b4302a683fa46cb0cddec0bdabf2df80547b2d835333a09b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/biome_css_parser/src/syntax/mod.rs:836-844 | crates/biome_tailwind_parser/src/syntax/css_value.rs:111-119 \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/biome_css_parser/src/syntax/mod.rs"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a5744b33b1420ae2b33c6ba4fe64cc9fb80487a0515a8abc79405248a4b8dab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/biome_graphql_formatter/src/graphql/value/default_value.rs:8-12 | crates/biome_grit_formatter/src/grit/patterns/pattern_where.rs:8-26 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_graphql_formatter/src/graphql/value/default_value.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b40b1b57b17ff912ca76a310abc68a7d1eff0c10f027ab3cc755aa421a1349"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/biome_js_analyze/src/lint/complexity/use_array_some.rs:353-361 | crates/biome_js_analyze/src/lint/nursery/use_includes.rs:684-690 \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/biome_js_analyze/src/lint/complexity/use_array_some.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9247c98191f14bfa604bf905acc7ad10464d498fe0938d06119b61be1450a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/biome_js_type_info/src/interned_types.rs:2358-2370 | crates/biome_js_type_info/src/type_data.rs:1232-1242 \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/biome_js_type_info/src/interned_types.rs"},"region":{"startLine":2358}}}],"partialFingerprints":{"codehealthFindingId/v1":"411ffc441c62cf49d59697ea521dca3e39046212fc18562b68ca27dd68a7d3dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/biome_markdown_formatter/src/markdown/lists/code_name_list.rs:10-21 | crates/biome_html_formatter/src/svelte/lists/directive_modifier_list.rs:12-19 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_formatter/src/markdown/lists/code_name_list.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e382d70324fe1414a6fedf7f63ab116475b53446807b06537f8df1ba06f130c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/biome_markdown_parser/src/parser.rs:1389-1399 | crates/biome_markdown_parser/src/syntax/list.rs:1402-1414 | crates/biome_markdown_parser/src/syntax/table.rs:402-412 \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/biome_markdown_parser/src/parser.rs"},"region":{"startLine":1389}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf4cb3707e68faac4a69fb46e5b9056d34878440db38aa6fde1274feeb77a55"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/biome_css_formatter/src/css/auxiliary/layer_declaration.rs:8-19 | crates/biome_css_formatter/src/css/auxiliary/layer_reference.rs:8-21 \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/biome_css_formatter/src/css/auxiliary/layer_declaration.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab557fe4a47eaf77b6f185e1c89cb361639c9e31f310bae113879a066971c54"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/biome_css_parser/src/syntax/at_rule/import.rs:146-154 | crates/biome_css_parser/src/syntax/at_rule/layer.rs:21-33 \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/biome_css_parser/src/syntax/at_rule/import.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"f23d7b581c6431fffc95bd766871072366a89340092bea6766d089f467fb1cb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/biome_css_parser/src/syntax/scss/selector/placeholder.rs:17-28 | crates/biome_css_parser/src/syntax/scss/value/percent.rs:20-28 \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/biome_css_parser/src/syntax/scss/selector/placeholder.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ed0573f817406f0b7aa7caff65e2ddc54e45ac68841f990137a452e355dc09"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 8\u002B corresponding lines): crates/biome_html_parser/src/syntax/astro.rs:55-63 | crates/biome_html_parser/src/syntax/mod.rs:307-316 | crates/biome_html_parser/src/syntax/svelte.rs:1041-1048 | crates/biome_html_parser/src/syntax/vue.rs:368-376 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_parser/src/syntax/astro.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a925cda021165e341a1a523093689b7c356ecf38cfa68a995cfb68e20dcec1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/biome_diagnostics/src/panic.rs:114-120 | crates/biome_service/src/db/state.rs:573-584 \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/biome_diagnostics/src/panic.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1afdb704bc9556342c4f2614879bdd3186a81966d486c6cf7b7b67e3a1c2742"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/biome_graphql_parser/src/lexer/mod.rs:140-150 | crates/biome_js_parser/src/lexer/mod.rs:353-365 \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/biome_graphql_parser/src/lexer/mod.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2e148ee7ad53ced279d79758bd5cb33fdada7134ef83d6ab9e5cd83b9167e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/biome_graphql_parser/src/token_source.rs:83-93 | crates/biome_json_parser/src/token_source.rs:105-115 | crates/biome_yaml_parser/src/token_source.rs:97-107 \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/biome_graphql_parser/src/token_source.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"1310559854dbb5e2476da02a678f01cf8daab17fe37b6b0c740945ad90603a70"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/biome_html_analyze/src/lint/a11y/use_aria_activedescendant_with_tabindex.rs:102-119 | crates/biome_js_analyze/src/lint/a11y/use_aria_activedescendant_with_tabindex.rs:88-102 \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/biome_html_analyze/src/lint/a11y/use_aria_activedescendant_with_tabindex.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b570feed89ceace418a29ddaf8f78a8b41dc04b5ec20f52f05a23ec9b20971"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/biome_service/src/file_handlers/grit.rs:48-57 | crates/biome_service/src/file_handlers/md.rs:72-83 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/grit.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c2475f2dc6a40851c13f93aad3f70eccef58d017fd3a19496b4dd0e2050c109"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/biome_css_parser/src/syntax/scss/identifiers/interpolated_identifier.rs:206-216 | crates/biome_css_parser/src/syntax/value/dimension.rs:32-44 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_parser/src/syntax/scss/identifiers/interpolated_identifier.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"47316c04eb2deaf51a2f4f850d72afce4e8a375861bceeff710b3638f18417dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/biome_html_analyze/src/lint/performance/use_vue_vapor.rs:164-173 | crates/biome_js_analyze/src/lint/style/use_spread_over_apply.rs:154-162 \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/biome_html_analyze/src/lint/performance/use_vue_vapor.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf7fcf03c69a2e3131f4e1c302de54975f791f96f3eb0857babdc83c4642d32"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/biome_js_parser/src/parser.rs:141-151 | crates/biome_markdown_parser/src/parser.rs:1310-1320 \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/biome_js_parser/src/parser.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd133338ba245e86a1bc58d048956311666a329dbbb9e430c868bd5c0b713c70"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/biome_js_runtime/src/semantic.rs:37-40 | crates/biome_js_runtime/src/token.rs:34-39 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_runtime/src/semantic.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4a31d42848acead19fa88e7795ac186d9668992534e2564e26a7bf8daa772b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/biome_js_analyze/src/lint/correctness/no_react_prop_assignments.rs:99-115 | crates/biome_js_analyze/src/lint/suspicious/no_vue_arrow_func_in_watch.rs:133-146 \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/biome_js_analyze/src/lint/correctness/no_react_prop_assignments.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3dbbb37fd07aded35ae5cf32bfd4706ec073a862ee996e483d176c107d0b93"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/biome_js_parser/src/syntax/module.rs:364-370 | crates/biome_js_parser/src/syntax/typescript/types.rs:975-985 \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/biome_js_parser/src/syntax/module.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df79eb8f0c0bbad53f2306f3c695b7f6d4689169a8bd128067da699897d20d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/biome_css_analyze/src/lint/nursery/use_consistent_lightness_notation.rs:220-227 | crates/biome_css_analyze/src/lint/suspicious/no_duplicate_font_names.rs:149-156 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_analyze/src/lint/nursery/use_consistent_lightness_notation.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"6159ea19728fc42cc1729a7e4bf24ea6e334881eb55affce38ecac202a725cfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/biome_js_analyze/src/lint/nursery/no_constant_comparisons.rs:381-388 | crates/biome_js_analyze/src/lint/nursery/no_double_comparison.rs:271-279 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_constant_comparisons.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd8cbf8510e880627a5d3180dbbcea64a7971b2eb9d81ac8abfdb21c2e2bbcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/biome_js_analyze/src/services/react_compiler.rs:57-61 | crates/biome_js_analyze/src/services/vue.rs:410-414 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/services/react_compiler.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"b03733f8eb21aac764296d71ae4f1392d4c6396f3511d43716ff5f8655c1a5d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/biome_configuration/src/diagnostics.rs:274-280 | crates/biome_parser/src/diagnostic.rs:150-157 \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/biome_configuration/src/diagnostics.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1576b2d3f681076200fbbfb3263bbbb702ece9f375f982dcdede5907739f83a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 8\u002B corresponding lines): crates/biome_css_parser/src/syntax/at_rule/feature.rs:473-483 | crates/biome_css_parser/src/syntax/at_rule/keyframes.rs:641-650 | crates/biome_css_parser/src/syntax/property/mod.rs:598-606 | crates/biome_css_parser/src/syntax/value/type.rs:194-202 | crates/biome_graphql_parser/src/parser/value.rs:171-178 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_parser/src/syntax/at_rule/feature.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"f260c134a41ccee6d38cd6444aad696578e630206ce866c1362bfe18dbcc5b42"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/biome_css_parser/src/syntax/mod.rs:864-874 | crates/biome_graphql_parser/src/parser/mod.rs:160-170 | crates/biome_graphql_parser/src/parser/value.rs:161-168 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 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/biome_css_parser/src/syntax/mod.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac39dc4b4a65b32ecbbef03e3e7da19ece712c5da1f6ee4da759723999f8842e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/biome_css_parser/src/syntax/selector/attribute.rs:186-196 | crates/biome_grit_parser/src/parser/patterns.rs:276-284 \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/biome_css_parser/src/syntax/selector/attribute.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"e05eef095486f696ea193d39747020cadb5d189d8e3118643d0dc791e2209763"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/biome_formatter/src/lib.rs:1006-1013 | crates/biome_markdown_formatter/src/context.rs:71-78 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_formatter/src/lib.rs"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"618fcf2b00c71ae37ca6909747dbd99f123af240164c2265bc8c8e1ca5c56825"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/biome_js_analyze/src/lib.rs:189-203 | crates/biome_markdown_analyze/src/lib.rs:121-134 \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/biome_js_analyze/src/lib.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"c17d790a1433bec97513d9740cfe7c792b237c02cf019103d08575ceccfce728"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/biome_js_analyze/src/lib.rs:414-427 | crates/biome_markdown_analyze/src/lib.rs:88-101 \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/biome_js_analyze/src/lib.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"78159c949a2b349a5369e083d536a23e762620a72ece5b7a97353f96a6ec8420"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/biome_js_analyze/src/lint/nursery/no_await_in_promise_methods.rs:196-204 | crates/biome_js_analyze/src/lint/nursery/no_single_promise_in_promise_methods.rs:204-211 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_await_in_promise_methods.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee6d0af139b04bcc4fc147aa5b6ff692747152b5181387d6ca41a10e7c63149d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/biome_js_type_info/src/interned_types.rs:2641-2646 | crates/biome_module_graph/src/db/queries/type_inference/calls/implementation.rs:939-947 \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/biome_js_type_info/src/interned_types.rs"},"region":{"startLine":2641}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cbf7cf3180b4f7dcabcbe8d6fb5cce06dc69fa7ed144e93cc35e1d32d032239"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/biome_cli/src/service/unix.rs:312-316 | crates/biome_cli/src/service/windows.rs:217-221 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/service/unix.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e4d116067f0608383a903b5fdce83a5aa4b89e64d64be9ea5b439440768c516"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/biome_css_parser/src/syntax/mod.rs:430-438 | crates/biome_css_parser/src/syntax/scss/value/any.rs:20-29 \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/biome_css_parser/src/syntax/mod.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe3e3943505f36e668dcf94002522a5104f601b99617590b7be307785cd726b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/biome_html_analyze/src/lint/nursery/no_vue_deprecated_slot_scope.rs:342-348 | crates/biome_tailwind_logic/src/class_category.rs:547-552 \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/biome_html_analyze/src/lint/nursery/no_vue_deprecated_slot_scope.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bb6dd427f9a82b5e5ba81650b62518ecdca9056e94e342152f771927a632d1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/biome_js_analyze/src/lint/style/use_symbol_description.rs:83-96 | crates/biome_js_analyze/src/lint/suspicious/no_return_assign.rs:71-84 \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/biome_js_analyze/src/lint/style/use_symbol_description.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"935a1fcbf550ae33e09cbea857df83aa1ca347c0055ec07b1cfe9f8559afd598"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/biome_rowan/src/syntax/node.rs:1484-1487 | crates/biome_rowan/src/syntax/token.rs:692-695 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_rowan/src/syntax/node.rs"},"region":{"startLine":1484}}}],"partialFingerprints":{"codehealthFindingId/v1":"f487ffbb787459183d9878875d5b88c30cc7f3fe33a83b4c737e5d36a2b9ffe8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/biome_css_parser/src/syntax/scss/expression/list.rs:181-186 | crates/biome_markdown_parser/src/syntax/mod.rs:794-799 \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/biome_css_parser/src/syntax/scss/expression/list.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"13fda02c4be3938e6049cae8541f9edde8cb5b52025096881ec5a66113343f24"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/biome_diagnostics/src/location.rs:298-303 | crates/biome_js_parser/src/span.rs:28-33 \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/biome_diagnostics/src/location.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"546766136b445f875eec340e83e054702febfc4d1f6a0d276ab0fbbe18f44e60"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/biome_js_analyze/src/lint/correctness/no_unused_variables.rs:752-759 | crates/biome_js_analyze/src/lint/correctness/use_exhaustive_dependencies.rs:1511-1521 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/no_unused_variables.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"3980eb7f37ec3c49b7ffc695677c6cebfd23b1f891fc601a16e5d419fb0a634b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/biome_js_analyze/src/lint/nursery/no_subtraction_comparison.rs:250-257 | crates/biome_js_analyze/src/lint/nursery/use_iterator_zip.rs:314-321 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_subtraction_comparison.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"d874721d0369b2626f25d794df32a7e0bc3f1ba78c28643da918b25c472bec9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/biome_json_analyze/src/lint/nursery/use_package_json_valid_cpu.rs:227-233 | crates/biome_json_analyze/src/lint/nursery/use_package_json_valid_license.rs:200-206 \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/biome_json_analyze/src/lint/nursery/use_package_json_valid_cpu.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e8b6d3eeea179dab978077a8748f266cef592e073f50fedc1a3d82b926fd3ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/biome_manifest/src/lib.rs:429-435 | crates/biome_plugin_loader/src/lib.rs:536-541 \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/biome_manifest/src/lib.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe92d018c0413f2a67a76f83602c3158f6901f651822d3f89d55f72cce9447d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): crates/biome_migrate/src/analyzers/ignore_scanner.rs:38-47 | crates/biome_migrate/src/analyzers/monorepo.rs:48-57 | crates/biome_migrate/src/analyzers/recommended.rs:36-45 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_migrate/src/analyzers/ignore_scanner.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"653bb8c88972c83ba32f9b1519bd8cc436a60574db46b1c6982289d57ed49c0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/biome_plugin_loader/src/diagnostics.rs:191-201 | crates/biome_service/src/diagnostics.rs:334-343 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_plugin_loader/src/diagnostics.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e285c05927cfaf35a79c9549b22644e26aa86e43fd6a6190ec8ae631f0fb273"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/biome_rowan/src/syntax/node.rs:1478-1481 | crates/biome_rowan/src/syntax/token.rs:698-701 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_rowan/src/syntax/node.rs"},"region":{"startLine":1478}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e7f7b87db39df2c1eeda622d01efc2b417b85938e41119e03a8c69196560587"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/biome_css_formatter/src/scss/lists/map_expression_pair_list.rs:105-110 | crates/biome_css_formatter/src/scss/statements/at_root_at_rule.rs:54-59 \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/biome_css_formatter/src/scss/lists/map_expression_pair_list.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"207f62ecdf5a4dfd52c614b9dd2944dc261c9efbfb1b578bdf5e61c5bdf1026b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/biome_formatter/src/lib.rs:927-934 | crates/biome_html_formatter/src/context.rs:398-405 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_formatter/src/lib.rs"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a14ff11892a19abf66b5813a4d7b89af9efa417cfa0da7e46588bfe30e1ed87"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/biome_html_analyze/src/lint/nursery/no_vue_deprecated_v_is.rs:59-62 | crates/biome_html_analyze/src/lint/nursery/no_vue_v_text.rs:54-57 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/nursery/no_vue_deprecated_v_is.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"edd4c9e51057dea2d0d74d47549dd62e5dceadfd5d389352e2423303f11e684d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/biome_html_syntax/src/attribute_ext.rs:287-298 | crates/biome_js_analyze/src/lint/correctness/use_valid_for_direction.rs:180-190 \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/biome_html_syntax/src/attribute_ext.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab41b8f0a7be10580dd15812f2fbd3f30e669f9fe7284cc14a140a82c521c82"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/biome_js_analyze/src/lint/nursery/no_array_sort_for_min_max.rs:302-309 | crates/biome_js_analyze/src/lint/nursery/use_math_trunc.rs:308-315 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_array_sort_for_min_max.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f297ca2c4d98749c3b1962eee15ffd7a0bfe8126e38fb3c99ec2272b9636ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/biome_js_parser/src/parser.rs:133-139 | crates/biome_markdown_parser/src/parser.rs:1017-1023 \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/biome_js_parser/src/parser.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"028b87a64fcc44bd021fe958b63631b90d4e3be51d2fb2fee1b1388167a0cdf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/biome_cli/src/execute/migrate/eslint_to_biome.rs:66-68 | crates/biome_cli/src/execute/migrate/stylelint_to_biome.rs:56-58 \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":"crates/biome_cli/src/execute/migrate/eslint_to_biome.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"85bf4e8441f2dc420b35c002c4ee0588877cc79bfbac98b89af92d8364c25a3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/biome_cli/src/reporter/json.rs:321-330 | crates/biome_cli/src/reporter/rdjson.rs:185-193 \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/biome_cli/src/reporter/json.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"62d3c0c9339745d263e85e745dc9937825fe440eac73d8d38e942a660d8e830a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/biome_css_formatter/src/scss/auxiliary/include_argument_list.rs:41-49 | crates/biome_css_formatter/src/scss/auxiliary/keyword_argument.rs:29-35 \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/biome_css_formatter/src/scss/auxiliary/include_argument_list.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"847a62f3af8a9156f356fe0009f8a40017ef326a4c5cb195367444cfc8aad54c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 4\u002B corresponding lines): crates/biome_css_syntax/src/lib.rs:47-50 | crates/biome_graphql_syntax/src/lib.rs:22-25 | crates/biome_html_syntax/src/lib.rs:31-34 | crates/biome_js_syntax/src/lib.rs:56-59 | crates/biome_json_syntax/src/lib.rs:17-20 | crates/biome_markdown_syntax/src/lib.rs:24-27 | crates/biome_yaml_syntax/src/lib.rs:31-34 \u2014 These 7 members are one piece of code written 7 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 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_syntax/src/lib.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"8416729ee9119f2c1bedb42f52c82fa937344ff1f215bd5641455b0742bb6301"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 3\u002B corresponding lines): crates/biome_css_parser/src/syntax/at_rule/function.rs:186-188 | crates/biome_css_parser/src/syntax/value/attr.rs:277-283 | crates/biome_css_parser/src/syntax/value/type.rs:259-261 | crates/biome_html_parser/src/syntax/svelte.rs:992-994 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 3 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/biome_css_parser/src/syntax/at_rule/function.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c95f3d1af047e203b1e5fb939f8281f276204d029b738a6cbedb1c33ee42045"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/biome_grit_formatter/src/grit/lists/language_flavor_list.rs:8-15 | crates/biome_grit_formatter/src/grit/lists/variable_list.rs:8-15 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_formatter/src/grit/lists/language_flavor_list.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb9717cda8aa29f6b05baa9f544f00ef832e0d34ed50363d1d892db0a264ce41"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/biome_js_analyze/src/lint/nursery/no_null.rs:250-255 | crates/biome_js_formatter/src/utils/member_chain/mod.rs:609-614 \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/biome_js_analyze/src/lint/nursery/no_null.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0e2e890dd7b2dcb449f866354660c143af5c126e560b596a2ec761dd7db6984"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/biome_module_graph/src/css_module_info/tailwind.rs:118-123 | crates/biome_tailwind_logic/src/use_tailwind_sorted_classes/design_system.rs:149-154 \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/biome_module_graph/src/css_module_info/tailwind.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6bf049c58328560215caa54b62559e4d9c8f5ca77c8e13c334fdded1ea0a6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/biome_css_formatter/src/scss/statements/at_root_at_rule.rs:47-52 | crates/biome_css_formatter/src/utils/scss_closing_comments.rs:66-71 \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/biome_css_formatter/src/scss/statements/at_root_at_rule.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb0a7ea357acaa4085bd2036a98d3f8ac6bcc5af61ff800392dc6b46329a4e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/biome_graphql_analyze/src/assist/source/use_graphql_sorted_variables.rs:243-251 | crates/biome_graphql_analyze/src/assist/source/use_sorted_enum_members.rs:137-143 | crates/biome_graphql_analyze/src/assist/source/use_sorted_selection_set.rs:163-170 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_graphql_analyze/src/assist/source/use_graphql_sorted_variables.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd4e3d2dee7f677947c70e778f7823f46025f1f1dd3b758f398d21b3b9b23880"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): crates/biome_service/src/file_handlers/css.rs:1091-1094 | crates/biome_service/src/file_handlers/javascript.rs:2169-2172 | crates/biome_service/src/file_handlers/json.rs:1008-1011 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/css.rs"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e882e0685d3e0515b18493380e87233289200c36aeaa8c46c6d2cc6d86c4bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/biome_css_analyze/src/lint/a11y/use_generic_font_names.rs:202-207 | crates/biome_js_analyze/src/lint/performance/no_jsx_props_bind.rs:61-68 \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/biome_css_analyze/src/lint/a11y/use_generic_font_names.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf79e91d10d58022dc92bba4e54337636efe076f5188b4d11a7c76cebcc2e56"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/biome_css_parser/src/syntax/at_rule/supports/mod.rs:544-546 | crates/biome_css_parser/src/syntax/scss/identifiers/identifier.rs:32-37 \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":"crates/biome_css_parser/src/syntax/at_rule/supports/mod.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b858e6e2933f89018b62a8d6d26127533dc58338bde1887665991bc408c6512"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/biome_html_analyze/src/assist/source/use_sorted_attributes.rs:203-211 | crates/biome_js_analyze/src/assist/source/use_sorted_attributes.rs:159-167 \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/biome_html_analyze/src/assist/source/use_sorted_attributes.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"90006d067faecf0899ba6f0029da62f004e4344979d837ad1618ad8fba84e9c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/biome_js_analyze/src/lint/correctness/use_react_async_server_function.rs:352-359 | crates/biome_js_analyze/src/lint/suspicious/no_loop_func.rs:408-415 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/use_react_async_server_function.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"d98887a377686c4cf570ffb86911662758c656a198f08435e58d02a06215d1ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/biome_js_analyze/src/lint/nursery/use_nullish_coalescing.rs:1324-1331 | crates/biome_js_syntax/src/declaration_ext.rs:55-62 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_nullish_coalescing.rs"},"region":{"startLine":1324}}}],"partialFingerprints":{"codehealthFindingId/v1":"93991ff1b8403e051d0bb6184b3088269fa64c6a3bc88bf4094f9c238a599dc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/biome_parser/src/lib.rs:976-983 | crates/biome_rowan/src/syntax/node.rs:1160-1167 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_parser/src/lib.rs"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef6acfe44355d2b672ca67da0b8365e1559fac54fb1a8bb1a6a16e9e6b698e93"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 9\u002B corresponding lines): crates/biome_css_formatter/src/verbatim.rs:28-36 | crates/biome_html_formatter/src/verbatim.rs:30-38 | crates/biome_js_formatter/src/verbatim.rs:27-35 | crates/biome_json_formatter/src/verbatim.rs:26-34 | crates/biome_yaml_formatter/src/verbatim.rs:28-39 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_formatter/src/verbatim.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"403b0791d55d6585ab9e3c0c77702f9e563ed3fc6be4427ffd5d396ffbd646c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/biome_grit_patterns/src/pattern_compiler/after_compiler.rs:12-15 | crates/biome_grit_patterns/src/pattern_compiler/before_compiler.rs:12-15 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_patterns/src/pattern_compiler/after_compiler.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"55fbc89619149bc56d7e18c88bc55f4239c7a9b9beea596b88123b883322a454"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): crates/biome_grit_patterns/src/pattern_compiler/every_compiler.rs:12-16 | crates/biome_grit_patterns/src/pattern_compiler/maybe_compiler.rs:15-19 | crates/biome_grit_patterns/src/pattern_compiler/some_compiler.rs:12-16 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_patterns/src/pattern_compiler/every_compiler.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"48962939ecfc2c1a6e5c203fc093dd7703e2875ffb1ff7dd488a41398b0a0a79"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/biome_js_analyze/src/lib.rs:386-399 | crates/biome_markdown_analyze/src/lib.rs:61-74 \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/biome_js_analyze/src/lib.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ba6c668a1249833d431a5d5c085ae064d1a39b2c1c3686134e3ac798a75d50"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/biome_js_analyze/src/lint/correctness/no_next_async_client_component.rs:191-197 | crates/biome_js_analyze/src/lint/nursery/no_invalid_this.rs:264-270 \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/biome_js_analyze/src/lint/correctness/no_next_async_client_component.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a50e6695e5960cdfc2e53368b8ebd013a908f93792e42ed323b9492b40eecbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/biome_js_analyze/src/lint/nursery/no_vue_shadow_native_events.rs:208-213 | crates/biome_js_analyze/src/lint/suspicious/no_unknown_attribute.rs:1093-1098 \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/biome_js_analyze/src/lint/nursery/no_vue_shadow_native_events.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"c71fdb251d278776ac12c3900e0172ee24a9379e3795f57ad6a2ef5a1d396f92"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/biome_css_parser/src/syntax/value/function/expression.rs:162-164 | crates/biome_yaml_parser/src/parser/flow.rs:122-128 \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":"crates/biome_css_parser/src/syntax/value/function/expression.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c6d7823c909b8c3d61c6732042e5b2083b591a19588b19ed7c3c4881bcea067"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (185 lines \u00D7 2): crates/biome_syntax_codegen/src/generate_nodes.rs:17-201 | xtask/codegen/src/generate_nodes.rs:27-211 \u2014 before extracting anything, compare \u0060crates/biome_syntax_codegen/src/generate_nodes.rs\u0060 and \u0060xtask/codegen/src/generate_nodes.rs\u0060 as WHOLE FILES: this scan already matched 26 separate duplicated blocks between them, totalling at least 933 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_syntax_codegen/src/generate_nodes.rs:17\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_syntax_codegen/src/generate_nodes.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"80ae32687a186956bdf5646e28147efe701f43ca7d00ed4742fc4b11f0aba13b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (198 lines \u00D7 2): crates/biome_syntax_codegen/src/generate_node_factory.rs:17-214 | xtask/codegen/src/generate_node_factory.rs:10-207 \u2014 before extracting anything, compare \u0060crates/biome_syntax_codegen/src/generate_node_factory.rs\u0060 and \u0060xtask/codegen/src/generate_node_factory.rs\u0060 as WHOLE FILES: 92% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_syntax_codegen/src/generate_node_factory.rs:17\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_syntax_codegen/src/generate_node_factory.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"98407825ef3c9eb864514d7eb82c0e4b554f70216f0f9e8f9d2ce00e68fece71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (146 lines \u00D7 2): crates/biome_syntax_codegen/src/generate_nodes.rs:744-889 | xtask/codegen/src/generate_nodes.rs:787-932 \u2014 before extracting anything, compare \u0060crates/biome_syntax_codegen/src/generate_nodes.rs\u0060 and \u0060xtask/codegen/src/generate_nodes.rs\u0060 as WHOLE FILES: this scan already matched 26 separate duplicated blocks between them, totalling at least 933 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_syntax_codegen/src/generate_nodes.rs:744\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_syntax_codegen/src/generate_nodes.rs"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"04a473bf72ce60d8ee80e9ea8d5061e3cf8dbb9283bbc1821e6f5dd11d07bcbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (86 lines \u00D7 2): crates/biome_syntax_codegen/src/generate_nodes.rs:614-699 | xtask/codegen/src/generate_nodes.rs:634-719 \u2014 before extracting anything, compare \u0060crates/biome_syntax_codegen/src/generate_nodes.rs\u0060 and \u0060xtask/codegen/src/generate_nodes.rs\u0060 as WHOLE FILES: this scan already matched 26 separate duplicated blocks between them, totalling at least 933 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_syntax_codegen/src/generate_nodes.rs:614\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_syntax_codegen/src/generate_nodes.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"760d1977aace2104a05a6fd41ae18a322b8fed4882a6aff3500e5c835bd97fc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (83 lines \u00D7 2): crates/biome_syntax_codegen/src/generate_nodes_mut.rs:10-92 | xtask/codegen/src/generate_nodes_mut.rs:7-89 \u2014 before extracting anything, compare \u0060crates/biome_syntax_codegen/src/generate_nodes_mut.rs\u0060 and \u0060xtask/codegen/src/generate_nodes_mut.rs\u0060 as WHOLE FILES: 85% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_syntax_codegen/src/generate_nodes_mut.rs:10\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060xtask/codegen/src/generate_nodes_mut.rs:91\u0060 calls \u0060reformat\u0060 and \u0060crates/biome_syntax_codegen/src/generate_nodes_mut.rs:94\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/biome_syntax_codegen/src/generate_nodes_mut.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b8adfc90ed674f3f1a5b3aee9ea1450ddd82817f9951f846927d1d97374498e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (67 lines \u00D7 2): crates/biome_syntax_codegen/src/ast.rs:157-223 | xtask/codegen/src/ast.rs:195-261 \u2014 before extracting anything, compare \u0060crates/biome_syntax_codegen/src/ast.rs\u0060 and \u0060xtask/codegen/src/ast.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 344 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_syntax_codegen/src/ast.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c8da7a04c5bb5c0f5cd8e18a02d850177b745de655ce9fdc27db69927b974fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (68\u201369 lines \u00D7 2): crates/biome_html_analyze/src/lint/a11y/use_valid_lang.rs:76-143 | crates/biome_js_analyze/src/lint/a11y/use_valid_lang.rs:70-138 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/a11y/use_valid_lang.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"63daf80537305a7dd5b4d20e1e23c465986cf25d437d249ffe6fa75be874cfe2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (59 lines \u00D7 2): crates/biome_syntax_codegen/src/ast.rs:253-311 | xtask/codegen/src/ast.rs:291-349 \u2014 before extracting anything, compare \u0060crates/biome_syntax_codegen/src/ast.rs\u0060 and \u0060xtask/codegen/src/ast.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 344 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_syntax_codegen/src/ast.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1b57d527df25b3474d3b98811898a6bdc1156379bb32f0b484a3d2b2ff596cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (59 lines \u00D7 2): crates/biome_syntax_codegen/src/generate_nodes.rs:241-299 | xtask/codegen/src/generate_nodes.rs:273-331 \u2014 before extracting anything, compare \u0060crates/biome_syntax_codegen/src/generate_nodes.rs\u0060 and \u0060xtask/codegen/src/generate_nodes.rs\u0060 as WHOLE FILES: this scan already matched 26 separate duplicated blocks between them, totalling at least 933 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_syntax_codegen/src/generate_nodes.rs:241\u0060 it begins part-way through the construct above it, so those exact 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/biome_syntax_codegen/src/generate_nodes.rs:300\u0060 calls \u0060debug_struct\u0060, \u0060finish\u0060 and \u0060xtask/codegen/src/generate_nodes.rs:333\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/biome_syntax_codegen/src/generate_nodes.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e4c30877bfcaa8c09401395e77819a777f064b46ce459a97cc56f43e59efc19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (58 lines \u00D7 2): crates/biome_syntax_codegen/src/generate_macros.rs:11-68 | xtask/codegen/src/generate_macros.rs:8-65 \u2014 before extracting anything, compare \u0060crates/biome_syntax_codegen/src/generate_macros.rs\u0060 and \u0060xtask/codegen/src/generate_macros.rs\u0060 as WHOLE FILES: 86% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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/biome_syntax_codegen/src/generate_macros.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1cb870e55fac82fbb004f3716e08f51e152aaa55322d646a8ae1abb85463c93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (46\u201354 lines \u00D7 2): crates/biome_css_parser/src/lexer/mod.rs:1281-1334 | crates/biome_tailwind_parser/src/lexer/mod.rs:751-796 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_parser/src/lexer/mod.rs"},"region":{"startLine":1281}}}],"partialFingerprints":{"codehealthFindingId/v1":"c52b7fc88b2873d8f1a1168cf970805dd47e211187fb4ef7f0759b8e0f9903e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (52 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/no_restricted_dependencies.rs:95-146 | crates/biome_json_analyze/src/lint/nursery/no_restricted_dependencies.rs:97-148 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/nursery/no_restricted_dependencies.rs:95\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/biome_js_analyze/src/lint/nursery/no_restricted_dependencies.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"40be09052eaa0c4a12d00de9cd25c71b3e5659f87cd42b5b3ab023d92b7ebe9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (80\u201397 lines \u00D7 2): crates/biome_js_analyze/src/lint/complexity/use_optional_chain.rs:958-1054 | crates/biome_js_analyze/src/lint/complexity/use_optional_chain.rs:1085-1164 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/complexity/use_optional_chain.rs:958\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/complexity/use_optional_chain.rs"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d414a25e55957e13417bda7bce796bc3b80689376e081c006825cb4405e97b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (51 lines \u00D7 2): crates/biome_syntax_codegen/src/generate_nodes.rs:1050-1100 | xtask/codegen/src/generate_nodes.rs:1093-1143 \u2014 before extracting anything, compare \u0060crates/biome_syntax_codegen/src/generate_nodes.rs\u0060 and \u0060xtask/codegen/src/generate_nodes.rs\u0060 as WHOLE FILES: this scan already matched 26 separate duplicated blocks between them, totalling at least 933 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_syntax_codegen/src/generate_nodes.rs:1050\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_syntax_codegen/src/generate_nodes.rs"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"045a97026c8be7c19bede386889b30735c6663228d116d6d5f73b8600907c6d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (50 lines \u00D7 2): crates/biome_syntax_codegen/src/generate_syntax_factory.rs:48-97 | xtask/codegen/src/generate_syntax_factory.rs:39-88 \u2014 before extracting anything, compare \u0060crates/biome_syntax_codegen/src/generate_syntax_factory.rs\u0060 and \u0060xtask/codegen/src/generate_syntax_factory.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 137 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_syntax_codegen/src/generate_syntax_factory.rs:48\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/biome_syntax_codegen/src/generate_syntax_factory.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc67ff36c400f2473525995b452fe57d41ca695033fe764c14fc2b45d426763"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (48 lines \u00D7 2): crates/biome_html_analyze/src/lint/nursery/no_obsolete_attributes.rs:215-262 | crates/biome_js_analyze/src/lint/nursery/no_obsolete_attributes.rs:217-264 \u2014 before extracting anything, compare \u0060crates/biome_html_analyze/src/lint/nursery/no_obsolete_attributes.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/nursery/no_obsolete_attributes.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 104 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_analyze/src/lint/nursery/no_obsolete_attributes.rs:215\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_html_analyze/src/lint/nursery/no_obsolete_attributes.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d2e493b63c2e110baf027dbe8e76d48f03ecc19c3e6ca0a5b16aa1adba5a3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (48 lines \u00D7 2): crates/biome_syntax_codegen/src/ast.rs:81-128 | xtask/codegen/src/ast.rs:131-178 \u2014 before extracting anything, compare \u0060crates/biome_syntax_codegen/src/ast.rs\u0060 and \u0060xtask/codegen/src/ast.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 344 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_syntax_codegen/src/ast.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"920a53ea960d661224de78be85027dc4e4da8e63cde8474d5867292ba63d181c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (47 lines \u00D7 2): crates/biome_html_analyze/src/lint/a11y/use_valid_lang.rs:149-195 | crates/biome_js_analyze/src/lint/a11y/use_valid_lang.rs:145-191 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/a11y/use_valid_lang.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a48ebe207b1c6bcced9d70f7100e0299d9562d13cff3792ccfec10ad64e6681"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (45\u201347 lines \u00D7 2): crates/biome_js_formatter/src/jsx/attribute/spread_attribute.rs:15-61 | crates/biome_js_formatter/src/jsx/auxiliary/spread_child.rs:15-59 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_formatter/src/jsx/attribute/spread_attribute.rs:15\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026JsxSpreadAttribute\u0060 in one and \u0060\u0026JsxSpreadChild\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/biome_js_formatter/src/jsx/attribute/spread_attribute.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"45e0a65096f25ba523f23208846747faefa58db3d523b81df55d604f98443435"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (47 lines \u00D7 2): crates/biome_syntax_codegen/src/generate_syntax_factory.rs:112-158 | xtask/codegen/src/generate_syntax_factory.rs:101-147 \u2014 before extracting anything, compare \u0060crates/biome_syntax_codegen/src/generate_syntax_factory.rs\u0060 and \u0060xtask/codegen/src/generate_syntax_factory.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 137 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_syntax_codegen/src/generate_syntax_factory.rs:112\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_syntax_codegen/src/generate_syntax_factory.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"82fad39eb7f83c685a4ce4a71a55bdfddcdc6ec3aee00368cdc2ecbd2f067965"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (46 lines \u00D7 2): crates/biome_cli/src/reporter/summary.rs:93-138 | crates/biome_cli/src/reporter/terminal.rs:87-132 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/reporter/summary.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a2de9b821f7f96346a8e11562ad6a42ca845eea85c6916afd81e82f72236f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (46 lines \u00D7 2): crates/biome_js_analyze/src/lint/suspicious/no_global_is_finite.rs:79-124 | crates/biome_js_analyze/src/lint/suspicious/no_global_is_nan.rs:80-125 \u2014 before extracting anything, compare \u0060crates/biome_js_analyze/src/lint/suspicious/no_global_is_finite.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/suspicious/no_global_is_nan.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 78 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/suspicious/no_global_is_finite.rs:79\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/suspicious/no_global_is_finite.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee3bdec9c6b24e95ba20ee6e135776ec5651b7f63aa70dcafa11f10ea3df0db4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (45 lines \u00D7 2): crates/biome_syntax_codegen/src/ast.rs:424-468 | xtask/codegen/src/ast.rs:462-506 \u2014 before extracting anything, compare \u0060crates/biome_syntax_codegen/src/ast.rs\u0060 and \u0060xtask/codegen/src/ast.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 344 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_syntax_codegen/src/ast.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"83a7f4bee37becaf45f5091a1e6d224db94127a5c398cad27bd0988e7c026538"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40\u201341 lines \u00D7 3): crates/biome_graphql_parser/src/lexer/mod.rs:681-720 | crates/biome_grit_parser/src/lexer/mod.rs:724-763 | crates/biome_json_parser/src/lexer/mod.rs:668-708 \u2014 before extracting anything, compare \u0060crates/biome_graphql_parser/src/lexer/mod.rs\u0060 and \u0060crates/biome_grit_parser/src/lexer/mod.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 82 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_graphql_parser/src/lexer/mod.rs:681\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/biome_graphql_parser/src/lexer/mod.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"46d98e0d65f29044ff1f7febe496ce5eee3739368e85f0cba87bbdfbb67be155"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38\u201340 lines \u00D7 2): crates/biome_embeds/src/visitor.rs:1207-1246 | crates/biome_embeds/src/visitor.rs:1538-1575 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_embeds/src/visitor.rs:1207\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_embeds/src/visitor.rs"},"region":{"startLine":1207}}}],"partialFingerprints":{"codehealthFindingId/v1":"c71d24afcab3bc937a952dc45aa96f3e84cdf15408048fde62dad5a1765d22d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2): crates/biome_html_analyze/src/lint/nursery/no_obsolete_attributes.rs:174-213 | crates/biome_js_analyze/src/lint/nursery/no_obsolete_attributes.rs:176-215 \u2014 before extracting anything, compare \u0060crates/biome_html_analyze/src/lint/nursery/no_obsolete_attributes.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/nursery/no_obsolete_attributes.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 104 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_analyze/src/lint/nursery/no_obsolete_attributes.rs:174\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/biome_html_analyze/src/lint/nursery/no_obsolete_attributes.rs:216\u0060 calls \u0060write_markup\u0060 and \u0060crates/biome_js_analyze/src/lint/nursery/no_obsolete_attributes.rs:216\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/biome_html_analyze/src/lint/nursery/no_obsolete_attributes.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"66210a33a2bc499bf6a5ad61bf68c237f99253b71e162940d4b8f250a894061a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2): crates/biome_syntax_codegen/src/generate_nodes.rs:202-241 | xtask/codegen/src/generate_nodes.rs:213-252 \u2014 before extracting anything, compare \u0060crates/biome_syntax_codegen/src/generate_nodes.rs\u0060 and \u0060xtask/codegen/src/generate_nodes.rs\u0060 as WHOLE FILES: this scan already matched 26 separate duplicated blocks between them, totalling at least 933 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_syntax_codegen/src/generate_nodes.rs:202\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/biome_syntax_codegen/src/generate_nodes.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"674c49499728be02be68c4536342bf1d558fae73c07c86d0e2b0496611b697be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39 lines \u00D7 3): crates/biome_html_analyze/src/lint/correctness/use_vue_valid_v_cloak.rs:123-161 | crates/biome_html_analyze/src/lint/correctness/use_vue_valid_v_once.rs:124-162 | crates/biome_html_analyze/src/lint/correctness/use_vue_valid_v_pre.rs:124-162 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. 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/biome_html_analyze/src/lint/correctness/use_vue_valid_v_cloak.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"c51c0f54555efa19cb801d7ad765d2ed986382c06d909e0cc2756ce97ab2021a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36\u201339 lines \u00D7 2): crates/biome_js_formatter/src/jsx/attribute/expression_attribute_value.rs:28-63 | crates/biome_js_formatter/src/jsx/auxiliary/expression_child.rs:33-71 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_formatter/src/jsx/attribute/expression_attribute_value.rs:28\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/biome_js_formatter/src/jsx/attribute/expression_attribute_value.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"da4cd623dfbbbb2a335953f9a2793d8a50c4a52383fd78586e495c88e97e0814"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35\u201338 lines \u00D7 3): crates/biome_lsp/src/handlers/formatting.rs:30-67 | crates/biome_lsp/src/handlers/formatting.rs:116-150 | crates/biome_lsp/src/handlers/formatting.rs:224-258 \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/biome_lsp/src/handlers/formatting.rs:30\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/handlers/formatting.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8b4c2a8dade9babc4dda569374e4bed48d69108f8eb44b1bc4ac3b70ecc2fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2): crates/biome_grit_parser/src/lexer/mod.rs:998-1035 | crates/biome_json_parser/src/lexer/mod.rs:771-808 \u2014 before extracting anything, compare \u0060crates/biome_grit_parser/src/lexer/mod.rs\u0060 and \u0060crates/biome_json_parser/src/lexer/mod.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 260 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_grit_parser/src/lexer/mod.rs:998\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/biome_grit_parser/src/lexer/mod.rs"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"2960de1316d49d80c2cd3ffb7b5ea8b3494bfa8ed9b16f4c22b7cc87ebd50f50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2): crates/biome_syntax_codegen/src/ast.rs:333-370 | xtask/codegen/src/ast.rs:371-408 \u2014 before extracting anything, compare \u0060crates/biome_syntax_codegen/src/ast.rs\u0060 and \u0060xtask/codegen/src/ast.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 344 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_syntax_codegen/src/ast.rs:333\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_syntax_codegen/src/ast.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"690e0e952fad3db23ddbe51689b302192a90a1f0f78644054fdd3826503c20aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2): xtask/codegen/src/generate_migrate_eslint.rs:84-121 | xtask/codegen/src/generate_migrate_stylelint.rs:87-124 \u2014 before extracting anything, compare \u0060xtask/codegen/src/generate_migrate_eslint.rs\u0060 and \u0060xtask/codegen/src/generate_migrate_stylelint.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060xtask/codegen/src/generate_migrate_eslint.rs:84\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/generate_migrate_eslint.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ba23b51a58e4c0f6b13718e6766419a5fa1a6c03250303b44219e492eda45a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2): crates/biome_syntax_codegen/src/ast.rs:375-411 | xtask/codegen/src/ast.rs:413-449 \u2014 before extracting anything, compare \u0060crates/biome_syntax_codegen/src/ast.rs\u0060 and \u0060xtask/codegen/src/ast.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 344 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_syntax_codegen/src/ast.rs:375\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/biome_syntax_codegen/src/ast.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac574a455749aa8af2d9e884fdc955ad19d6f8e7b15d363e349f76a94106d7eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2): crates/biome_syntax_codegen/src/generate_nodes.rs:472-508 | xtask/codegen/src/generate_nodes.rs:504-540 \u2014 before extracting anything, compare \u0060crates/biome_syntax_codegen/src/generate_nodes.rs\u0060 and \u0060xtask/codegen/src/generate_nodes.rs\u0060 as WHOLE FILES: this scan already matched 26 separate duplicated blocks between them, totalling at least 933 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_syntax_codegen/src/generate_nodes.rs:472\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_syntax_codegen/src/generate_nodes.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf21215f7e3bb7ea846ece59b580521457728059e3889d46280014f659b23b58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): crates/biome_analyze/src/analyzer_plugin.rs:169-203 | crates/biome_analyze/src/analyzer_plugin.rs:292-326 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_analyze/src/analyzer_plugin.rs:169\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/biome_analyze/src/analyzer_plugin.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0523990ad6fa9d7345577f7dad64643f0e1f505b94e1930dfee6e78131da4c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): crates/biome_html_analyze/src/lint/nursery/no_disabled_attribute.rs:155-189 | crates/biome_js_analyze/src/lint/nursery/no_disabled_attribute.rs:151-185 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_analyze/src/lint/nursery/no_disabled_attribute.rs:155\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_html_analyze/src/lint/nursery/no_disabled_attribute.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe21e95e2748fa8b0a895d00916d7f14daaf8f6fa59b61c991bc5de84af046c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 5): crates/biome_graphql_formatter/src/verbatim.rs:47-80 | crates/biome_grit_formatter/src/verbatim.rs:47-80 | crates/biome_html_formatter/src/verbatim.rs:60-93 | crates/biome_js_formatter/src/verbatim.rs:47-80 | crates/biome_json_formatter/src/verbatim.rs:46-79 \u2014 before extracting anything, compare \u0060crates/biome_graphql_formatter/src/verbatim.rs\u0060 and \u0060crates/biome_grit_formatter/src/verbatim.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 199 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_graphql_formatter/src/verbatim.rs:47\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060\u0026mut Formatter\u003CGraphqlFormatContext\u003E\u0060 in one and \u0060\u0026mut Formatter\u003CGritFormatContext\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_graphql_formatter/src/verbatim.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a411acdc88ac587befda45d13970150dc1cfcaa6de0ddc4c850a8f08e7463f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201334 lines \u00D7 2): crates/biome_css_formatter/src/scss/statements/forward_at_rule.rs:12-45 | crates/biome_css_formatter/src/scss/statements/use_at_rule.rs:11-40 \u2014 before extracting anything, compare \u0060crates/biome_css_formatter/src/scss/statements/forward_at_rule.rs\u0060 and \u0060crates/biome_css_formatter/src/scss/statements/use_at_rule.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_formatter/src/scss/statements/forward_at_rule.rs:12\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026ScssForwardAtRule\u0060 in one and \u0060\u0026ScssUseAtRule\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/biome_css_formatter/src/scss/statements/forward_at_rule.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd85ab7e05d2609b393f025ab3ac5bd1b6b4f1ccdc2dc7f04e44ba56f7367fce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33\u201334 lines \u00D7 2): crates/biome_markdown_parser/src/lexer/mod.rs:533-565 | crates/biome_markdown_parser/src/to_html.rs:1910-1943 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_markdown_parser/src/lexer/mod.rs:533\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/biome_markdown_parser/src/lexer/mod.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"213b11ffc5ed011a9f1ad24b0c14221ffac63c44d7fb64fc0ddc75775b86f26e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): xtask/codegen/src/generate_migrate_eslint.rs:14-48 | xtask/codegen/src/generate_migrate_stylelint.rs:14-48 \u2014 before extracting anything, compare \u0060xtask/codegen/src/generate_migrate_eslint.rs\u0060 and \u0060xtask/codegen/src/generate_migrate_stylelint.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060xtask/codegen/src/generate_migrate_eslint.rs:14\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/generate_migrate_eslint.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"b986e410ab1c62106e3348116472013aa8ba3c6c5a76d83b7522f39ffe1b2928"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): crates/biome_yaml_formatter/src/yaml/lists/flow_map_entry_list.rs:11-43 | crates/biome_yaml_formatter/src/yaml/lists/flow_sequence_entry_list.rs:11-43 \u2014 before extracting anything, compare \u0060crates/biome_yaml_formatter/src/yaml/lists/flow_map_entry_list.rs\u0060 and \u0060crates/biome_yaml_formatter/src/yaml/lists/flow_sequence_entry_list.rs\u0060 as WHOLE FILES: 82% 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026YamlFlowMapEntryList\u0060 in one and \u0060\u0026YamlFlowSequenceEntryList\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/biome_yaml_formatter/src/yaml/lists/flow_map_entry_list.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"19549ae235f2288d9af358eea8893b9ed5055001be94b1daa17a1a884bf04c4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201332 lines \u00D7 6): crates/biome_css_formatter/src/verbatim.rs:159-189 | crates/biome_graphql_formatter/src/verbatim.rs:74-105 | crates/biome_grit_formatter/src/verbatim.rs:74-104 | crates/biome_html_formatter/src/verbatim.rs:87-114 | crates/biome_js_formatter/src/verbatim.rs:74-104 | crates/biome_json_formatter/src/verbatim.rs:73-103 \u2014 before extracting anything, compare \u0060crates/biome_css_formatter/src/verbatim.rs\u0060 and \u0060crates/biome_graphql_formatter/src/verbatim.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 150 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_formatter/src/verbatim.rs:159\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060\u0026mut Formatter\u003CCssFormatContext\u003E\u0060 in one and \u0060\u0026mut Formatter\u003CGraphqlFormatContext\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_formatter/src/verbatim.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7026351e32d95949a75948a6e0cd83bf06674dc1e83a713b7aa41b734c6d827"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): crates/biome_syntax_codegen/src/generate_nodes.rs:919-950 | xtask/codegen/src/generate_nodes.rs:959-990 \u2014 before extracting anything, compare \u0060crates/biome_syntax_codegen/src/generate_nodes.rs\u0060 and \u0060xtask/codegen/src/generate_nodes.rs\u0060 as WHOLE FILES: this scan already matched 26 separate duplicated blocks between them, totalling at least 933 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_syntax_codegen/src/generate_nodes.rs:919\u0060 it begins part-way through the construct above it, so those exact 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, \u0060xtask/codegen/src/generate_nodes.rs:992\u0060 calls \u0060reformat\u0060 and \u0060crates/biome_syntax_codegen/src/generate_nodes.rs:952\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_syntax_codegen/src/generate_nodes.rs"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"5710a91a6aa600c4548ec1990b8d6767870a56d51df43721244c757f86cd4c4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 5): crates/biome_service/src/file_handlers/css.rs:622-652 | crates/biome_service/src/file_handlers/graphql.rs:509-539 | crates/biome_service/src/file_handlers/grit.rs:449-479 | crates/biome_service/src/file_handlers/javascript.rs:1793-1823 | crates/biome_service/src/file_handlers/json.rs:582-612 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/css.rs\u0060 and \u0060crates/biome_service/src/file_handlers/graphql.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 202 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/biome_service/src/file_handlers/css.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"c29f49b570aba3ae023b2012f7d869b32e888018eb5ae8674ec817775524ebd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201331 lines \u00D7 2): crates/biome_graphql_parser/src/lexer/mod.rs:201-230 | crates/biome_grit_parser/src/lexer/mod.rs:230-260 \u2014 before extracting anything, compare \u0060crates/biome_graphql_parser/src/lexer/mod.rs\u0060 and \u0060crates/biome_grit_parser/src/lexer/mod.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 82 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_graphql_parser/src/lexer/mod.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"0895fd7e520a88d39af31eb57507567260eb00a13d84c9562a393d5758bc1f6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201331 lines \u00D7 2): crates/biome_html_analyze/src/lint/a11y/no_aria_unsupported_elements.rs:97-125 | crates/biome_html_analyze/src/lint/a11y/use_valid_aria_props.rs:108-138 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. 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/biome_html_analyze/src/lint/a11y/no_aria_unsupported_elements.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6116af149235ef214c206620c39faafc0e6820d7932c8e73d00f6beb300ecbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): crates/biome_html_formatter/src/html/lists/element_list.rs:1053-1082 | crates/biome_html_formatter/src/html/lists/element_list.rs:1107-1136 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_html_formatter/src/html/lists/element_list.rs:1107\u0060 it begins part-way through the construct above it, so those exact 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/biome_html_formatter/src/html/lists/element_list.rs"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"502e6287cb2b7bb0ddc018cd535ea279d7cc5fccf16ca48eb7956169c0b55829"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): crates/biome_js_formatter/src/js/module/import_default_clause.rs:13-42 | crates/biome_js_formatter/src/js/module/import_namespace_clause.rs:13-42 \u2014 before extracting anything, compare \u0060crates/biome_js_formatter/src/js/module/import_default_clause.rs\u0060 and \u0060crates/biome_js_formatter/src/js/module/import_namespace_clause.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_formatter/src/js/module/import_default_clause.rs:13\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026JsImportDefaultClause\u0060 in one and \u0060\u0026JsImportNamespaceClause\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/biome_js_formatter/src/js/module/import_default_clause.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf78dbecc0bdf8cb4f6727145db02a9820f9a46ee105f68b95a488ee7e299a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 7): crates/biome_css_formatter/src/verbatim.rs:200-235 | crates/biome_graphql_formatter/src/verbatim.rs:116-151 | crates/biome_grit_formatter/src/verbatim.rs:115-150 | crates/biome_html_formatter/src/verbatim.rs:125-160 | crates/biome_js_formatter/src/verbatim.rs:115-150 | crates/biome_json_formatter/src/verbatim.rs:114-149 | crates/biome_yaml_formatter/src/verbatim.rs:149-184 \u2014 before extracting anything, compare \u0060crates/biome_css_formatter/src/verbatim.rs\u0060 and \u0060crates/biome_graphql_formatter/src/verbatim.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 150 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060\u0026mut Formatter\u003CCssFormatContext\u003E\u0060 in one and \u0060\u0026mut Formatter\u003CGraphqlFormatContext\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_formatter/src/verbatim.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"1880b090ac4a64dfd33a91ca5a4d616ae8e5a3ec4491080621f46c703c9f1687"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201329 lines \u00D7 3): crates/biome_service/src/file_handlers/astro.rs:71-99 | crates/biome_service/src/file_handlers/svelte.rs:102-129 | crates/biome_service/src/file_handlers/vue.rs:105-132 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/astro.rs\u0060 and \u0060crates/biome_service/src/file_handlers/svelte.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_service/src/file_handlers/astro.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/biome_service/src/file_handlers/astro.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"9648d50d7801b96da35deefb757d7adc055fbd9b442eab9731a59f63ad666201"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): crates/biome_js_control_flow/src/nodes/for_in.rs:26-54 | crates/biome_js_control_flow/src/nodes/for_of.rs:26-54 \u2014 before extracting anything, compare \u0060crates/biome_js_control_flow/src/nodes/for_in.rs\u0060 and \u0060crates/biome_js_control_flow/src/nodes/for_of.rs\u0060 as WHOLE FILES: 90% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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/biome_js_control_flow/src/nodes/for_in.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a1f87e6df825977233d6cd5060456e42277923db884ffed2ff40798d67d1d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): crates/biome_js_semantic/src/events.rs:1060-1088 | crates/biome_js_semantic/src/semantic_model/builder.rs:112-140 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_semantic/src/events.rs:1060\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_js_semantic/src/events.rs"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd4efcf2fd0a652846bdc5feb88a7dc0f8a181b7767af41b472d54d66f24e2aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): crates/biome_rule_options/src/no_restricted_imports.rs:925-953 | crates/biome_rule_options/src/no_restricted_imports.rs:962-990 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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/biome_rule_options/src/no_restricted_imports.rs"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"00dbaf8ecdcfc518c9ff816972008076082708690f27aba6c3a0ff80cab5812d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (41 lines \u00D7 2): xtask/codegen/src/generate_configuration.rs:602-642 | xtask/codegen/src/generate_configuration.rs:758-798 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060xtask/codegen/src/generate_configuration.rs:602\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/generate_configuration.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8230e90656bf2607b667f127a83bbd01ca6e92e7641847287d7c0d55a664084"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): xtask/codegen/src/generate_configuration.rs:715-743 | xtask/codegen/src/generate_configuration.rs:883-911 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/generate_configuration.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a9c2ecd574736ea412b404eaae144c253648d494c8cf41b85c3d17e9c11ebf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 4): crates/biome_css_formatter/src/comments.rs:57-84 | crates/biome_graphql_formatter/src/comments.rs:29-56 | crates/biome_grit_formatter/src/comments.rs:45-72 | crates/biome_json_formatter/src/comments.rs:30-57 \u2014 before extracting anything, compare \u0060crates/biome_css_formatter/src/comments.rs\u0060 and \u0060crates/biome_json_formatter/src/comments.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_formatter/src/comments.rs:57\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060comment\u0060 to \u0060\u0026SourceComment\u003CCssLanguage\u003E\u0060 in one and \u0060\u0026SourceComment\u003CGraphqlLanguage\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_formatter/src/comments.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"97157e76217fc39ff6dbafabdb9280a3f6c8a87aa8d7a796af8d5541e211556f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): crates/biome_cli/src/execute/migrate.rs:349-376 | crates/biome_cli/src/execute/migrate.rs:434-461 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_cli/src/execute/migrate.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/biome_cli/src/execute/migrate.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"d24643a1506632ed850a5da542b0fd0685abee8fed17421c08427bba78e7fcf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): crates/biome_cli/src/lib.rs:92-119 | crates/biome_cli/src/lib.rs:151-178 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_cli/src/lib.rs:92\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/biome_cli/src/lib.rs:89\u0060 calls \u0060start\u0060, \u0060stop\u0060 and \u0060crates/biome_cli/src/lib.rs:150\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/biome_cli/src/lib.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"613b43e7da654d7b66a1db8efcea5fd4338b727e99e4943584ea6ccf85873824"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): crates/biome_html_analyze/src/lint/a11y/no_noninteractive_element_interactions.rs:86-113 | crates/biome_js_analyze/src/lint/a11y/no_noninteractive_element_interactions.rs:94-121 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/a11y/no_noninteractive_element_interactions.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"048d042c4ec6bcc47c47dad692e416b59eed99e5762a8943024be7fcbd94543d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): crates/biome_package/src/node_js_package/package_json.rs:286-313 | crates/biome_package/src/node_js_package/package_json.rs:317-344 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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/biome_package/src/node_js_package/package_json.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"d37842892e1de45379b1f9ce73b2079d0d5a04386bb4023093db946e00e260e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 7): crates/biome_service/src/file_handlers/css.rs:888-914 | crates/biome_service/src/file_handlers/graphql.rs:713-739 | crates/biome_service/src/file_handlers/html.rs:1369-1395 | crates/biome_service/src/file_handlers/javascript.rs:1576-1602 | crates/biome_service/src/file_handlers/json.rs:835-861 | crates/biome_service/src/file_handlers/md.rs:746-772 | crates/biome_service/src/file_handlers/yaml.rs:608-634 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/css.rs\u0060 and \u0060crates/biome_service/src/file_handlers/graphql.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 202 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/biome_service/src/file_handlers/html.rs:1398\u0060 calls \u0060syntax\u0060, \u0060text_range_with_trivia\u0060, \u0060into\u0060 and \u0060crates/biome_service/src/file_handlers/javascript.rs:1604\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/biome_service/src/file_handlers/css.rs"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6aef948323c7c8e2befabd356fb726fd2507bd8d037eed1920fbd19a136398b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201327 lines \u00D7 2): crates/biome_cli/src/runner/impls/process_file/check.rs:50-75 | crates/biome_cli/src/runner/impls/process_file/lint_and_assist.rs:65-91 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_cli/src/runner/impls/process_file/check.rs:50\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/biome_cli/src/runner/impls/process_file/check.rs:49\u0060 calls \u0060supports_format\u0060 and \u0060crates/biome_cli/src/runner/impls/process_file/lint_and_assist.rs:64\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/biome_cli/src/runner/impls/process_file/check.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad827b0b0ecb77dcbd8f66ddc19790563887476279dc043e1bef8c5d286ed90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201327 lines \u00D7 2): crates/biome_css_parser/src/syntax/selector/pseudo_class/function_selector.rs:68-93 | crates/biome_css_parser/src/syntax/selector/pseudo_class/function_selector_list.rs:26-52 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_parser/src/syntax/selector/pseudo_class/function_selector_list.rs:26\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/biome_css_parser/src/syntax/selector/pseudo_class/function_selector.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2997c98759de275ab30a065b7d777eea4fdba96d2aa057c9331c1d5f8d83a01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): crates/biome_syntax_codegen/src/ast.rs:479-505 | xtask/codegen/src/ast.rs:517-543 \u2014 before extracting anything, compare \u0060crates/biome_syntax_codegen/src/ast.rs\u0060 and \u0060xtask/codegen/src/ast.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 344 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_syntax_codegen/src/ast.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"5968af775694c5d4f1b913a0630ddf274ea5e782b67b3ed28aa33953e373be28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): crates/biome_syntax_codegen/src/generate_nodes.rs:314-340 | xtask/codegen/src/generate_nodes.rs:344-370 \u2014 before extracting anything, compare \u0060crates/biome_syntax_codegen/src/generate_nodes.rs\u0060 and \u0060xtask/codegen/src/generate_nodes.rs\u0060 as WHOLE FILES: this scan already matched 26 separate duplicated blocks between them, totalling at least 933 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_syntax_codegen/src/generate_nodes.rs:314\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_syntax_codegen/src/generate_nodes.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e7e77b0e55fa2af4096452e911314175e8c46fb07a77b9d7c925c5f933adc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): crates/biome_syntax_codegen/src/generate_nodes.rs:1010-1036 | xtask/codegen/src/generate_nodes.rs:1057-1083 \u2014 before extracting anything, compare \u0060crates/biome_syntax_codegen/src/generate_nodes.rs\u0060 and \u0060xtask/codegen/src/generate_nodes.rs\u0060 as WHOLE FILES: this scan already matched 26 separate duplicated blocks between them, totalling at least 933 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_syntax_codegen/src/generate_nodes.rs:1010\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_syntax_codegen/src/generate_nodes.rs"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a7b5b364b722a9d61b0e4973226f7a50e8946c2d9304dc0dbb7b7b892b149d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): crates/biome_syntax_codegen/src/generate_syntax_kinds.rs:116-142 | xtask/codegen/src/generate_syntax_kinds.rs:244-270 \u2014 before extracting anything, compare \u0060crates/biome_syntax_codegen/src/generate_syntax_kinds.rs\u0060 and \u0060xtask/codegen/src/generate_syntax_kinds.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 50 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_syntax_codegen/src/generate_syntax_kinds.rs:116\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/biome_syntax_codegen/src/generate_syntax_kinds.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"4267634f60c763f3ac7a51c6a8ede4981e69f0ef4e241e38a9ac71220bbcb88f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 3): crates/biome_js_analyze/src/assist/source/organize_imports/specifiers_attributes.rs:86-111 | crates/biome_js_analyze/src/assist/source/organize_imports/specifiers_attributes.rs:162-187 | crates/biome_js_analyze/src/assist/source/organize_imports/specifiers_attributes.rs:240-265 \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 \u0060specifiers1\u0060 to \u0060\u0026JsExportNamedFromSpecifierList\u0060 in one and \u0060\u0026JsExportNamedSpecifierList\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_js_analyze/src/assist/source/organize_imports/specifiers_attributes.rs:84\u0060 calls \u0060specifiers\u0060 and \u0060crates/biome_js_analyze/src/assist/source/organize_imports/specifiers_attributes.rs:161\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/biome_js_analyze/src/assist/source/organize_imports/specifiers_attributes.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f2da4f3f2bb5bc4ce457c2b99a44ce7aa8a81128b04f0f13499b6876da4627"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): crates/biome_grit_formatter/src/grit/patterns/pattern_if_else.rs:9-34 | crates/biome_grit_formatter/src/grit/predicates/predicate_if_else.rs:9-34 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_grit_formatter/src/grit/patterns/pattern_if_else.rs:9\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026GritPatternIfElse\u0060 in one and \u0060\u0026GritPredicateIfElse\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/biome_grit_formatter/src/grit/patterns/pattern_if_else.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"139eddb3409288da75101954dd76b6c796582c734943c961a0c9b3af0447e59a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): crates/biome_js_semantic/src/events.rs:426-451 | crates/biome_js_semantic/src/events.rs:516-541 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_js_semantic/src/events.rs:426\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_semantic/src/events.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ca8280164ff44394df563c31e8b8ae03aa72c4c9877ada59300e80af98d889"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): crates/biome_markdown_parser/src/syntax/list.rs:942-967 | crates/biome_markdown_parser/src/syntax/list.rs:1338-1363 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_markdown_parser/src/syntax/list.rs:942\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca3bc4c1a8ba670138cc82d06b9b8b6b6290fc087057b4b198d4e7fc3aa8943"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): crates/biome_syntax_codegen/src/generate_nodes.rs:714-739 | xtask/codegen/src/generate_nodes.rs:757-782 \u2014 before extracting anything, compare \u0060crates/biome_syntax_codegen/src/generate_nodes.rs\u0060 and \u0060xtask/codegen/src/generate_nodes.rs\u0060 as WHOLE FILES: this scan already matched 26 separate duplicated blocks between them, totalling at least 933 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_syntax_codegen/src/generate_nodes.rs:714\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_syntax_codegen/src/generate_nodes.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"a073182e48017b826d32ac8a8104149046e2c30ce07f92e243602b953af13cc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201325 lines \u00D7 4): crates/biome_service/src/file_handlers/html.rs:1175-1198 | crates/biome_service/src/file_handlers/html.rs:1408-1432 | crates/biome_service/src/file_handlers/html.rs:1475-1499 | crates/biome_service/src/file_handlers/html.rs:1525-1548 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/html.rs"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef6450a5b61a18523255a6263c379e59e69d0c9c4a4c5ef618eb65047adc9be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201325 lines \u00D7 2): crates/biome_css_formatter/src/css/properties/generic_property.rs:118-142 | crates/biome_css_formatter/src/scss/auxiliary/variable_declaration.rs:103-126 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_formatter/src/css/properties/generic_property.rs:118\u0060 it does not close everything it opens, so those exact 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/biome_css_formatter/src/scss/auxiliary/variable_declaration.rs:100\u0060 calls \u0060value_boundary_comment_start\u0060, \u0060split_at\u0060 and \u0060crates/biome_css_formatter/src/css/properties/generic_property.rs:116\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/biome_css_formatter/src/css/properties/generic_property.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"175644d84ca467805fecb077ceab76a23c389f0cd14052006cd026e47cd0d998"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/biome_css_formatter/src/scss/pseudo/interpolated_pseudo_class_function.rs:18-42 | crates/biome_css_formatter/src/scss/pseudo/interpolated_pseudo_element_function.rs:18-42 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_formatter/src/scss/pseudo/interpolated_pseudo_class_function.rs:18\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026ScssInterpolatedPseudoClassFunction\u0060 in one and \u0060\u0026ScssInterpolatedPseudoElementFunction\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/biome_css_formatter/src/scss/pseudo/interpolated_pseudo_class_function.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d59652ea45f98775f5fd1cdf5f930e7a286034b7494d971f1e28d1b230740fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201325 lines \u00D7 2): crates/biome_html_analyze/src/lint/correctness/use_vue_valid_v_html.rs:66-89 | crates/biome_html_analyze/src/lint/correctness/use_vue_valid_v_text.rs:66-90 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_analyze/src/lint/correctness/use_vue_valid_v_html.rs:66\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/correctness/use_vue_valid_v_html.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b8e4d327d93bafb7e2c855d75bf5321f4c438810f13a1e1492fb9d19dd87a87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/biome_html_analyze/src/lint/nursery/no_astro_conflicting_set_directives.rs:170-194 | crates/biome_js_analyze/src/lint/nursery/no_astro_conflicting_set_directives.rs:165-189 \u2014 before extracting anything, compare \u0060crates/biome_html_analyze/src/lint/nursery/no_astro_conflicting_set_directives.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/nursery/no_astro_conflicting_set_directives.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_analyze/src/lint/nursery/no_astro_conflicting_set_directives.rs:170\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_js_analyze/src/lint/nursery/no_astro_conflicting_set_directives.rs:164\u0060 calls \u0060syntax\u0060, \u0060parent\u0060, \u0060and_then\u0060 and \u0060crates/biome_html_analyze/src/lint/nursery/no_astro_conflicting_set_directives.rs:169\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/nursery/no_astro_conflicting_set_directives.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"c88a07d8e1b44af474e04bb4d320536175c4320f53dffca044b8aec2389ed034"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/biome_html_analyze/src/lint/nursery/no_tailwind_restricted_classes.rs:203-227 | crates/biome_js_analyze/src/lint/nursery/no_tailwind_restricted_classes.rs:202-226 \u2014 before extracting anything, compare \u0060crates/biome_html_analyze/src/lint/nursery/no_tailwind_restricted_classes.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/nursery/no_tailwind_restricted_classes.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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/biome_html_analyze/src/lint/nursery/no_tailwind_restricted_classes.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"844a9da8da59fb80489a19ff51cd45969046c525494db6ea236ba55f64a3955e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/biome_html_analyze/src/lint/nursery/use_tailwind_shorthand_classes.rs:106-130 | crates/biome_js_analyze/src/lint/nursery/use_tailwind_shorthand_classes.rs:106-130 \u2014 before extracting anything, compare \u0060crates/biome_html_analyze/src/lint/nursery/use_tailwind_shorthand_classes.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/nursery/use_tailwind_shorthand_classes.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/nursery/use_tailwind_shorthand_classes.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c195325c7bbd82a89772450eb7c0aa45e59d065ac0459c61720a1942910735"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/no_array_for_each.rs:233-257 | crates/biome_js_analyze/src/utils/indexed_collection.rs:33-57 \u2014 before extracting anything, compare \u0060crates/biome_js_analyze/src/lint/nursery/no_array_for_each.rs\u0060 and \u0060crates/biome_js_analyze/src/utils/indexed_collection.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/nursery/no_array_for_each.rs:233\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_array_for_each.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcfb1642c8b4550340c8dd2619ea405e820bb8cd50ba7ad0f050db886347d27d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/biome_js_control_flow/src/nodes/break_stmt.rs:55-79 | crates/biome_js_control_flow/src/nodes/continue_stmt.rs:43-67 \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/biome_js_control_flow/src/nodes/break_stmt.rs:55\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_js_control_flow/src/nodes/break_stmt.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"502143c3551556acf884cbb5f932b8c138ef9748ac92fd842b1b0b68664ccd9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/biome_js_formatter/src/js/assignments/array_assignment_pattern.rs:13-37 | crates/biome_js_formatter/src/js/bindings/array_binding_pattern.rs:13-37 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_formatter/src/js/assignments/array_assignment_pattern.rs:13\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026JsArrayAssignmentPattern\u0060 in one and \u0060\u0026JsArrayBindingPattern\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/biome_js_formatter/src/js/assignments/array_assignment_pattern.rs:39\u0060 calls \u0060needs_parentheses\u0060 and \u0060crates/biome_js_formatter/src/js/bindings/array_binding_pattern.rs:39\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/biome_js_formatter/src/js/assignments/array_assignment_pattern.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"3628011fd9b9e44f806d9e1b16fd2884d44043bc2a9d319e25df55ba32cc9dd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201325 lines \u00D7 2): crates/biome_js_formatter/src/js/expressions/arrow_function_expression.rs:163-186 | crates/biome_js_formatter/src/js/expressions/arrow_function_expression.rs:194-218 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_formatter/src/js/expressions/arrow_function_expression.rs:163\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/js/expressions/arrow_function_expression.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb82ad9b2822b5f8fd408c554f30c5d435de73ca6ec6744b5e4b92f7c0d3cb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201325 lines \u00D7 2): crates/biome_js_formatter/src/js/module/import_assertion.rs:13-35 | crates/biome_js_formatter/src/ts/module/import_type_assertion.rs:12-36 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_formatter/src/js/module/import_assertion.rs:13\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026JsImportAssertion\u0060 in one and \u0060\u0026TsImportTypeAssertion\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/biome_js_formatter/src/ts/module/import_type_assertion.rs:38\u0060 calls \u0060format\u0060 and \u0060crates/biome_js_formatter/src/js/module/import_assertion.rs:37\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/biome_js_formatter/src/js/module/import_assertion.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcb2c921ef5fd017fe1606a9ab0d544f9e872d8225b05dccacbe9fc7f5054de6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201325 lines \u00D7 2): crates/biome_js_parser/src/syntax/module.rs:1203-1227 | crates/biome_js_parser/src/syntax/module.rs:1235-1246 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_parser/src/syntax/module.rs:1203\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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/biome_js_parser/src/syntax/module.rs"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"33900bfc3970a4bc39921726f47dc60b60d28cb7f5b39ad2ebad864fd94fd73b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201325 lines \u00D7 2): crates/biome_markdown_parser/src/syntax/list.rs:971-992 | crates/biome_markdown_parser/src/syntax/list.rs:1364-1388 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_markdown_parser/src/syntax/list.rs:1364\u0060 it does not close everything it opens, so those exact 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/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"8acec1654b58edc46cf7992a4f75db210b7ac87534f9d5bb68a8a164195bf7ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/biome_service/src/file_handlers/css.rs:920-944 | crates/biome_service/src/file_handlers/css.rs:980-1004 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_service/src/file_handlers/css.rs:920\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_service/src/file_handlers/css.rs:917\u0060 calls \u0060syntax\u0060, \u0060text_range_with_trivia\u0060, \u0060into\u0060 and \u0060crates/biome_service/src/file_handlers/css.rs:978\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/biome_service/src/file_handlers/css.rs"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"427acf40b673f8a70075e33c20866161acfe05a43380a9fcffe20eff9b73092e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): crates/biome_service/src/file_handlers/mod.rs:1418-1443 | crates/biome_service/src/file_handlers/mod.rs:1450-1475 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_service/src/file_handlers/mod.rs:1418\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/biome_service/src/file_handlers/mod.rs"},"region":{"startLine":1418}}}],"partialFingerprints":{"codehealthFindingId/v1":"e58bcdc2239d720b649721cc3bf80b4810ac498c325d26d06fffd994ed2d439d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): crates/biome_service/src/workspace_types.rs:67-92 | xtask/codegen/src/generate_schema.rs:57-82 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/workspace_types.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b5ae8d47e08429fdd87318ff4c7679fa048b50aa3a0560389c1cad3c8e7611e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): xtask/codegen/src/generate_migrate_eslint.rs:196-220 | xtask/codegen/src/generate_migrate_stylelint.rs:205-229 \u2014 before extracting anything, compare \u0060xtask/codegen/src/generate_migrate_eslint.rs\u0060 and \u0060xtask/codegen/src/generate_migrate_stylelint.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060xtask/codegen/src/generate_migrate_eslint.rs:196\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/generate_migrate_eslint.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"5387ee8760804a89a42b08c90c7fd44d93d7ce95c7efa63d1473696e492045b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 4): crates/biome_grit_patterns/src/pattern_compiler/auto_wrap.rs:92-115 | crates/biome_grit_patterns/src/pattern_compiler/auto_wrap.rs:157-180 | crates/biome_grit_patterns/src/pattern_compiler/auto_wrap.rs:251-274 | crates/biome_grit_patterns/src/pattern_compiler/auto_wrap.rs:315-338 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_grit_patterns/src/pattern_compiler/auto_wrap.rs:156\u0060 calls \u0060Files\u0060 and \u0060crates/biome_grit_patterns/src/pattern_compiler/auto_wrap.rs:314\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_patterns/src/pattern_compiler/auto_wrap.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa524955a3d2b9efbbc820c1e7eb233e8bad01ee413fb2f03b5c5fd7a8e4466"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): crates/biome_grit_parser/src/lexer/mod.rs:364-387 | crates/biome_json_parser/src/lexer/mod.rs:408-431 \u2014 before extracting anything, compare \u0060crates/biome_grit_parser/src/lexer/mod.rs\u0060 and \u0060crates/biome_json_parser/src/lexer/mod.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 260 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_grit_parser/src/lexer/mod.rs:364\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_parser/src/lexer/mod.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"259b060f62236e60a22c2134bc6ff165c1730de38db51def80b75075493eccd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): crates/biome_html_analyze/src/lint/nursery/no_tailwind_raw_colors.rs:140-163 | crates/biome_js_analyze/src/lint/nursery/no_tailwind_raw_colors.rs:139-162 \u2014 before extracting anything, compare \u0060crates/biome_html_analyze/src/lint/nursery/no_tailwind_raw_colors.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/nursery/no_tailwind_raw_colors.rs\u0060 as WHOLE FILES: 85% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/nursery/no_tailwind_raw_colors.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"0996500bd39490d47a2a6fc24574ec16eea4d1e844a711a51b121e86c0d298e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201324 lines \u00D7 2): crates/biome_js_analyze/src/lint/suspicious/use_iterable_callback_return.rs:383-405 | crates/biome_js_analyze/src/utils/function_return.rs:24-47 \u2014 before extracting anything, compare \u0060crates/biome_js_analyze/src/lint/suspicious/use_iterable_callback_return.rs\u0060 and \u0060crates/biome_js_analyze/src/utils/function_return.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/suspicious/use_iterable_callback_return.rs:383\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/suspicious/use_iterable_callback_return.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f08c0a110a6033d6ac0d5de8c0b01c79ce4caaa5bb58e84c2f749c51ad96401"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201324 lines \u00D7 2): crates/biome_js_analyze/src/utils/batch.rs:128-150 | crates/biome_js_analyze/src/utils/batch.rs:168-191 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_js_analyze/src/utils/batch.rs:128\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/biome_js_analyze/src/utils/batch.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f2529fb8f26ec4b0a1f1fc2df5ab6c4b75f280886793160384ab5d63b9bbd35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): crates/biome_js_control_flow/src/nodes/do_while.rs:56-79 | crates/biome_js_control_flow/src/nodes/while_stmt.rs:56-79 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. 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/biome_js_control_flow/src/nodes/do_while.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc077b083136dbbdabdb1ed5a0f4ffb9b77fe22680edd8a68a97b32f36d0b1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): crates/biome_syntax_codegen/src/generate_nodes.rs:1106-1129 | xtask/codegen/src/generate_nodes.rs:1146-1169 \u2014 before extracting anything, compare \u0060crates/biome_syntax_codegen/src/generate_nodes.rs\u0060 and \u0060xtask/codegen/src/generate_nodes.rs\u0060 as WHOLE FILES: this scan already matched 26 separate duplicated blocks between them, totalling at least 933 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_syntax_codegen/src/generate_nodes.rs:1106\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060language_kind\u0060 to \u0060\u0026K\u0060 in one and \u0060LanguageKind\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/biome_syntax_codegen/src/generate_nodes.rs"},"region":{"startLine":1106}}}],"partialFingerprints":{"codehealthFindingId/v1":"31580a0d7ca6568edbbc1135919481e85fa598ee869fc00c713991be60ad8c90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): crates/biome_syntax_codegen/src/generate_syntax_factory.rs:18-41 | xtask/codegen/src/generate_syntax_factory.rs:11-34 \u2014 before extracting anything, compare \u0060crates/biome_syntax_codegen/src/generate_syntax_factory.rs\u0060 and \u0060xtask/codegen/src/generate_syntax_factory.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 137 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_syntax_codegen/src/generate_syntax_factory.rs:18\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_syntax_codegen/src/generate_syntax_factory.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a40e5cd662d10289dec1a2735fcc5e35d8f72328ccf09e4e17182ee6d1df80e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/biome_graphql_formatter/src/graphql/definitions/enum_type_definition.rs:14-36 | crates/biome_graphql_formatter/src/graphql/definitions/input_object_type_definition.rs:16-38 \u2014 before extracting anything, compare \u0060crates/biome_graphql_formatter/src/graphql/definitions/enum_type_definition.rs\u0060 and \u0060crates/biome_graphql_formatter/src/graphql/definitions/input_object_type_definition.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 54 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_graphql_formatter/src/graphql/definitions/enum_type_definition.rs:14\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026GraphqlEnumTypeDefinition\u0060 in one and \u0060\u0026GraphqlInputObjectTypeDefinition\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/biome_graphql_formatter/src/graphql/definitions/enum_type_definition.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"c65d087ac1d832c199d425e0a5c0f9453c48de670461abab08a967ff8206eeac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/biome_grit_parser/src/lexer/mod.rs:390-412 | crates/biome_json_parser/src/lexer/mod.rs:434-456 \u2014 before extracting anything, compare \u0060crates/biome_grit_parser/src/lexer/mod.rs\u0060 and \u0060crates/biome_json_parser/src/lexer/mod.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 260 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_grit_parser/src/lexer/mod.rs:390\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_parser/src/lexer/mod.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"78882e109e870864e2eb14165f1ae6e2e976ed5bb1175f76e372994a5101621a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/biome_grit_parser/src/lexer/mod.rs:505-527 | crates/biome_json_parser/src/lexer/mod.rs:559-581 \u2014 before extracting anything, compare \u0060crates/biome_grit_parser/src/lexer/mod.rs\u0060 and \u0060crates/biome_json_parser/src/lexer/mod.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 260 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_grit_parser/src/lexer/mod.rs:505\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_parser/src/lexer/mod.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"1515067135f8ec0829cc56d257b25b893d691b9adc1173f00e82400ac8d63758"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/biome_js_analyze/src/lint/style/use_number_namespace.rs:137-159 | crates/biome_js_analyze/src/lint/style/use_number_namespace.rs:176-198 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_number_namespace.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5bf4f3aa8a241a5fac4010c109e1a2225e0f07d3393b4640c984a299032023a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/biome_js_formatter/src/js/lists/object_assignment_pattern_property_list.rs:23-45 | crates/biome_js_formatter/src/js/lists/object_binding_pattern_property_list.rs:21-43 \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/biome_js_formatter/src/js/lists/object_assignment_pattern_property_list.rs:23\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026JsObjectAssignmentPatternPropertyList\u0060 in one and \u0060\u0026JsObjectBindingPatternPropertyList\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/biome_js_formatter/src/js/lists/object_assignment_pattern_property_list.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4b4c58005b7dbeea08a0433e6247343fec084110568bf895ace9e7a8e80d17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/biome_js_type_info/src/format_inferred_type_info.rs:308-330 | crates/biome_js_type_info/src/format_type_info.rs:235-257 \u2014 before extracting anything, compare \u0060crates/biome_js_type_info/src/format_inferred_type_info.rs\u0060 and \u0060crates/biome_js_type_info/src/format_type_info.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 242 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_type_info/src/format_inferred_type_info.rs:308\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060\u0026mut Formatter\u003CFormatInferredTypeContext\u003C\u0027db\u003E\u003E\u0060 in one and \u0060\u0026mut Formatter\u003CFormatTypeContext\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/format_inferred_type_info.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"95491bd6edbf879dc78f973c7021d22bd176f3ae999b248b1f16bfeb431335b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): crates/biome_js_type_info/src/interned_types.rs:677-699 | crates/biome_js_type_info/src/type_data.rs:458-479 \u2014 before extracting anything, compare \u0060crates/biome_js_type_info/src/interned_types.rs\u0060 and \u0060crates/biome_js_type_info/src/type_data.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_js_type_info/src/type_data.rs:457\u0060 calls \u0060ImportNamespace\u0060 and \u0060crates/biome_js_type_info/src/interned_types.rs:676\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/interned_types.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"c112c4f5e730293fd31f35d47bf03baca49bf9814baf213dcf7207bd69ffed17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/biome_markdown_formatter/src/markdown/lists/block_list.rs:48-70 | crates/biome_markdown_formatter/src/quote.rs:107-129 \u2014 before extracting anything, compare \u0060crates/biome_markdown_formatter/src/markdown/lists/block_list.rs\u0060 and \u0060crates/biome_markdown_formatter/src/quote.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_markdown_formatter/src/markdown/lists/block_list.rs:48\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/biome_markdown_formatter/src/quote.rs:130\u0060 calls \u0060should_format_quote_paragraph\u0060, \u0060entry\u0060 and \u0060crates/biome_markdown_formatter/src/markdown/lists/block_list.rs:71\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/biome_markdown_formatter/src/markdown/lists/block_list.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b7a0860e4f468448c950bde97972c431af0e6bbbd6d6213d3550d5d9362006"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/biome_service/src/file_handlers/svelte.rs:185-207 | crates/biome_service/src/file_handlers/vue.rs:176-198 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/svelte.rs\u0060 and \u0060crates/biome_service/src/file_handlers/vue.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 105 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/biome_service/src/file_handlers/svelte.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"80ea819ad3bcc6156ea55d3c029585a34fdc6e2b4f24de797895ffb61bdebc67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/biome_css_analyze/src/fonts.rs:314-335 | crates/biome_css_syntax/src/property_syntax/matcher.rs:185-206 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_analyze/src/fonts.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"c23f341f7f1a88958373a69fccfdea219cdcadb19e551ada4db81ffd7990d59e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): crates/biome_graphql_analyze/src/assist/source/use_graphql_sorted_variables.rs:199-226 | crates/biome_graphql_analyze/src/utils.rs:180-207 \u2014 before extracting anything, compare \u0060crates/biome_graphql_analyze/src/assist/source/use_graphql_sorted_variables.rs\u0060 and \u0060crates/biome_graphql_analyze/src/utils.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_graphql_analyze/src/assist/source/use_graphql_sorted_variables.rs:199\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_graphql_analyze/src/assist/source/use_graphql_sorted_variables.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce71658b6fe0b9ff0e1121cf4d72bbbc36fd147092923b9d0729cee0f1784a45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): crates/biome_grit_formatter/src/grit/declarations/function_definition.rs:9-30 | crates/biome_grit_formatter/src/grit/predicates/predicate_definition.rs:13-33 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_grit_formatter/src/grit/declarations/function_definition.rs:9\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026GritFunctionDefinition\u0060 in one and \u0060\u0026GritPredicateDefinition\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/biome_grit_formatter/src/grit/declarations/function_definition.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b09d222ede84b0644157bffcf83f8f4ccb9f68e682c4ec3c7615d0024696b18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/biome_html_parser/src/syntax/angular.rs:13-34 | crates/biome_html_parser/src/syntax/angular.rs:57-78 \u2014 both copies are in the same file, so extract the block into one function there 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/biome_html_parser/src/syntax/angular.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"907a23bbd89d0ddf841bf318075b6b8807a35290ca5bb0baa313126cc8cd2c04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201322 lines \u00D7 2): crates/biome_html_parser/src/syntax/astro.rs:68-89 | crates/biome_html_parser/src/syntax/svelte.rs:381-400 \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/biome_html_parser/src/syntax/astro.rs:68\u0060 it begins part-way through the construct above it, so those exact 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/biome_html_parser/src/syntax/astro.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"541458419933e971e6110f77eb9f271d58ae103aaa8aed076ba1e9cc9a3a2867"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/no_confusing_array_splice.rs:315-336 | crates/biome_js_analyze/src/lint/nursery/no_useless_splice.rs:442-463 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_confusing_array_splice.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c91bc67168211ed5a5d36cc732f07910670822f5881c29a138211a89730c0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201322 lines \u00D7 2): crates/biome_js_parser/src/syntax/class.rs:2571-2584 | crates/biome_js_parser/src/syntax/class.rs:2613-2634 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_js_parser/src/syntax/class.rs:2571\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_parser/src/syntax/class.rs"},"region":{"startLine":2571}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d5bc2aa681510ad9ab37b6a8504a87ba7a437fc8e232f7f6b185a2266b09dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201322 lines \u00D7 2): crates/biome_js_type_info/src/format_inferred_type_info.rs:480-497 | crates/biome_js_type_info/src/format_type_info.rs:400-421 \u2014 before extracting anything, compare \u0060crates/biome_js_type_info/src/format_inferred_type_info.rs\u0060 and \u0060crates/biome_js_type_info/src/format_type_info.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 242 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/biome_js_type_info/src/format_inferred_type_info.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bcabfe7625309a7f9fac68dab06cdccb8c88efc2cd5b797ca2e3ed615b473b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): crates/biome_json_analyze/src/lint/suspicious/no_duplicate_dependencies.rs:176-197 | crates/biome_json_analyze/src/lint/suspicious/no_duplicate_dependencies.rs:208-228 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_json_analyze/src/lint/suspicious/no_duplicate_dependencies.rs:176\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/biome_json_analyze/src/lint/suspicious/no_duplicate_dependencies.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e7d1a3953806065678c651b835dee11114eb7dea80695843274e1209ff3111"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/biome_project_layout/src/project_layout.rs:181-202 | crates/biome_project_layout/src/project_layout.rs:219-240 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_project_layout/src/project_layout.rs:181\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_project_layout/src/project_layout.rs:217\u0060 calls \u0060default\u0060, \u0060Some\u0060, \u0060clone\u0060 and \u0060crates/biome_project_layout/src/project_layout.rs:180\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/biome_project_layout/src/project_layout.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc492f21c764b2eeea0891a17ae18b61bd4e902b3f3731b3605e436dda4c60fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): crates/biome_service/src/file_handlers/css.rs:995-1016 | crates/biome_service/src/file_handlers/json.rs:926-946 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/css.rs\u0060 and \u0060crates/biome_service/src/file_handlers/json.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 278 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_service/src/file_handlers/css.rs:995\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/biome_service/src/file_handlers/css.rs"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ce501fd6b2cd3bd71ef142b048a7a1ebae01c5c6575a24ac634557ae1b665c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/biome_service/src/workspace_types.rs:123-144 | crates/biome_service/src/workspace_types.rs:645-666 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/workspace_types.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"485cd4e74e840110b1c37d105756c0ca9c05423872b89513356c96285a13993c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 4): crates/biome_html_parser/src/lexer/mod.rs:1899-1919 | crates/biome_js_parser/src/lexer/mod.rs:250-270 | crates/biome_markdown_parser/src/lexer/mod.rs:197-217 | crates/biome_tailwind_parser/src/lexer/mod.rs:664-684 \u2014 before extracting anything, compare \u0060crates/biome_html_parser/src/lexer/mod.rs\u0060 and \u0060crates/biome_tailwind_parser/src/lexer/mod.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_parser/src/lexer/mod.rs"},"region":{"startLine":1899}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd7b5fbc4a9ca56f9b2b15378b466fe14797f66af9a0936fe9320b5d16a8e12e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 3): crates/biome_cli/src/execute/migrate.rs:259-279 | crates/biome_cli/src/execute/migrate.rs:339-359 | crates/biome_cli/src/execute/migrate.rs:424-444 \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/biome_cli/src/execute/migrate.rs:259\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_cli/src/execute/migrate.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a6af62aa1297797d90de858f42ea54a8ba50a64710d644d6464c771584a924"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201321 lines \u00D7 3): crates/biome_js_parser/src/syntax/class.rs:2572-2584 | crates/biome_js_parser/src/syntax/class.rs:2614-2634 | crates/biome_js_parser/src/syntax/class.rs:2677-2690 \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/biome_js_parser/src/syntax/class.rs:2572\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_parser/src/syntax/class.rs"},"region":{"startLine":2572}}}],"partialFingerprints":{"codehealthFindingId/v1":"dceef7c30fd727dbd80cdfbea51246bd6f4fd62ce2ffbe2cd5a77bf4f5a27311"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/biome_css_analyze/src/lint/suspicious/no_duplicate_custom_properties.rs:60-80 | crates/biome_css_analyze/src/lint/suspicious/no_duplicate_properties.rs:59-79 \u2014 before extracting anything, compare \u0060crates/biome_css_analyze/src/lint/suspicious/no_duplicate_custom_properties.rs\u0060 and \u0060crates/biome_css_analyze/src/lint/suspicious/no_duplicate_properties.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_analyze/src/lint/suspicious/no_duplicate_custom_properties.rs:60\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_css_analyze/src/lint/suspicious/no_duplicate_custom_properties.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e4f6a27716c396a9b9cce4a9eb1daed7e0ac14e7a77c321097da35d91b0a2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/biome_css_parser/src/lexer/scan_cursor.rs:637-658 | crates/biome_css_parser/src/lexer/scan_cursor.rs:688-709 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_parser/src/lexer/scan_cursor.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"8999115087e677bd869709063fbac8beeb822515e6af405f8f11677788371dc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/biome_deserialize_macros/src/deserializable_derive/enum_variant_attrs.rs:37-57 | crates/biome_deserialize_macros/src/deserializable_derive/struct_field_attrs.rs:132-152 \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/biome_deserialize_macros/src/deserializable_derive/enum_variant_attrs.rs:37\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/biome_deserialize_macros/src/deserializable_derive/enum_variant_attrs.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf3c5793e2b109592fa486af3bf18f1cf8190dea32e1f090b253d8d4e5e684f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/biome_graphql_formatter/src/graphql/extensions/enum_type_extension.rs:14-34 | crates/biome_graphql_formatter/src/graphql/extensions/input_object_type_extension.rs:16-36 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_graphql_formatter/src/graphql/extensions/enum_type_extension.rs:14\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026GraphqlEnumTypeExtension\u0060 in one and \u0060\u0026GraphqlInputObjectTypeExtension\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/biome_graphql_formatter/src/graphql/extensions/enum_type_extension.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d2ea80d46ac0189049fc6b85ede0b0369308c72c813975cd7d502a984c7a7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/biome_html_analyze/src/lint/a11y/use_valid_aria_role.rs:96-116 | crates/biome_js_analyze/src/lint/a11y/use_valid_aria_role.rs:123-143 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_analyze/src/lint/a11y/use_valid_aria_role.rs:96\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/a11y/use_valid_aria_role.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb68a84dc49d241859965473a97410cf29c26b1feaf45b7b59c672168a1c99f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201321 lines \u00D7 2): crates/biome_html_analyze/src/lint/nursery/no_undeclared_classes.rs:102-122 | crates/biome_js_analyze/src/lint/nursery/no_undeclared_classes.rs:308-325 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_analyze/src/lint/nursery/no_undeclared_classes.rs:102\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060ctx\u0060 to \u0060\u0026RuleContext\u003CSelf\u003E\u0060 in one and \u0060\u0026RuleContext\u003CNoUndeclaredClasses\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/nursery/no_undeclared_classes.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad0de537d9437a1f5efbdec0fdbce8c25e1a82d93dd43404ba170346ded914b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/biome_js_analyze/src/lint/a11y/use_button_type.rs:123-143 | crates/biome_js_analyze/src/lint/a11y/use_button_type.rs:145-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. 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/biome_js_analyze/src/lint/a11y/use_button_type.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c6556b8ec21dbe8b2e313fb007f0616cf7d936a9f9236e60eef621fcb3ddebe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/biome_js_analyze/src/lint/correctness/no_invalid_builtin_instantiation.rs:140-160 | crates/biome_js_analyze/src/lint/style/use_consistent_builtin_instantiation.rs:148-168 \u2014 before extracting anything, compare \u0060crates/biome_js_analyze/src/lint/correctness/no_invalid_builtin_instantiation.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/style/use_consistent_builtin_instantiation.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/correctness/no_invalid_builtin_instantiation.rs:140\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/no_invalid_builtin_instantiation.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"264867eb694d1d77fe50c0faa9929b1bc162623dddce6c4da9de5361c3a6fd86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/use_react_function_component_definition.rs:346-379 | crates/biome_js_analyze/src/lint/nursery/use_react_function_component_definition.rs:435-468 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/nursery/use_react_function_component_definition.rs:346\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/biome_js_analyze/src/lint/nursery/use_react_function_component_definition.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a8a4186c48abb1bfd64fff03b1c3825cc09e0de9c68e256846d3444368066e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201321 lines \u00D7 2): crates/biome_js_formatter/src/js/auxiliary/module.rs:15-30 | crates/biome_js_formatter/src/ts/auxiliary/declaration_module.rs:14-34 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_formatter/src/js/auxiliary/module.rs:15\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026JsModule\u0060 in one and \u0060\u0026TsDeclarationModule\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/biome_js_formatter/src/js/auxiliary/module.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"19155932d7327435e4191dc3e82cae83d96c74add4869d792bf04c1a84d58b58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/biome_js_formatter/src/js/module/export_named_specifier.rs:13-33 | crates/biome_js_formatter/src/js/module/named_import_specifier.rs:13-33 \u2014 before extracting anything, compare \u0060crates/biome_js_formatter/src/js/module/export_named_specifier.rs\u0060 and \u0060crates/biome_js_formatter/src/js/module/named_import_specifier.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_formatter/src/js/module/export_named_specifier.rs:13\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026JsExportNamedSpecifier\u0060 in one and \u0060\u0026JsNamedImportSpecifier\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/biome_js_formatter/src/js/module/export_named_specifier.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"758fb9f6b9d4305a2b5123a2eb190edc239ac15757b69bc7a8373f772a6f47ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/biome_js_formatter/src/jsx/attribute/spread_attribute.rs:64-84 | crates/biome_js_formatter/src/jsx/auxiliary/spread_child.rs:62-82 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_formatter/src/jsx/attribute/spread_attribute.rs:64\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/biome_js_formatter/src/jsx/attribute/spread_attribute.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ddbb4ebb544e5627d60f25b7eda0128aa0c542ff4ea31aed945a27695702ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/biome_js_parser/src/lexer/mod.rs:1422-1442 | crates/biome_js_parser/src/lexer/mod.rs:1468-1488 \u2014 both copies are in the same file, so extract the block into one function there 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/biome_js_parser/src/lexer/mod.rs"},"region":{"startLine":1422}}}],"partialFingerprints":{"codehealthFindingId/v1":"3751215ab2846c06349bdecf5a1108f176188aea380e160b8514720a69b7d879"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): crates/biome_js_type_info/src/format_inferred_type_info.rs:530-549 | crates/biome_js_type_info/src/format_type_info.rs:840-860 \u2014 before extracting anything, compare \u0060crates/biome_js_type_info/src/format_inferred_type_info.rs\u0060 and \u0060crates/biome_js_type_info/src/format_type_info.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 242 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_type_info/src/format_inferred_type_info.rs:530\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060\u0026mut Formatter\u003CFormatInferredTypeContext\u003C\u0027db\u003E\u003E\u0060 in one and \u0060\u0026mut Formatter\u003CFormatTypeContext\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/format_inferred_type_info.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c619340f5bf8bb2a946d7afb3c4e5587c7c03fc1a9c8ac9140b6de743bd029"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/biome_js_type_info/src/local_inference.rs:3787-3807 | xtask/codegen/src/generate_global_types/lower/generic.rs:1376-1396 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/local_inference.rs"},"region":{"startLine":3787}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c752fa70468a7bd6aa74ecd7ec460cd46a1076d7f817044263874944cc7d6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): crates/biome_markdown_formatter/src/bullet_list.rs:899-919 | crates/biome_markdown_formatter/src/bullet_list.rs:990-1009 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_markdown_formatter/src/bullet_list.rs:899\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_markdown_formatter/src/bullet_list.rs"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"5306a790114d1005b4db2bf867538a30310e39e057138a0f1b8245467d21933a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/biome_markdown_parser/src/syntax/list.rs:3142-3162 | crates/biome_markdown_parser/src/syntax/mod.rs:634-654 \u2014 before extracting anything, compare \u0060crates/biome_markdown_parser/src/syntax/list.rs\u0060 and \u0060crates/biome_markdown_parser/src/syntax/mod.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 59 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/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":3142}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea7faaf9415901233042509a5f24536e170d210a87d2427d261f4141d1361e27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201321 lines \u00D7 2): crates/biome_markdown_parser/src/syntax/list.rs:3250-3270 | crates/biome_markdown_parser/src/syntax/list.rs:3358-3374 \u2014 both copies are in the same file, so extract the block into one function there 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/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":3250}}}],"partialFingerprints":{"codehealthFindingId/v1":"99fd14538982df060eaf323cc9eb217a05569b0d1037cdbbea179c660bedd36e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/biome_module_graph/src/db/type_inference/expressions.rs:2992-3012 | crates/biome_module_graph/src/db/type_inference/expressions.rs:3074-3094 \u2014 both copies are in the same file, so extract the block into one function there 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/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":2992}}}],"partialFingerprints":{"codehealthFindingId/v1":"7109e388bf7f75900f7fd9cb8e4f8d4ff030b120b1ae2553c7d5c56af3897a7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/biome_module_graph/src/format_module_graph.rs:78-98 | crates/biome_module_graph/src/format_module_graph.rs:114-134 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_module_graph/src/format_module_graph.rs:78\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_module_graph/src/format_module_graph.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"caa447e057c41647fd6d327b0d4891e10e57d7a86354a310ebf4aa15977e562f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/biome_service/src/file_handlers/css.rs:730-750 | crates/biome_service/src/file_handlers/json.rs:675-695 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/css.rs\u0060 and \u0060crates/biome_service/src/file_handlers/json.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 278 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_service/src/file_handlers/css.rs:730\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/biome_service/src/file_handlers/css.rs"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"09989cdecc7a81375063110de2bdb855ad29cae6de6cbab33d100cb2691cd7fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): crates/biome_service/src/file_handlers/css.rs:935-955 | crates/biome_service/src/file_handlers/json.rs:879-898 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/css.rs\u0060 and \u0060crates/biome_service/src/file_handlers/json.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 278 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_service/src/file_handlers/css.rs:935\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/biome_service/src/file_handlers/css.rs"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d7d2175051d901e2c9a028c9ab0cc90aaa7c7a6a88b4459f590c87401f6f14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 7): crates/biome_service/src/file_handlers/css.rs:961-978 | crates/biome_service/src/file_handlers/graphql.rs:761-778 | crates/biome_service/src/file_handlers/html.rs:1454-1471 | crates/biome_service/src/file_handlers/javascript.rs:1644-1663 | crates/biome_service/src/file_handlers/json.rs:903-920 | crates/biome_service/src/file_handlers/md.rs:798-815 | crates/biome_service/src/file_handlers/yaml.rs:656-673 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/css.rs\u0060 and \u0060crates/biome_service/src/file_handlers/graphql.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 202 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_service/src/file_handlers/css.rs:961\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/biome_service/src/file_handlers/javascript.rs:1665\u0060 calls \u0060js_analyzer_services_for_fix\u0060 and \u0060crates/biome_service/src/file_handlers/md.rs:818\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/biome_service/src/file_handlers/css.rs"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"20b36523d4ec938a9ea74a93d6ccf9620df638c194ba11c873f5ec56abe9f77c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 3): crates/biome_service/src/file_handlers/css.rs:794-812 | crates/biome_service/src/file_handlers/html.rs:1282-1300 | crates/biome_service/src/file_handlers/javascript.rs:1480-1499 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/css.rs\u0060 and \u0060crates/biome_service/src/file_handlers/html.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 156 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/css.rs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"d113c95b703481e4361402518eac07ace6cd5d0ac583efab8129eb64f5d583b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/biome_cli/src/commands/check.rs:297-316 | crates/biome_cli/src/commands/ci.rs:218-237 \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/biome_cli/src/commands/check.rs:297\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/biome_cli/src/commands/check.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"f37ca45ef92aacf4be3a07dec21a90e0301f4754142169b14553d6c4597d05f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 2): crates/biome_cli/src/service/unix.rs:180-199 | crates/biome_cli/src/service/windows.rs:79-96 \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/biome_cli/src/service/unix.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ca29699ce1d1743adcc1223e31c3f70863360720850b939f3f28b2fb545076"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/biome_graphql_formatter/src/graphql/lists/argument_definition_list.rs:14-33 | crates/biome_graphql_formatter/src/graphql/lists/argument_list.rs:10-29 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026GraphqlArgumentDefinitionList\u0060 in one and \u0060\u0026GraphqlArgumentList\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/biome_graphql_formatter/src/graphql/lists/argument_definition_list.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"0355999c2d650a76ccaa74fe327258ac8c5ce29683ecee60fa79b5ead023f208"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/biome_grit_parser/src/lexer/mod.rs:415-434 | crates/biome_json_parser/src/lexer/mod.rs:459-478 \u2014 before extracting anything, compare \u0060crates/biome_grit_parser/src/lexer/mod.rs\u0060 and \u0060crates/biome_json_parser/src/lexer/mod.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 260 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_grit_parser/src/lexer/mod.rs:415\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/biome_grit_parser/src/lexer/mod.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"5992d0bedd7de7130082c50a5f57c38fd624ca471e94d2c635994a68abd372c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/biome_grit_parser/src/lexer/mod.rs:453-472 | crates/biome_json_parser/src/lexer/mod.rs:504-523 \u2014 before extracting anything, compare \u0060crates/biome_grit_parser/src/lexer/mod.rs\u0060 and \u0060crates/biome_json_parser/src/lexer/mod.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 260 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_grit_parser/src/lexer/mod.rs:453\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/biome_grit_parser/src/lexer/mod.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"467f067f47fe3f64208d1b4d1a74a250507ff7ca9e88a070ab13b97098b690ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): crates/biome_grit_parser/src/lexer/mod.rs:569-588 | crates/biome_json_parser/src/lexer/mod.rs:641-659 \u2014 before extracting anything, compare \u0060crates/biome_grit_parser/src/lexer/mod.rs\u0060 and \u0060crates/biome_json_parser/src/lexer/mod.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 260 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_grit_parser/src/lexer/mod.rs:569\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/biome_grit_parser/src/lexer/mod.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6e07ee69dde36094719b95610d3cd52d9554bbd4ccf8930a54e37704103a2ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/biome_html_analyze/src/lib.rs:308-327 | crates/biome_markdown_analyze/src/lib.rs:184-203 \u2014 before extracting anything, compare \u0060crates/biome_html_analyze/src/lib.rs\u0060 and \u0060crates/biome_markdown_analyze/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_analyze/src/lib.rs:308\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_html_analyze/src/lib.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"d558fffb61d5d6da7fee3c554eafc400a3828590e1bdaf31333bc905d9bded6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/biome_html_analyze/src/lint/nursery/no_unsafe_iframe_sandbox.rs:60-79 | crates/biome_js_analyze/src/lint/nursery/no_unsafe_iframe_sandbox.rs:61-80 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_analyze/src/lint/nursery/no_unsafe_iframe_sandbox.rs:60\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/nursery/no_unsafe_iframe_sandbox.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"002daebb656da61d2988a7d4c0ee1b83fdc7a94a2279f1363d2150f0998e79ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): crates/biome_html_parser/src/lexer/mod.rs:137-156 | crates/biome_html_parser/src/lexer/mod.rs:197-215 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_html_parser/src/lexer/mod.rs:137\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_html_parser/src/lexer/mod.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14ba864f94f57f0ebc5974e29461a31af43d38e5328005cda2b9a6908e5c9fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/biome_js_analyze/src/lint/correctness/no_nodejs_modules.rs:58-77 | crates/biome_js_analyze/src/lint/nursery/no_bun_modules.rs:54-73 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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/biome_js_analyze/src/lint/correctness/no_nodejs_modules.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"43fc80af66882fd1fcb7779bba2d191b95a0b92bb410f597c682b9d1582722d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): crates/biome_js_analyze/src/lint/style/use_import_type.rs:557-576 | crates/biome_js_analyze/src/lint/style/use_import_type.rs:696-714 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_js_analyze/src/lint/style/use_import_type.rs:557\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_import_type.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"e45bf2ef2f121a8f4ce466a58e40a1d2e0ce51f0aff0eaaadbd1f7b7afefec0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/biome_js_formatter/src/ts/classes/getter_signature_class_member.rs:18-37 | crates/biome_js_formatter/src/ts/classes/setter_signature_class_member.rs:18-37 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_formatter/src/ts/classes/getter_signature_class_member.rs:18\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026TsGetterSignatureClassMember\u0060 in one and \u0060\u0026TsSetterSignatureClassMember\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/biome_js_formatter/src/ts/classes/setter_signature_class_member.rs:38\u0060 calls \u0060format\u0060 and \u0060crates/biome_js_formatter/src/ts/classes/getter_signature_class_member.rs:38\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/ts/classes/getter_signature_class_member.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8052cb8b0a836c7f138937591239675aebba35c2681bd56e301513ad81b584b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): crates/biome_js_type_info/src/local_inference.rs:2234-2252 | crates/biome_js_type_info/src/local_inference.rs:2264-2283 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_js_type_info/src/local_inference.rs:2234\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_js_type_info/src/local_inference.rs"},"region":{"startLine":2234}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac837d70bad236b34b4a764aed0579b766c5680bd0eac7ec01e0ae3cfdd96b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201320 lines \u00D7 2): crates/biome_markdown_formatter/src/markdown/auxiliary/inline_emphasis.rs:28-44 | crates/biome_markdown_formatter/src/markdown/auxiliary/inline_link.rs:25-44 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_markdown_formatter/src/markdown/auxiliary/inline_emphasis.rs:28\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_formatter/src/markdown/auxiliary/inline_emphasis.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ddfd2b28744ca1d1742ec5d8c314b26c01447fa87bd32465da1b704fdc34e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 2): crates/biome_markdown_parser/src/to_html.rs:265-284 | crates/biome_ruledoc/src/lower.rs:160-177 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_markdown_parser/src/to_html.rs:265\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/biome_markdown_parser/src/to_html.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7e28d38cf0637242f61390666b6972eb70d079095ee6a56ba5dffc138f3b6ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/biome_module_graph/src/db/queries.rs:50-69 | crates/biome_module_graph/src/db/queries.rs:149-168 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_module_graph/src/db/queries.rs:50\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/queries.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"89821315f4c74a91e512efbcdfe2eb56c80f871f385db8ab290a880b9bf6fd85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 6): crates/biome_service/src/file_handlers/css.rs:785-803 | crates/biome_service/src/file_handlers/graphql.rs:641-659 | crates/biome_service/src/file_handlers/html.rs:1273-1291 | crates/biome_service/src/file_handlers/javascript.rs:1471-1489 | crates/biome_service/src/file_handlers/md.rs:675-693 | crates/biome_service/src/file_handlers/yaml.rs:538-556 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/css.rs\u0060 and \u0060crates/biome_service/src/file_handlers/graphql.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 202 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/biome_service/src/file_handlers/graphql.rs:663\u0060 calls \u0060diagnostic_offset\u0060 and \u0060crates/biome_service/src/file_handlers/md.rs:697\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/biome_service/src/file_handlers/css.rs"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b6da3a0c1350d6fb705188d3db37e8b91db40ec5dd0ee3e205397f34be9ff5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 5): crates/biome_service/src/file_handlers/astro.rs:94-112 | crates/biome_service/src/file_handlers/graphql.rs:382-399 | crates/biome_service/src/file_handlers/grit.rs:320-337 | crates/biome_service/src/file_handlers/svelte.rs:124-142 | crates/biome_service/src/file_handlers/vue.rs:127-145 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/astro.rs\u0060 and \u0060crates/biome_service/src/file_handlers/svelte.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_service/src/file_handlers/astro.rs:94\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/biome_service/src/file_handlers/astro.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"f35d572a4c37fa05763459983a4131ddfa71577931ad477d32c133fc74f8f7a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 3): crates/biome_grit_formatter/src/grit/declarations/function_definition.rs:9-27 | crates/biome_grit_formatter/src/grit/declarations/javascript_function_definition.rs:14-31 | crates/biome_grit_formatter/src/grit/predicates/predicate_definition.rs:13-30 \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/biome_grit_formatter/src/grit/declarations/function_definition.rs:9\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026GritFunctionDefinition\u0060 in one and \u0060\u0026GritJavascriptFunctionDefinition\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/biome_grit_formatter/src/grit/declarations/function_definition.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba640d8bb727f261543c524b33fb8aa88a533894f0989fbfe4471beb6502da5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 3): crates/biome_js_analyze/src/lint/nursery/no_tanstack_query_void_query_fn.rs:347-363 | crates/biome_js_analyze/src/lint/nursery/use_vue_render_return.rs:160-177 | crates/biome_js_analyze/src/lint/suspicious/use_iterable_callback_return.rs:395-413 \u2014 before extracting anything, compare \u0060crates/biome_js_analyze/src/lint/nursery/no_tanstack_query_void_query_fn.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/nursery/use_vue_render_return.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/nursery/no_tanstack_query_void_query_fn.rs:347\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/nursery/no_tanstack_query_void_query_fn.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"379224255d3a87ad79d111a4730ba42c227a00fcabd83cc7732fb3fa9df93bc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 3): crates/biome_service/src/workspace/server.rs:3338-3356 | crates/biome_service/src/workspace/server.rs:4183-4200 | crates/biome_service/src/workspace/server.rs:4224-4242 \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/biome_service/src/workspace/server.rs:3338\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060params\u0060 to \u0060GetFormatterIRParams\u0060 in one and \u0060FormatRangeParams\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/biome_service/src/workspace/server.rs"},"region":{"startLine":3338}}}],"partialFingerprints":{"codehealthFindingId/v1":"977a4f748e78b570a9b493292ab4cc4a84c1b467773bc619252c7754927e991e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/biome_css_analyze/src/suppression_action.rs:78-96 | crates/biome_html_analyze/src/suppression_action.rs:88-106 \u2014 before extracting anything, compare \u0060crates/biome_css_analyze/src/suppression_action.rs\u0060 and \u0060crates/biome_html_analyze/src/suppression_action.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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_analyze/src/suppression_action.rs:78\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_css_analyze/src/suppression_action.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"75514827d066e320405fbc50e46b91caf3a923a3b05fedf67ccd9ed629610ba1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): crates/biome_embeds/src/visitor.rs:1266-1284 | crates/biome_embeds/src/visitor.rs:1312-1329 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_embeds/src/visitor.rs:1266\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_embeds/src/visitor.rs"},"region":{"startLine":1266}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ce15f0dcaa80fb4982c52525c072102bf42aea65614b17e86594944c671b8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/biome_formatter/src/lib.rs:1847-1865 | crates/biome_formatter/src/lib.rs:1924-1942 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_formatter/src/lib.rs:1847\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_formatter/src/lib.rs"},"region":{"startLine":1847}}}],"partialFingerprints":{"codehealthFindingId/v1":"87cc6641974d183a4e319a63f7a88dc7558f932473061acb623d2760c9497ed6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/biome_grit_formatter/src/grit/patterns/pattern_and.rs:9-27 | crates/biome_grit_formatter/src/grit/predicates/predicate_rewrite.rs:10-28 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_grit_formatter/src/grit/patterns/pattern_and.rs:9\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026GritPatternAnd\u0060 in one and \u0060\u0026GritPredicateRewrite\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/biome_grit_formatter/src/grit/patterns/pattern_and.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ae2c81354d605b103f7cd9a7dc9e012eda67083ca2bf726f682034ad27c684"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/biome_grit_parser/src/lexer/mod.rs:530-548 | crates/biome_json_parser/src/lexer/mod.rs:583-601 \u2014 before extracting anything, compare \u0060crates/biome_grit_parser/src/lexer/mod.rs\u0060 and \u0060crates/biome_json_parser/src/lexer/mod.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 260 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_grit_parser/src/lexer/mod.rs:530\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_grit_parser/src/lexer/mod.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"e66a3368a375640fec294bb28d9761e4ca646e466b71d907fcaef20a71f421df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/biome_html_analyze/src/lint/a11y/no_label_without_control.rs:120-138 | crates/biome_js_analyze/src/lint/a11y/no_label_without_control.rs:132-150 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_analyze/src/lint/a11y/no_label_without_control.rs:120\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_html_analyze/src/lint/a11y/no_label_without_control.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d5441dbce92769e8a0d59866d8eff07ae3c8c5d86899c0104dfb8575b7a63d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): crates/biome_html_parser/src/syntax/mod.rs:1378-1396 | crates/biome_html_parser/src/syntax/mod.rs:1445-1462 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_html_parser/src/syntax/mod.rs:1378\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_html_parser/src/syntax/mod.rs"},"region":{"startLine":1378}}}],"partialFingerprints":{"codehealthFindingId/v1":"946eb1e75357e1478bd3fcef51c8d652002abbb792244519d62a07276ed12a68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/no_misleading_return_type/analysis.rs:43-61 | crates/biome_js_analyze/src/lint/nursery/no_misleading_return_type/analysis.rs:64-82 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/nursery/no_misleading_return_type/analysis.rs:43\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/biome_js_analyze/src/lint/nursery/no_misleading_return_type/analysis.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"0396afe02c882eb97732f8aa3aa1c5e99ca330ffd32ef5c4fc603452bb04c803"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/biome_js_analyze/src/lint/suspicious/no_drizzle_delete_without_where.rs:80-98 | crates/biome_js_analyze/src/lint/suspicious/no_drizzle_update_without_where.rs:80-98 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/suspicious/no_drizzle_delete_without_where.rs:80\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/biome_js_analyze/src/lint/suspicious/no_drizzle_delete_without_where.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc4f137fab72273b1147ced266147d9f7ee479f64b0598e944459697196b7a7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): crates/biome_js_analyze/src/lint/suspicious/use_adjacent_overload_signatures.rs:223-240 | crates/biome_js_analyze/src/lint/suspicious/use_adjacent_overload_signatures.rs:242-260 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/suspicious/use_adjacent_overload_signatures.rs:242\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/use_adjacent_overload_signatures.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31495f2f5286f6e7530c05f056ca3418efde07e3dd970c83b532b3ba7efc02b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/biome_js_type_info/src/format_inferred_type_info.rs:228-246 | crates/biome_js_type_info/src/format_type_info.rs:196-214 \u2014 before extracting anything, compare \u0060crates/biome_js_type_info/src/format_inferred_type_info.rs\u0060 and \u0060crates/biome_js_type_info/src/format_type_info.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 242 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_type_info/src/format_inferred_type_info.rs:228\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060\u0026mut Formatter\u003CFormatInferredTypeContext\u003C\u0027db\u003E\u003E\u0060 in one and \u0060\u0026mut Formatter\u003CFormatTypeContext\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/format_inferred_type_info.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"a60bdaafdd30593871c90ed6dda8ed399d145c17c22405f6dd350b9b089b775f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/biome_js_type_info/src/local_inference.rs:608-626 | crates/biome_js_type_info/src/local_inference.rs:632-650 \u2014 both copies are in the same file, so extract the block 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/biome_js_type_info/src/local_inference.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c333c2fbadc443cf44c92df55090db45cec40cd01e69464e3f4ef0ff37a4256"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/biome_js_type_info/src/local_inference.rs:2319-2337 | crates/biome_js_type_info/src/local_inference.rs:2390-2408 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_js_type_info/src/local_inference.rs:2319\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/biome_js_type_info/src/local_inference.rs"},"region":{"startLine":2319}}}],"partialFingerprints":{"codehealthFindingId/v1":"0230ce006af434527ee21cc104b8965843aeffaf4b511a0afeef3b7e6176cbf1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/biome_module_graph/src/db/type_inference/expressions.rs:2607-2625 | crates/biome_module_graph/src/db/type_inference/lookup.rs:927-945 \u2014 before extracting anything, compare \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs\u0060 and \u0060crates/biome_module_graph/src/db/type_inference/lookup.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 234 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/biome_module_graph/src/db/type_inference/lookup.rs:946\u0060 calls \u0060Extends\u0060, \u0060InstanceOf\u0060 and \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs:2626\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/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":2607}}}],"partialFingerprints":{"codehealthFindingId/v1":"067fc3c011078c545117be9dcbcd701a0c27f8f6fd90f61b1579168efccb3780"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): crates/biome_service/src/file_handlers/css.rs:831-849 | crates/biome_service/src/file_handlers/json.rs:786-803 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/css.rs\u0060 and \u0060crates/biome_service/src/file_handlers/json.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 278 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_service/src/file_handlers/css.rs:831\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/biome_service/src/file_handlers/css.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc4b82902300dffcf00a8d3ed1bc59c4be885927793daf7938e71203add49de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/biome_service/src/file_handlers/graphql.rs:571-589 | crates/biome_service/src/file_handlers/html.rs:1093-1111 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/graphql.rs\u0060 and \u0060crates/biome_service/src/file_handlers/html.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 213 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/biome_service/src/file_handlers/graphql.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"308ca22ccdd23a5f584e8873f7004627c30c13283e072d7decc17af60979cbe1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/biome_service/src/file_handlers/graphql.rs:592-610 | crates/biome_service/src/file_handlers/yaml.rs:492-510 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/graphql.rs\u0060 and \u0060crates/biome_service/src/file_handlers/yaml.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 236 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_service/src/file_handlers/graphql.rs:592\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060inspector\u0060 to \u0060Option\u003Cbiome_analyze::EmbeddedSignalInspector\u003C\u0027_, \u0027_\u003E\u003E\u0060 in one and \u0060Option\u003CEmbeddedSignalInspector\u003C\u0027_, \u0027_\u003E\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/graphql.rs"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"15cf533b318165f870767314f6ebf0861d9571afafc29c54bc03efd9ed6c074d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/biome_service/src/file_handlers/graphql.rs:792-810 | crates/biome_service/src/file_handlers/yaml.rs:687-705 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/graphql.rs\u0060 and \u0060crates/biome_service/src/file_handlers/yaml.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 236 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_service/src/file_handlers/graphql.rs:792\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/biome_service/src/file_handlers/graphql.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"4872a0035a09372e08470ee170c43444578dc62561373db5b81a7b4c10e3821e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 2): crates/biome_service/src/file_handlers/mod.rs:868-886 | crates/biome_service/src/file_handlers/mod.rs:913-929 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_service/src/file_handlers/mod.rs:868\u0060 it does not close everything it opens, so those exact 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/biome_service/src/file_handlers/mod.rs:887\u0060 calls \u0060saturating_sub\u0060 and \u0060crates/biome_service/src/file_handlers/mod.rs:930\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/mod.rs"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"545f46795865157aad58860add72d076bc2f99e7677bd869e264f734ac49d7ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/biome_service/src/workspace/server.rs:1694-1712 | crates/biome_service/src/workspace/server.rs:3855-3873 \u2014 both copies are in the same file, so extract the block into one function there 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/biome_service/src/workspace/server.rs"},"region":{"startLine":1694}}}],"partialFingerprints":{"codehealthFindingId/v1":"067d75a83240c959bf90e0655f8452f53f174702b29ca0275e455bdf37634feb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 4): crates/biome_css_analyze/src/suppression_action.rs:14-29 | crates/biome_graphql_analyze/src/suppression_action.rs:18-35 | crates/biome_html_analyze/src/suppression_action.rs:14-31 | crates/biome_yaml_analyze/src/suppression_action.rs:18-35 \u2014 before extracting anything, compare \u0060crates/biome_css_analyze/src/suppression_action.rs\u0060 and \u0060crates/biome_html_analyze/src/suppression_action.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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060token\u0060 to \u0060CssSyntaxToken\u0060 in one and \u0060GraphqlSyntaxToken\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/biome_css_analyze/src/suppression_action.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"56678491891d3b04f5bcf8ece9ae941cdda8c36195e2a6fc443f7567324fbf8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 4): crates/biome_js_analyze/src/lint/nursery/no_tanstack_query_void_query_fn.rs:346-361 | crates/biome_js_analyze/src/lint/nursery/use_vue_render_return.rs:159-174 | crates/biome_js_analyze/src/lint/suspicious/use_iterable_callback_return.rs:394-411 | crates/biome_js_analyze/src/utils/function_return.rs:36-53 \u2014 before extracting anything, compare \u0060crates/biome_js_analyze/src/lint/nursery/no_tanstack_query_void_query_fn.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/nursery/use_vue_render_return.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/nursery/no_tanstack_query_void_query_fn.rs:346\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_tanstack_query_void_query_fn.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c973dcec9e79594b6659b42f68fcb7d5ac2af2d64889d6594a00dd7cfdf4326"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 4): crates/biome_service/src/file_handlers/javascript.rs:1312-1328 | crates/biome_service/src/file_handlers/json.rs:642-659 | crates/biome_service/src/file_handlers/md.rs:580-597 | crates/biome_service/src/file_handlers/yaml.rs:472-489 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/javascript.rs\u0060 and \u0060crates/biome_service/src/file_handlers/json.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 176 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/biome_service/src/file_handlers/javascript.rs"},"region":{"startLine":1312}}}],"partialFingerprints":{"codehealthFindingId/v1":"20eb5f05a1ddd65e6dbff745839a896995f0ada18db12f768a2f8187e020e7ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): crates/biome_css_analyze/src/lint/style/no_excessive_lines_per_file.rs:137-154 | crates/biome_graphql_analyze/src/lint/style/no_excessive_lines_per_file.rs:137-154 | crates/biome_html_analyze/src/lint/style/no_excessive_lines_per_file.rs:137-154 \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/biome_css_analyze/src/lint/style/no_excessive_lines_per_file.rs:137\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/biome_css_analyze/src/lint/style/no_excessive_lines_per_file.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"901b4ed6a737952caaa819748bfa0be3a05d4f9345a7c9713262bd9b5dd7c732"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): crates/biome_css_parser/src/token_source.rs:78-95 | crates/biome_graphql_parser/src/token_source.rs:38-55 | crates/biome_html_parser/src/token_source.rs:304-321 \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/biome_css_parser/src/token_source.rs:78\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_css_parser/src/token_source.rs:73\u0060 calls \u0060effective_context\u0060 and \u0060crates/biome_html_parser/src/token_source.rs:299\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/biome_css_parser/src/token_source.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"debb04b692a9a568904e640c99bd988bff7217084f278dbe4b2e5b61784e38f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): crates/biome_service/src/file_handlers/json.rs:759-776 | crates/biome_service/src/file_handlers/md.rs:685-702 | crates/biome_service/src/file_handlers/yaml.rs:548-565 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/json.rs\u0060 and \u0060crates/biome_service/src/file_handlers/md.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 162 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_service/src/file_handlers/json.rs:759\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/biome_service/src/file_handlers/json.rs:757\u0060 calls \u0060clone\u0060 and \u0060crates/biome_service/src/file_handlers/md.rs:683\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/biome_service/src/file_handlers/json.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef90cafbf07341aa1be7528dad9ea2195a70ef4848cb9e7990dc799bcacf1ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/biome_analyze/src/lib.rs:466-483 | crates/biome_analyze/src/lib.rs:511-528 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_analyze/src/lib.rs:466\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_analyze/src/lib.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"85d123b6733614ed5b3891714965c99ea5c6a537c31cd333bff5244bafb02c87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/biome_cli/src/execute/migrate/eslint_to_biome.rs:94-111 | crates/biome_cli/src/execute/migrate/stylelint_to_biome.rs:86-103 \u2014 before extracting anything, compare \u0060crates/biome_cli/src/execute/migrate/eslint_to_biome.rs\u0060 and \u0060crates/biome_cli/src/execute/migrate/stylelint_to_biome.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_cli/src/execute/migrate/eslint_to_biome.rs:94\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/biome_cli/src/execute/migrate/eslint_to_biome.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b733ee20dfc19cf1a4d3f345c889109c051b2c0efe3b7921e003a60b6510af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/biome_cli/src/reporter/summary.rs:341-358 | crates/biome_cli/src/reporter/summary.rs:375-392 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_cli/src/reporter/summary.rs:341\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_cli/src/reporter/summary.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"b96cbce693b553a71f0bec9470278bdf157f8f5ebad5a708f238d570caff6be2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): crates/biome_configuration_macros/src/group_struct.rs:288-304 | crates/biome_configuration_macros/src/group_struct.rs:408-425 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_configuration_macros/src/group_struct.rs:288\u0060 it begins part-way through the construct above it, so those exact 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/biome_configuration_macros/src/group_struct.rs:427\u0060 calls \u0060set_recommended\u0060 and \u0060crates/biome_configuration_macros/src/group_struct.rs:307\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/biome_configuration_macros/src/group_struct.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a3cd2d66acb74429756c1c63aebab05516c10eac2702d95c04c1514e157ae3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/biome_css_analyze/src/lint/suspicious/no_useless_escape_in_string.rs:129-146 | crates/biome_js_analyze/src/lint/suspicious/no_useless_escape_in_string.rs:191-208 \u2014 before extracting anything, compare \u0060crates/biome_css_analyze/src/lint/suspicious/no_useless_escape_in_string.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/suspicious/no_useless_escape_in_string.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_analyze/src/lint/suspicious/no_useless_escape_in_string.rs:129\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/biome_css_analyze/src/lint/suspicious/no_useless_escape_in_string.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd71e387582f7531fcafad38597cdcda2b9ddad659e9dda1f060c07340c7f26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/biome_css_formatter/src/scss/statements/function_at_rule.rs:11-28 | crates/biome_css_formatter/src/scss/statements/mixin_at_rule.rs:11-28 \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/biome_css_formatter/src/scss/statements/function_at_rule.rs:11\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026ScssFunctionAtRule\u0060 in one and \u0060\u0026ScssMixinAtRule\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/biome_css_formatter/src/scss/statements/function_at_rule.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dfc67e4bf8d65f0e458c004a1f99c1ea16eae1c14ef1c185cd2b42f75ff74a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): crates/biome_css_parser/src/lexer/mod.rs:1262-1279 | crates/biome_tailwind_parser/src/lexer/mod.rs:733-749 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_parser/src/lexer/mod.rs"},"region":{"startLine":1262}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ae9047f6ca44c5e3e527798756c6bfb3e4a6fd9bd1726dd31eccb0d48dded0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/biome_formatter/src/lib.rs:1873-1890 | crates/biome_formatter/src/lib.rs:1951-1968 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_formatter/src/lib.rs:1873\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/biome_formatter/src/lib.rs"},"region":{"startLine":1873}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b3aac9e6fd4e7222676742d59d88c95bb4b13a3752d14462393779c3a8cd38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/biome_html_analyze/src/lint/a11y/use_aria_props_supported_by_role.rs:99-116 | crates/biome_js_analyze/src/lint/a11y/use_aria_props_supported_by_role.rs:100-117 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/a11y/use_aria_props_supported_by_role.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"c21d57f928d27bd52a09351682b6fab3b12308f86a92f008ee6b65daf6952180"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): crates/biome_html_analyze/src/lint/nursery/no_undeclared_custom_properties.rs:154-169 | crates/biome_js_analyze/src/lint/nursery/no_undeclared_custom_properties.rs:133-150 \u2014 before extracting anything, compare \u0060crates/biome_html_analyze/src/lint/nursery/no_undeclared_custom_properties.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/nursery/no_undeclared_custom_properties.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_analyze/src/lint/nursery/no_undeclared_custom_properties.rs:154\u0060 it does not close everything it opens, so those exact 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/biome_html_analyze/src/lint/nursery/no_undeclared_custom_properties.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e207f134c821862f623f5c00803e161ef840a5d3ef9954b4f94d9844dd419d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): crates/biome_html_analyze/src/lint/nursery/no_vue_deprecated_functional_template.rs:56-73 | crates/biome_html_analyze/src/lint/nursery/no_vue_root_v_if.rs:54-70 \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/biome_html_analyze/src/lint/nursery/no_vue_deprecated_functional_template.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d6315ca018ca2b7f2984bd25139fd0061f5d4c706866bae49fa19a957cc94c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201318 lines \u00D7 2): crates/biome_js_analyze/src/lint/complexity/no_playwright_useless_await.rs:226-243 | crates/biome_js_analyze/src/lint/complexity/no_playwright_useless_await.rs:263-276 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/complexity/no_playwright_useless_await.rs:226\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/complexity/no_playwright_useless_await.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"d66ef854ec6b8328d410f1aca3bf6eae082be787e79e2c89f2405229f9240249"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/biome_js_analyze/src/lint/correctness/no_unused_function_parameters.rs:231-248 | crates/biome_js_analyze/src/lint/correctness/no_unused_variables.rs:447-464 \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/biome_js_analyze/src/lint/correctness/no_unused_function_parameters.rs:231\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/biome_js_analyze/src/lint/correctness/no_unused_function_parameters.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4f6600f8a6840b066c18e1df7b611112931064c3e952e2ff807b22e3247fd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33\u201337 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/no_undeclared_classes.rs:388-420 | crates/biome_js_analyze/src/lint/nursery/no_undeclared_classes.rs:533-569 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/nursery/no_undeclared_classes.rs:388\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/biome_js_analyze/src/lint/nursery/no_undeclared_classes.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad781d7d743ccf3810da2a51233b7d97d2a3b5de39561c833c8b4c924cf265bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/biome_js_analyze/src/lint/style/use_export_type.rs:321-338 | crates/biome_js_analyze/src/lint/style/use_export_type.rs:355-372 \u2014 both copies are in the same file, so extract the block into one function there 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/biome_js_analyze/src/lint/style/use_export_type.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f131f79ed7f7fc5687e75d8fd2c4d283d56bb0a5d7ea9c6a739d3c6ce77f871"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/biome_js_formatter/src/js/declarations/for_variable_declaration.rs:13-30 | crates/biome_js_formatter/src/js/declarations/variable_declaration.rs:13-30 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_formatter/src/js/declarations/for_variable_declaration.rs:13\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026JsForVariableDeclaration\u0060 in one and \u0060\u0026JsVariableDeclaration\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/biome_js_formatter/src/js/declarations/for_variable_declaration.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"897143ce4a1ad4ff93b4c5b5b8cb37f0f7dc4176fcaaef2aa3212ce8c1300e62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): crates/biome_js_semantic/src/events.rs:908-923 | crates/biome_js_semantic/src/events.rs:928-945 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_semantic/src/events.rs:908\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_semantic/src/events.rs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"c76bc1554fb7c98651512764309846506780ee788febf8164715358c7a7b3985"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201318 lines \u00D7 2): crates/biome_js_type_info/src/format_inferred_type_info.rs:1176-1193 | crates/biome_js_type_info/src/format_type_info.rs:1054-1066 \u2014 before extracting anything, compare \u0060crates/biome_js_type_info/src/format_inferred_type_info.rs\u0060 and \u0060crates/biome_js_type_info/src/format_type_info.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 242 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060\u0026mut Formatter\u003CFormatInferredTypeContext\u003C\u0027db\u003E\u003E\u0060 in one and \u0060\u0026mut Formatter\u003CFormatTypeContext\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/format_inferred_type_info.rs"},"region":{"startLine":1176}}}],"partialFingerprints":{"codehealthFindingId/v1":"5998c8ae1a395f20e1c39867855a11e9e0f893401b6dbcd5748e74ac043cf4d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/biome_js_type_info/src/local_inference.rs:993-1010 | crates/biome_js_type_info/src/local_inference.rs:1024-1041 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_js_type_info/src/local_inference.rs:993\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060decl\u0060 to \u0060\u0026JsClassDeclaration\u0060 in one and \u0060\u0026JsClassExpression\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/biome_js_type_info/src/local_inference.rs"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"7349e362d2679a384babf020257ea652c32344fac525bf423fad9345d5e2775b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/biome_markdown_formatter/src/markdown/lists/inline_item_list.rs:736-753 | crates/biome_markdown_formatter/src/markdown/lists/inline_item_list.rs:763-780 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_markdown_formatter/src/markdown/lists/inline_item_list.rs:736\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/biome_markdown_formatter/src/markdown/lists/inline_item_list.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8e35341eaf98ccedb16915aed92a32ad7142bb915ad9587f7d3b992a1a15e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/biome_module_graph/src/db/type_inference/expressions.rs:2927-2944 | crates/biome_module_graph/src/db/type_inference/lookup.rs:939-956 \u2014 before extracting anything, compare \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs\u0060 and \u0060crates/biome_module_graph/src/db/type_inference/lookup.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 234 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/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":2927}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cec1ed99242e67be3927e2ab19d03276e44671b4270ef96ba99233c3b5725ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/biome_module_graph/src/db/type_inference/promise_classification.rs:849-866 | crates/biome_module_graph/src/db/type_inference/promise_classification.rs:977-994 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_module_graph/src/db/type_inference/promise_classification.rs:849\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_module_graph/src/db/type_inference/promise_classification.rs"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f0f32bf71f9baf263769181ac0516641ac0a2145b286171a3ff53ae85a3b5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/biome_rowan/src/syntax/token.rs:240-257 | crates/biome_rowan/src/syntax/token.rs:270-287 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_rowan/src/syntax/token.rs:240\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_rowan/src/syntax/token.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"048487be338fa2df00381b45e258ebe106b6edd38fa15a164611f5b9bfe1eb07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/biome_service/src/file_handlers/graphql.rs:370-387 | crates/biome_service/src/file_handlers/json.rs:439-456 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/graphql.rs\u0060 and \u0060crates/biome_service/src/file_handlers/json.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 228 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_service/src/file_handlers/graphql.rs:370\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_service/src/file_handlers/graphql.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b09794088cec76612b3267c9f4a93a9ddeafca42e0043db50d666c0896a8985"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): crates/biome_service/src/workspace/server.rs:3890-3906 | crates/biome_service/src/workspace/server.rs:4033-4050 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_service/src/workspace/server.rs:3890\u0060 it does not close everything it opens, so those exact 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/biome_service/src/workspace/server.rs"},"region":{"startLine":3890}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ef5b13b43a025ae21314463b3ab900a7744d9a4784e85f7d8cdef5c7ea2add"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/biome_syntax_codegen/src/generate_nodes.rs:362-379 | xtask/codegen/src/generate_nodes.rs:392-409 \u2014 before extracting anything, compare \u0060crates/biome_syntax_codegen/src/generate_nodes.rs\u0060 and \u0060xtask/codegen/src/generate_nodes.rs\u0060 as WHOLE FILES: this scan already matched 26 separate duplicated blocks between them, totalling at least 933 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_syntax_codegen/src/generate_nodes.rs:362\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_syntax_codegen/src/generate_nodes.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d19ebc05e5f157ee9ad5f7b10bfc730214d89e0e49300a8421c8437c2c01d0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/biome_vue_semantic/src/semantic_model/component.rs:1458-1475 | crates/biome_vue_semantic/src/semantic_model/component.rs:1518-1535 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_vue_semantic/src/semantic_model/component.rs:1458\u0060 it does not close everything it opens, so those exact 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/biome_vue_semantic/src/semantic_model/component.rs"},"region":{"startLine":1458}}}],"partialFingerprints":{"codehealthFindingId/v1":"0419a8a69e30fc1e17b775f57a8987414b9b7ca4e4e1c85a080ee73459b87e80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201318 lines \u00D7 2): crates/biome_yaml_parser/src/lexer/mod.rs:1245-1262 | crates/biome_yaml_parser/src/lexer/mod.rs:1268-1282 \u2014 both copies are in the same file, so extract the block into one function there 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/biome_yaml_parser/src/lexer/mod.rs"},"region":{"startLine":1245}}}],"partialFingerprints":{"codehealthFindingId/v1":"987c8fa8d0a511e7af01afbf81c5011e6ac5367038b47e53d77b61a2c2435d91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201317 lines \u00D7 10): crates/biome_css_formatter/src/css/pseudo/pseudo_class_function_compound_selector_list.rs:26-42 | crates/biome_css_formatter/src/css/pseudo/pseudo_class_function_custom_identifier.rs:26-39 | crates/biome_css_formatter/src/css/pseudo/pseudo_class_function_nth.rs:22-35 | crates/biome_css_formatter/src/css/pseudo/pseudo_class_function_relative_selector_list.rs:26-42 | crates/biome_css_formatter/src/css/pseudo/pseudo_class_function_selector_list.rs:26-39 | crates/biome_css_formatter/src/css/pseudo/pseudo_class_function_value_list.rs:22-34 | crates/biome_css_formatter/src/css/pseudo/pseudo_element_function_custom_identifier.rs:26-39 | crates/biome_css_formatter/src/css/selectors/pseudo_class_function_compound_selector.rs:26-39 | crates/biome_css_formatter/src/css/selectors/pseudo_class_function_selector.rs:22-35 | crates/biome_css_formatter/src/css/selectors/pseudo_element_function_selector.rs:22-35 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 10 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 10 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_formatter/src/css/pseudo/pseudo_class_function_compound_selector_list.rs:26\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/biome_css_formatter/src/css/pseudo/pseudo_class_function_compound_selector_list.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"121832af916c5f45ad2cfda8f73cc7fbf92303383076fbb578f96b9d6becb412"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 5): crates/biome_css_formatter/src/verbatim.rs:245-261 | crates/biome_graphql_formatter/src/verbatim.rs:161-177 | crates/biome_grit_formatter/src/verbatim.rs:160-176 | crates/biome_js_formatter/src/verbatim.rs:160-176 | crates/biome_json_formatter/src/verbatim.rs:159-175 \u2014 before extracting anything, compare \u0060crates/biome_css_formatter/src/verbatim.rs\u0060 and \u0060crates/biome_graphql_formatter/src/verbatim.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 150 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_formatter/src/verbatim.rs:245\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060\u0026mut Formatter\u003CCssFormatContext\u003E\u0060 in one and \u0060\u0026mut Formatter\u003CGraphqlFormatContext\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_formatter/src/verbatim.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"21c72b015475491971beafd129c1ad39fe2710e3cc05ef6910a66c5963869d55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 4): crates/biome_js_type_info/src/format_inferred_type_info.rs:1090-1103 | crates/biome_js_type_info/src/format_inferred_type_info.rs:1111-1127 | crates/biome_js_type_info/src/format_type_info.rs:1077-1090 | crates/biome_js_type_info/src/format_type_info.rs:1099-1115 \u2014 before extracting anything, compare \u0060crates/biome_js_type_info/src/format_inferred_type_info.rs\u0060 and \u0060crates/biome_js_type_info/src/format_type_info.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 242 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_type_info/src/format_inferred_type_info.rs:1090\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060\u0026mut Formatter\u003CFormatInferredTypeContext\u003C\u0027db\u003E\u003E\u0060 in one and \u0060\u0026mut Formatter\u003CFormatTypeContext\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/format_inferred_type_info.rs"},"region":{"startLine":1090}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5090566d4c346fa374688c2beb08ca2feb4576cf450db9fe1ef274c7c129832"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 4): crates/biome_service/src/file_handlers/css.rs:794-810 | crates/biome_service/src/file_handlers/html.rs:1282-1298 | crates/biome_service/src/file_handlers/javascript.rs:1480-1495 | crates/biome_service/src/file_handlers/javascript.rs:2032-2048 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/css.rs\u0060 and \u0060crates/biome_service/src/file_handlers/html.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 156 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_service/src/file_handlers/css.rs:794\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/css.rs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"06819806fdb8bbd15fb7480639cb3012b32d2ceec9fe495a71e3ff41a3e00b55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 3): crates/biome_css_formatter/src/css/auxiliary/container_style_query_in_parens.rs:20-33 | crates/biome_css_formatter/src/css/auxiliary/if_function.rs:17-33 | crates/biome_css_formatter/src/css/auxiliary/import_named_layer.rs:16-29 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_formatter/src/css/auxiliary/container_style_query_in_parens.rs:20\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/biome_css_formatter/src/css/auxiliary/container_style_query_in_parens.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c47c168beee4266dedefbcc15624fba4cdc0e935ca26a9f331142a2e47ed73f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 3): crates/biome_css_formatter/src/scss/statements/forward_at_rule.rs:13-29 | crates/biome_css_formatter/src/scss/statements/use_at_rule.rs:12-28 | crates/biome_css_formatter/src/tailwind/statements/plugin_at_rule.rs:10-25 \u2014 before extracting anything, compare \u0060crates/biome_css_formatter/src/scss/statements/forward_at_rule.rs\u0060 and \u0060crates/biome_css_formatter/src/scss/statements/use_at_rule.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_formatter/src/scss/statements/forward_at_rule.rs:13\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026ScssForwardAtRule\u0060 in one and \u0060\u0026ScssUseAtRule\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/biome_css_formatter/src/scss/statements/forward_at_rule.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"299e9b35fd19d91edb5fe38a2b4e14732add711f217d2569ad569b5bd4469175"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201317 lines \u00D7 3): crates/biome_grit_formatter/src/grit/patterns/pattern_definition.rs:12-27 | crates/biome_js_formatter/src/js/module/export_from_clause.rs:16-26 | crates/biome_js_formatter/src/ts/declarations/enum_declaration.rs:12-28 \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/biome_grit_formatter/src/grit/patterns/pattern_definition.rs:12\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060\u0026mut GritFormatter\u0060 in one and \u0060\u0026mut JsFormatter\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/biome_grit_formatter/src/grit/patterns/pattern_definition.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca3e74d6ffd4b5d741a7417501975e9705a033f3e6ae35dae0ebf81f3dc39b37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): crates/biome_grit_patterns/src/grit_target_language/css_target_language.rs:90-106 | crates/biome_grit_patterns/src/grit_target_language/js_target_language.rs:144-160 | crates/biome_grit_patterns/src/grit_target_language/json_target_language.rs:103-119 \u2014 before extracting anything, compare \u0060crates/biome_grit_patterns/src/grit_target_language/js_target_language.rs\u0060 and \u0060crates/biome_grit_patterns/src/grit_target_language/json_target_language.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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/biome_grit_patterns/src/grit_target_language/css_target_language.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ef111ebd6c4dd71763264c87d1b359de0f20578b505e2f2dccf66ab2f78676"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): crates/biome_html_analyze/src/lint/correctness/use_vue_valid_v_cloak.rs:69-85 | crates/biome_html_analyze/src/lint/correctness/use_vue_valid_v_once.rs:70-86 | crates/biome_html_analyze/src/lint/correctness/use_vue_valid_v_pre.rs:70-86 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_analyze/src/lint/correctness/use_vue_valid_v_cloak.rs:69\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/correctness/use_vue_valid_v_cloak.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"84c7193eff02e841ef869320bb57abbb22449148150180c759aa4825158bbdde"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): crates/biome_js_formatter/src/js/objects/getter_object_member.rs:13-29 | crates/biome_js_formatter/src/ts/auxiliary/getter_signature_type_member.rs:17-33 | crates/biome_js_formatter/src/ts/auxiliary/setter_signature_type_member.rs:18-34 \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/biome_js_formatter/src/js/objects/getter_object_member.rs:13\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026JsGetterObjectMember\u0060 in one and \u0060\u0026TsGetterSignatureTypeMember\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/biome_js_formatter/src/ts/auxiliary/setter_signature_type_member.rs:35\u0060 calls \u0060format\u0060 and \u0060crates/biome_js_formatter/src/ts/auxiliary/getter_signature_type_member.rs:34\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/js/objects/getter_object_member.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3f434503cabdbccd1794ecf3daa1b29b973b36322234e9fc35abf00cb1ef86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): crates/biome_service/src/file_handlers/graphql.rs:222-238 | crates/biome_service/src/file_handlers/html.rs:397-413 | crates/biome_service/src/file_handlers/md.rs:159-175 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/graphql.rs\u0060 and \u0060crates/biome_service/src/file_handlers/html.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 213 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_service/src/file_handlers/html.rs:396\u0060 calls \u0060to_html_file_source\u0060, \u0060unwrap_or_default\u0060 and \u0060crates/biome_service/src/file_handlers/graphql.rs:221\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/graphql.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fbefc1e443077aed0366066f4dd4dc0a254de30b78f6bad9fc0ffc7f0858280"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/biome_analyze/src/diagnostics.rs:458-474 | crates/biome_analyze/src/diagnostics.rs:493-509 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_analyze/src/diagnostics.rs:458\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060fmt\u0060 to \u0060\u0026mut std::fmt::Formatter\u0060 in one and \u0060\u0026mut biome_console::fmt::Formatter\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/biome_analyze/src/diagnostics.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"b876acf9de10c0ba75d714f64288baa6320275888e97bcf4a8b29f4db504fd26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/biome_analyze/src/signals.rs:651-667 | crates/biome_analyze/src/signals.rs:727-743 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_analyze/src/signals.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"f882e7aecec53d778e47580ece6ffcea302817ca7e62561cc8d23eeaa1c699be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/biome_cli/src/reporter/summary.rs:37-53 | crates/biome_cli/src/reporter/terminal.rs:30-46 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. 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/biome_cli/src/reporter/summary.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"c159cb7bae7562367ad8381b1a7e452d99dd72d183b49a44af354039b9b71545"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): crates/biome_cli/src/runner/impls/process_file/format.rs:149-164 | crates/biome_cli/src/runner/impls/process_file/lint_and_assist.rs:154-170 \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/biome_cli/src/runner/impls/process_file/format.rs:149\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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/biome_cli/src/runner/impls/process_file/format.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ba762cbf11b4b2093b5b9528dfca54602f95d0ebda65c6ddc95b9312bb5edd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/biome_cli/src/service/windows.rs:133-149 | crates/biome_cli/src/service/windows.rs:261-277 \u2014 both copies are in the same file, so extract the block 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/biome_cli/src/service/windows.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"68474977dcfaff4b145e4fedf534cffb8636c7447a0b0ed3800bb29b4b62f7f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/biome_configuration_macros/src/lib.rs:50-66 | crates/biome_configuration_macros/src/lib.rs:99-115 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_configuration_macros/src/lib.rs:50\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/biome_configuration_macros/src/lib.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae82f365d37ee30a19b77f19d88040941653245e542ec8235e20b6cfdd155c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): crates/biome_css_formatter/src/scss/auxiliary/module_configuration.rs:11-26 | crates/biome_css_formatter/src/scss/auxiliary/supports_declaration.rs:11-27 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_formatter/src/scss/auxiliary/module_configuration.rs:11\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026ScssModuleConfiguration\u0060 in one and \u0060\u0026ScssSupportsDeclaration\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/biome_css_formatter/src/scss/auxiliary/module_configuration.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"902692aaf11992287d740a10b566122c47beccdd8834a4a3114832306e7fadf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/biome_glob/src/editorconfig.rs:135-151 | crates/biome_glob/src/lib.rs:377-393 \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/biome_glob/src/editorconfig.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/biome_glob/src/editorconfig.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"acee60158eef762618c634812ac848e93b50bdad8f3ea0371ca0f393495e493a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/biome_html_analyze/src/lint/nursery/no_tailwind_legacy_utilities.rs:111-127 | crates/biome_js_analyze/src/lint/nursery/no_tailwind_legacy_utilities.rs:107-123 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/nursery/no_tailwind_legacy_utilities.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a494fd273c84862244afec725fb449d28b841f7271ccd239d978b80525764b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201317 lines \u00D7 2): crates/biome_html_analyze/src/lint/nursery/no_undeclared_custom_properties.rs:58-74 | crates/biome_js_analyze/src/lint/nursery/no_undeclared_custom_properties.rs:50-62 \u2014 before extracting anything, compare \u0060crates/biome_html_analyze/src/lint/nursery/no_undeclared_custom_properties.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/nursery/no_undeclared_custom_properties.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_analyze/src/lint/nursery/no_undeclared_custom_properties.rs:58\u0060 it begins part-way through the construct above it, so those exact 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/biome_html_analyze/src/lint/nursery/no_undeclared_custom_properties.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f1ca1b8b3c91fe614658626cf1aae7060670ba369c9b97ba377d972c059149"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/biome_html_formatter/src/svelte/auxiliary/await_catch_block.rs:11-27 | crates/biome_html_formatter/src/svelte/auxiliary/await_then_block.rs:11-27 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_formatter/src/svelte/auxiliary/await_catch_block.rs:11\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026SvelteAwaitCatchBlock\u0060 in one and \u0060\u0026SvelteAwaitThenBlock\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/biome_html_formatter/src/svelte/auxiliary/await_catch_block.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c17445c6af83ff78773895853eeff4c61e5c76ade06f18c58ea52e8912bae8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/biome_js_analyze/src/lint/correctness/no_solid_destructured_props.rs:271-287 | crates/biome_js_analyze/src/lint/correctness/no_solid_destructured_props.rs:289-305 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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/biome_js_analyze/src/lint/correctness/no_solid_destructured_props.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e6c7a94953de5a62d74e1859216670e364c32f876141768ae4a320144c17fbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/no_undeclared_classes.rs:353-366 | crates/biome_js_analyze/src/lint/nursery/no_undeclared_classes.rs:472-488 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/nursery/no_undeclared_classes.rs:353\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/nursery/no_undeclared_classes.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"2486492f2e1b4bfc07e079ba07c960c16bb4ea98425cca6181c54e3b28a102a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/use_block_statement_over_iife.rs:355-371 | crates/biome_js_analyze/src/lint/nursery/use_set_size.rs:337-352 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_block_statement_over_iife.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"90fc978ff4ab12d1c0912bb39f2430501d27be04be3be3e9bf712e36e616274a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/use_explicit_return_type.rs:686-702 | crates/biome_js_analyze/src/lint/nursery/use_explicit_type.rs:862-878 \u2014 before extracting anything, compare \u0060crates/biome_js_analyze/src/lint/nursery/use_explicit_return_type.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/nursery/use_explicit_type.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 80 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/biome_js_analyze/src/lint/nursery/use_explicit_return_type.rs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"b31d88a7db11f5173388463e88e2bb351fda75d3f67ce24027c1f69c327ecaf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/biome_js_analyze/src/lint/style/use_export_type.rs:280-296 | crates/biome_js_analyze/src/lint/style/use_import_type.rs:435-451 \u2014 before extracting anything, compare \u0060crates/biome_js_analyze/src/lint/style/use_export_type.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/style/use_import_type.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 60 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/biome_js_analyze/src/lint/style/use_export_type.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"284c8954d35d65608817a1e94545e111f628fd37a032d5fd91f49fee6db0ff36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/biome_js_analyze/src/lint/suspicious/no_unnecessary_conditions.rs:626-642 | crates/biome_js_analyze/src/lint/suspicious/no_unnecessary_conditions.rs:685-701 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_js_analyze/src/lint/suspicious/no_unnecessary_conditions.rs:626\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/biome_js_analyze/src/lint/suspicious/no_unnecessary_conditions.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b0f50dfba5a27e8eede31fb8985416b61b603d59087e844d22cde5d3e21b7bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): crates/biome_json_analyze/src/lint/suspicious/no_quickfix_biome.rs:149-164 | crates/biome_json_analyze/src/lint/suspicious/no_quickfix_biome.rs:180-196 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_json_analyze/src/lint/suspicious/no_quickfix_biome.rs:180\u0060 it begins part-way through the construct above it, so those exact 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/biome_json_analyze/src/lint/suspicious/no_quickfix_biome.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"634b17e3f3fb3d3f2b5d7320a528a566125748762d2eb6c51068f1b28f0dfb83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/biome_json_parser/src/lexer/mod.rs:112-128 | crates/biome_parser/src/lexer.rs:162-178 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_json_parser/src/lexer/mod.rs:112\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/biome_json_parser/src/lexer/mod.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"deafd1061bdc901d5c1a49fce810beef8ed3e7c28a195b64ab44d12d389268b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/biome_languages/src/lib.rs:459-475 | crates/biome_languages/src/lib.rs:488-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_languages/src/lib.rs:459\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_languages/src/lib.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e3b9453f230b8ad1a951589d0248417dca6cacadcd3dea5d6d8e8eb14210db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/biome_manifest/src/lib.rs:219-235 | crates/biome_manifest/src/lib.rs:243-259 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_manifest/src/lib.rs:219\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_manifest/src/lib.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"085217047769fab6c34aabc9c6329d3af33b1568103fd5fed873ffad27c41f0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/biome_markdown_formatter/src/bullet_list.rs:765-781 | crates/biome_markdown_formatter/src/bullet_list.rs:892-908 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_markdown_formatter/src/bullet_list.rs:765\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/biome_markdown_formatter/src/bullet_list.rs"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"82faad228e2a9c8f5fb605cfb4c168996dc2f2c3c9414619c822aaf43a35a4b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/biome_markdown_formatter/src/gfm/auxiliary/table_delimiter_row.rs:92-108 | crates/biome_markdown_formatter/src/gfm/auxiliary/table_row.rs:133-149 \u2014 before extracting anything, compare \u0060crates/biome_markdown_formatter/src/gfm/auxiliary/table_delimiter_row.rs\u0060 and \u0060crates/biome_markdown_formatter/src/gfm/auxiliary/table_row.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_markdown_formatter/src/gfm/auxiliary/table_delimiter_row.rs:92\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/biome_markdown_formatter/src/gfm/auxiliary/table_delimiter_row.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb6ad867273733959595d0f3ccd8798a96d4d686ebe7bd728f1536f9604331c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/biome_module_graph/src/css_module_info/traverse.rs:691-707 | crates/biome_module_graph/src/css_module_info/traverse.rs:772-788 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_module_graph/src/css_module_info/traverse.rs:691\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_module_graph/src/css_module_info/traverse.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb9781c81c152e39ade8d5ef6d5fc322e262b272628c4dc3288ac15f203c724"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/biome_module_graph/src/db/type_inference/expressions.rs:875-891 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1500-1516 \u2014 both copies are in the same file, so extract the block into one function there 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/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d6727d36f53f9e27a10b9248fdd8540dc5119a1cd515c2e4623cd06a9fdf871"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): crates/biome_module_graph/src/db/type_inference/promise_classification.rs:873-888 | crates/biome_module_graph/src/db/type_inference/promise_classification.rs:1011-1027 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_module_graph/src/db/type_inference/promise_classification.rs:873\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_module_graph/src/db/type_inference/promise_classification.rs"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d317e2b08ecba519edb98cb1ac6d74c577dd5d13f3c404c8c54e3a088820a1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/biome_module_graph/src/js_module_info/collector.rs:220-236 | crates/biome_module_graph/src/js_module_info/collector.rs:275-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/biome_module_graph/src/js_module_info/collector.rs:220\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/biome_module_graph/src/js_module_info/collector.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"eefc56a7fea8eee994a0d1efbde86c51f4287485bf644f58f93c0d078b0634f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/biome_parser/src/parsed_syntax.rs:260-276 | crates/biome_parser/src/parsed_syntax.rs:298-314 \u2014 both copies are in the same file, so extract the block 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/biome_parser/src/parsed_syntax.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b565304f45502879602a488f23eda09fcbdc40f9a38797a8393ea4901293e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/biome_service/src/file_handlers/css.rs:1065-1081 | crates/biome_service/src/file_handlers/json.rs:982-998 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/css.rs\u0060 and \u0060crates/biome_service/src/file_handlers/json.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 278 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_service/src/file_handlers/css.rs:1065\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/biome_service/src/file_handlers/css.rs"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f95f29a6281ebf5526541a742874c19482b1de425adf5379dee8f356ee0ded"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): crates/biome_service/src/settings.rs:1112-1128 | crates/biome_service/src/settings.rs:1236-1251 \u2014 both copies are in the same file, so extract the block into one function there 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/biome_service/src/settings.rs"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"e54741671e5e87af21620f2d0ee5b31d9cc7ebac5f861dba04e043a2eabcd9d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/biome_syntax_codegen/src/generate_nodes.rs:536-552 | xtask/codegen/src/generate_nodes.rs:568-584 \u2014 before extracting anything, compare \u0060crates/biome_syntax_codegen/src/generate_nodes.rs\u0060 and \u0060xtask/codegen/src/generate_nodes.rs\u0060 as WHOLE FILES: this scan already matched 26 separate duplicated blocks between them, totalling at least 933 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_syntax_codegen/src/generate_nodes.rs:536\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_syntax_codegen/src/generate_nodes.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"95bb49be7776873b6a52d7508ce391ed49f5512d4cdee6730ac18520ef3bdcc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/biome_vue_semantic/src/semantic_model/component.rs:1144-1160 | crates/biome_vue_semantic/src/semantic_model/component.rs:1180-1196 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_vue_semantic/src/semantic_model/component.rs:1144\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/biome_vue_semantic/src/semantic_model/component.rs"},"region":{"startLine":1144}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e2aefd41cf3901bcf6c0562382f0e00323c246e3fe38a4fbe7a2e16a417a46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/biome_yaml_parser/src/lexer/mod.rs:790-806 | crates/biome_yaml_parser/src/lexer/mod.rs:829-845 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_yaml_parser/src/lexer/mod.rs:790\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/biome_yaml_parser/src/lexer/mod.rs"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa54efd61e21c549c5e635d496942357a546b48d71bcc7e5cf2171781e49cd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): xtask/codegen/src/generate_configuration.rs:942-958 | xtask/codegen/src/generate_configuration.rs:966-982 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060xtask/codegen/src/generate_configuration.rs:942\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060rules\u0060 to \u0060\u0026Rules\u0060 in one and \u0060\u0026Actions\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":"xtask/codegen/src/generate_configuration.rs"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa3ae15670834d527ec8c77cc5eb4ac909fb24f90265f008c653935bd7d46f0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 12): crates/biome_css_formatter/src/css/pseudo/pseudo_class_function_compound_selector_list.rs:19-34 | crates/biome_css_formatter/src/css/pseudo/pseudo_class_function_custom_identifier.rs:19-33 | crates/biome_css_formatter/src/css/pseudo/pseudo_class_function_custom_identifier_list.rs:20-35 | crates/biome_css_formatter/src/css/pseudo/pseudo_class_function_identifier.rs:15-30 | crates/biome_css_formatter/src/css/pseudo/pseudo_class_function_nth.rs:15-29 | crates/biome_css_formatter/src/css/pseudo/pseudo_class_function_relative_selector_list.rs:19-34 | crates/biome_css_formatter/src/css/pseudo/pseudo_class_function_selector_list.rs:19-33 | crates/biome_css_formatter/src/css/pseudo/pseudo_class_function_value_list.rs:15-28 | crates/biome_css_formatter/src/css/pseudo/pseudo_element_function_custom_identifier.rs:19-33 | crates/biome_css_formatter/src/css/selectors/pseudo_class_function_compound_selector.rs:19-33 | crates/biome_css_formatter/src/css/selectors/pseudo_class_function_selector.rs:15-29 | crates/biome_css_formatter/src/css/selectors/pseudo_element_function_selector.rs:15-29 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 12 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 12 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_formatter/src/css/pseudo/pseudo_class_function_compound_selector_list.rs:19\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026CssPseudoClassFunctionCompoundSelectorList\u0060 in one and \u0060\u0026CssPseudoClassFunctionCustomIdentifier\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/biome_css_formatter/src/css/pseudo/pseudo_class_function_compound_selector_list.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"e91fd2c752198e282838b9d0609aaf16d03a688efe787d943060bb124cf83a4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 8): crates/biome_module_graph/src/db/type_inference/expressions.rs:889-904 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1220-1235 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1514-1529 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1563-1578 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1726-1741 | crates/biome_module_graph/src/db/type_inference/expressions.rs:2438-2453 | crates/biome_module_graph/src/db/type_inference/expressions.rs:3154-3169 | crates/biome_module_graph/src/db/type_inference/expressions.rs:3205-3220 \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs:887\u0060 calls \u0060Tuple\u0060 and \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs:2436\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/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce3c52688ade38a84bce7428b59d3c8dbe183ad78f2af0d0a97c085bd8739a9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 8): crates/biome_module_graph/src/db/type_inference/expressions.rs:1067-1081 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1199-1214 | crates/biome_module_graph/src/db/type_inference/expressions.rs:2343-2358 | crates/biome_module_graph/src/db/type_inference/expressions.rs:2418-2433 | crates/biome_module_graph/src/db/type_inference/expressions.rs:3001-3016 | crates/biome_module_graph/src/db/type_inference/expressions.rs:3083-3098 | crates/biome_module_graph/src/db/type_inference/lookup.rs:812-826 | crates/biome_module_graph/src/db/type_inference/resolver.rs:1050-1065 \u2014 before extracting anything, compare \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs\u0060 and \u0060crates/biome_module_graph/src/db/type_inference/lookup.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 234 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/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c39aa01c0fc9b1c5c00bb3d1c51da8441cfb2538c6892b9ee91ea8afd07ef0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 7): crates/biome_service/src/file_handlers/css.rs:855-870 | crates/biome_service/src/file_handlers/graphql.rs:688-703 | crates/biome_service/src/file_handlers/html.rs:1343-1358 | crates/biome_service/src/file_handlers/javascript.rs:1546-1561 | crates/biome_service/src/file_handlers/json.rs:809-824 | crates/biome_service/src/file_handlers/md.rs:721-736 | crates/biome_service/src/file_handlers/yaml.rs:583-598 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/css.rs\u0060 and \u0060crates/biome_service/src/file_handlers/graphql.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 202 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_service/src/file_handlers/css.rs:855\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_service/src/file_handlers/css.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a377366c60130fba2d0e9ccfccd55d156a65ec1b7da5e28c7c22e5e60194d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 6): crates/biome_css_formatter/src/verbatim.rs:191-206 | crates/biome_graphql_formatter/src/verbatim.rs:107-122 | crates/biome_grit_formatter/src/verbatim.rs:106-121 | crates/biome_html_formatter/src/verbatim.rs:118-131 | crates/biome_js_formatter/src/verbatim.rs:106-121 | crates/biome_json_formatter/src/verbatim.rs:105-120 \u2014 before extracting anything, compare \u0060crates/biome_css_formatter/src/verbatim.rs\u0060 and \u0060crates/biome_graphql_formatter/src/verbatim.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 150 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_formatter/src/verbatim.rs:191\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060\u0026mut Formatter\u003CCssFormatContext\u003E\u0060 in one and \u0060\u0026mut Formatter\u003CGraphqlFormatContext\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_formatter/src/verbatim.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7b0370888f1de51e5f88a3300f34e2cf5ba1a1bcb0e8ae5c1e01f6ff329941c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 6): crates/biome_service/src/file_handlers/astro.rs:90-104 | crates/biome_service/src/file_handlers/css.rs:470-485 | crates/biome_service/src/file_handlers/graphql.rs:378-392 | crates/biome_service/src/file_handlers/json.rs:447-462 | crates/biome_service/src/file_handlers/svelte.rs:120-134 | crates/biome_service/src/file_handlers/vue.rs:123-137 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/astro.rs\u0060 and \u0060crates/biome_service/src/file_handlers/svelte.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_service/src/file_handlers/astro.rs:90\u0060 it begins part-way through the construct above it, so those exact 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/biome_service/src/file_handlers/css.rs:469\u0060 calls \u0060Some\u0060 and \u0060crates/biome_service/src/file_handlers/astro.rs:89\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/biome_service/src/file_handlers/astro.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba5c0725345e8454f53f6ee26668dcd5e0cdf67a97132d49aec0276af244a7c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201316 lines \u00D7 5): crates/biome_graphql_formatter/src/graphql/definitions/enum_type_definition.rs:15-30 | crates/biome_graphql_formatter/src/graphql/definitions/input_object_type_definition.rs:17-32 | crates/biome_graphql_formatter/src/graphql/definitions/interface_type_definition.rs:16-24 | crates/biome_graphql_formatter/src/graphql/definitions/object_type_definition.rs:16-31 | crates/biome_graphql_formatter/src/graphql/definitions/scalar_type_definition.rs:14-29 \u2014 before extracting anything, compare \u0060crates/biome_graphql_formatter/src/graphql/definitions/enum_type_definition.rs\u0060 and \u0060crates/biome_graphql_formatter/src/graphql/definitions/input_object_type_definition.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 54 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_graphql_formatter/src/graphql/definitions/enum_type_definition.rs:15\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026GraphqlEnumTypeDefinition\u0060 in one and \u0060\u0026GraphqlInputObjectTypeDefinition\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/biome_graphql_formatter/src/graphql/definitions/enum_type_definition.rs:32\u0060 calls \u0060space\u0060, \u0060format\u0060 and \u0060crates/biome_graphql_formatter/src/graphql/definitions/scalar_type_definition.rs:31\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/biome_graphql_formatter/src/graphql/definitions/enum_type_definition.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dff52c8bfb8a9ed213c950a549cf8dc68885dc2c1b42b2da06e60332b9663e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 4): crates/biome_css_formatter/src/css/auxiliary/document_custom_matcher.rs:14-29 | crates/biome_css_formatter/src/css/auxiliary/keyframes_scope_function.rs:14-29 | crates/biome_css_formatter/src/css/auxiliary/url_function.rs:11-26 | crates/biome_css_formatter/src/css/selectors/attribute_selector.rs:10-25 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_formatter/src/css/auxiliary/document_custom_matcher.rs:14\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026CssDocumentCustomMatcher\u0060 in one and \u0060\u0026CssKeyframesScopeFunction\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/biome_css_formatter/src/css/auxiliary/document_custom_matcher.rs:30\u0060 calls \u0060format\u0060, \u0060with_text_case\u0060 and \u0060crates/biome_css_formatter/src/css/selectors/attribute_selector.rs:26\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/biome_css_formatter/src/css/auxiliary/document_custom_matcher.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"90acfcefc7584830489075aa78be16efa583479db8a4b1f96fe56cf1aa0ca5fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 3): crates/biome_css_analyze/src/suppression_action.rs:69-84 | crates/biome_html_analyze/src/suppression_action.rs:79-94 | crates/biome_js_analyze/src/suppression_action.rs:288-302 \u2014 before extracting anything, compare \u0060crates/biome_css_analyze/src/suppression_action.rs\u0060 and \u0060crates/biome_html_analyze/src/suppression_action.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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_analyze/src/suppression_action.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"a35af389036d8a572430cc65c98553d1cc04dedb302242858735915f961a60ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): crates/biome_js_formatter/src/js/module/export_named_specifier.rs:13-28 | crates/biome_js_formatter/src/js/module/named_import_specifier.rs:13-28 | crates/biome_js_formatter/src/ts/types/constructor_type.rs:16-31 \u2014 before extracting anything, compare \u0060crates/biome_js_formatter/src/js/module/export_named_specifier.rs\u0060 and \u0060crates/biome_js_formatter/src/js/module/named_import_specifier.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_formatter/src/js/module/export_named_specifier.rs:13\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026JsExportNamedSpecifier\u0060 in one and \u0060\u0026JsNamedImportSpecifier\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/biome_js_formatter/src/ts/types/constructor_type.rs:32\u0060 calls \u0060format\u0060, \u0060space\u0060 and \u0060crates/biome_js_formatter/src/js/module/export_named_specifier.rs:29\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/biome_js_formatter/src/js/module/export_named_specifier.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"7805985a7561ad1eced505db77cf5ee0b78aafd01f072d724d4ceee76bffdb51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): crates/biome_js_syntax/src/expr_ext.rs:1902-1917 | crates/biome_js_syntax/src/expr_ext.rs:1954-1969 | crates/biome_js_syntax/src/expr_ext.rs:2031-2046 \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/biome_js_syntax/src/expr_ext.rs:1902\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_js_syntax/src/expr_ext.rs:1895\u0060 calls \u0060Some\u0060, \u0060inner_string_text\u0060, \u0060name_token\u0060 and \u0060crates/biome_js_syntax/src/expr_ext.rs:1953\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/biome_js_syntax/src/expr_ext.rs"},"region":{"startLine":1902}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e934731cd5a426a6ea102a7584ea12ddf4494812516fe63401160c6ba49a12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): crates/biome_markdown_formatter/src/markdown/lists/block_list.rs:438-453 | crates/biome_markdown_formatter/src/markdown/lists/block_list.rs:460-475 | crates/biome_markdown_formatter/src/markdown/lists/block_list.rs:575-590 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_markdown_formatter/src/markdown/lists/block_list.rs:566\u0060 calls \u0060next_content_block_is_list\u0060 and \u0060crates/biome_markdown_formatter/src/markdown/lists/block_list.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/biome_markdown_formatter/src/markdown/lists/block_list.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df1d2c01fb439859eb06749e16740c3020f3018d9b1fa9817b67cf71fb2fff1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): crates/biome_service/src/file_handlers/html.rs:1127-1142 | crates/biome_service/src/file_handlers/javascript.rs:1344-1359 | crates/biome_service/src/file_handlers/md/lint_embedded_nodes.rs:16-31 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/html.rs\u0060 and \u0060crates/biome_service/src/file_handlers/javascript.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 202 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_service/src/file_handlers/html.rs:1127\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_service/src/file_handlers/html.rs"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e905fa09095b906c3cc2e84560f3853091a1ccfe8af5f949fe4dda39bc22333"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 3): crates/biome_service/src/workspace/server.rs:4101-4116 | crates/biome_service/src/workspace/server.rs:4167-4181 | crates/biome_service/src/workspace/server.rs:4208-4222 \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 \u0060params\u0060 to \u0060FormatFileParams\u0060 in one and \u0060FormatRangeParams\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/biome_service/src/workspace/server.rs"},"region":{"startLine":4101}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e97ae24571cb0ba1c1667d11b08810b9a04b74e43e934e256416dfff3edc16e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/biome_cli/src/execute/migrate/eslint.rs:207-222 | crates/biome_cli/src/execute/migrate/stylelint.rs:138-153 \u2014 before extracting anything, compare \u0060crates/biome_cli/src/execute/migrate/eslint.rs\u0060 and \u0060crates/biome_cli/src/execute/migrate/stylelint.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_cli/src/execute/migrate/eslint.rs:207\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_cli/src/execute/migrate/eslint.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"79d73b31f16d5f775aa180b75aba686942dc53ad67a274fc804a7cdcb48c9212"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/biome_css_formatter/src/css/auxiliary/supports_and_condition.rs:10-25 | crates/biome_css_formatter/src/css/auxiliary/supports_or_condition.rs:10-25 \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/biome_css_formatter/src/css/auxiliary/supports_and_condition.rs:10\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026CssSupportsAndCondition\u0060 in one and \u0060\u0026CssSupportsOrCondition\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/biome_css_formatter/src/css/auxiliary/supports_and_condition.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"da91db0f7b8cd717e6e4e96e08f4618facac8d38d905fe64ef93628e13a7a096"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/biome_css_formatter/src/tailwind/statements/utility_at_rule.rs:10-25 | crates/biome_css_formatter/src/tailwind/statements/variant_at_rule.rs:10-25 \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/biome_css_formatter/src/tailwind/statements/utility_at_rule.rs:10\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026TwUtilityAtRule\u0060 in one and \u0060\u0026TwVariantAtRule\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/biome_css_formatter/src/tailwind/statements/utility_at_rule.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"07bcffc83b0ef8d781c2c8b8b266e3c35a0094e0417381322ab853ddcd568f95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/biome_css_parser/src/syntax/mod.rs:136-151 | crates/biome_css_parser/src/syntax/mod.rs:210-225 \u2014 both copies are in the same file, so extract the block 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/biome_css_parser/src/syntax/mod.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"80103e1f613a7b54ad4b255f0ab6a18428eea80c0e2a57435fba2fcde0f6c193"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/biome_graphql_analyze/src/lib.rs:125-140 | crates/biome_yaml_analyze/src/lib.rs:125-140 \u2014 before extracting anything, compare \u0060crates/biome_graphql_analyze/src/lib.rs\u0060 and \u0060crates/biome_yaml_analyze/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_graphql_analyze/src/lib.rs:125\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_graphql_analyze/src/lib.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c735892fc3b8b2ddd5f37e9726e4d96afdc9e08abdcb7c793d4fd87b38459d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/biome_graphql_formatter/src/graphql/extensions/schema_extension.rs:14-30 | crates/biome_grit_formatter/src/grit/auxiliary/language_declaration.rs:13-28 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_graphql_formatter/src/graphql/extensions/schema_extension.rs:14\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060\u0026mut GraphqlFormatter\u0060 in one and \u0060\u0026mut GritFormatter\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/biome_graphql_formatter/src/graphql/extensions/schema_extension.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa3d5c851b1cca9c6c553fcc0417221f2518908e5100f5b82b273817567dfa6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/biome_grit_patterns/src/grit_context.rs:328-343 | crates/biome_grit_patterns/src/grit_context.rs:360-375 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_grit_patterns/src/grit_context.rs:328\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_grit_patterns/src/grit_context.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"7776751743bfee2e02c05dd016207b8c593541a10c65ee71532d858caff83d7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/biome_html_analyze/src/lint/a11y/no_header_scope.rs:77-92 | crates/biome_js_analyze/src/lint/a11y/no_header_scope.rs:78-93 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/a11y/no_header_scope.rs:78\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_js_analyze/src/lint/a11y/no_header_scope.rs:75\u0060 calls \u0060query\u0060, \u0060find_attribute_by_name\u0060 and \u0060crates/biome_html_analyze/src/lint/a11y/no_header_scope.rs:76\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/biome_html_analyze/src/lint/a11y/no_header_scope.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc267f1d44382226fc55a91e80747b9fe943c95bf252359ae9a12ad1fafc989"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/biome_html_analyze/src/lint/correctness/use_vue_valid_v_else.rs:191-206 | crates/biome_html_analyze/src/lint/correctness/use_vue_valid_v_else_if.rs:245-260 \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/biome_html_analyze/src/lint/correctness/use_vue_valid_v_else.rs:191\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/correctness/use_vue_valid_v_else.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec2ae9346ea216ef8a8df580262dd9fecf2b1c34f2d06a86fa2431eed719400"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/biome_html_analyze/src/lint/correctness/use_vue_valid_v_on.rs:85-100 | crates/biome_html_analyze/src/lint/correctness/use_vue_valid_v_on.rs:104-119 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_html_analyze/src/lint/correctness/use_vue_valid_v_on.rs:85\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_html_analyze/src/lint/correctness/use_vue_valid_v_on.rs:101\u0060 calls \u0060VueVOnShorthandDirective\u0060 and \u0060crates/biome_html_analyze/src/lint/correctness/use_vue_valid_v_on.rs:83\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/correctness/use_vue_valid_v_on.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b84dc968bc54f219aa5505afd7ab34dae7ad2e0a0b7235f4e8fea22a56e9a3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/biome_html_analyze/src/lint/nursery/no_astro_set_html_directive.rs:72-87 | crates/biome_js_analyze/src/lint/nursery/no_astro_set_html_directive.rs:69-84 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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/biome_html_analyze/src/lint/nursery/no_astro_set_html_directive.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a7798441d0ba02650d35076dcf5cbe756b69b98ce64b64a8ddedccdeb228b7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/biome_html_analyze/src/lint/nursery/no_obsolete_attributes.rs:112-127 | crates/biome_js_analyze/src/lint/nursery/no_obsolete_attributes.rs:114-129 \u2014 before extracting anything, compare \u0060crates/biome_html_analyze/src/lint/nursery/no_obsolete_attributes.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/nursery/no_obsolete_attributes.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 104 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_analyze/src/lint/nursery/no_obsolete_attributes.rs:112\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/biome_html_analyze/src/lint/nursery/no_obsolete_attributes.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"40bf37e453eff8082a6536fff8caa93d820a2a2987ecc091793ea1db86ac3fd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/biome_html_analyze/src/lint/nursery/no_obsolete_tags.rs:75-90 | crates/biome_js_analyze/src/lint/nursery/no_obsolete_tags.rs:106-121 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/nursery/no_obsolete_tags.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"26cd55c57964e0aab9a29dd536d0cc6f10556bad05bcef9ddc41e2cdf1204ab3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/biome_html_analyze/src/lint/nursery/no_undeclared_classes.rs:168-183 | crates/biome_js_analyze/src/lint/nursery/no_undeclared_classes.rs:178-193 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_analyze/src/lint/nursery/no_undeclared_classes.rs:168\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_html_analyze/src/lint/nursery/no_undeclared_classes.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b99935f24d77b7e7888d7283c0d76ae5aeb59319f508e8cbfedc6b821bc354"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/biome_html_analyze/src/lint/nursery/use_control_label.rs:135-150 | crates/biome_js_analyze/src/lint/nursery/use_control_label.rs:150-165 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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/biome_html_analyze/src/lint/nursery/use_control_label.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dcd50e3807096f20a4d2f34c33c37a1f63a42f28f50a5a83b10a2e2128b33cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/biome_html_syntax/src/attribute_ext.rs:187-202 | crates/biome_html_syntax/src/attribute_ext.rs:232-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/biome_html_syntax/src/attribute_ext.rs:187\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_syntax/src/attribute_ext.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de773771e5e6224f557c2fbee951f5b51ee9577b4603dcaddba634becb711dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 2): crates/biome_js_analyze/src/lint/complexity/no_useless_rename.rs:155-167 | crates/biome_js_analyze/src/lint/performance/use_dom_node_text_content.rs:173-188 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/complexity/no_useless_rename.rs:155\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/complexity/no_useless_rename.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c90a10df544e74ccad4639c353a49cb959a4f19081e5f886bab6150fc8dd2a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 2): crates/biome_js_analyze/src/lint/complexity/no_useless_undefined.rs:118-130 | crates/biome_js_analyze/src/lint/complexity/no_useless_undefined_initialization.rs:87-102 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/complexity/no_useless_undefined.rs:118\u0060 it does not close everything it opens, so those exact 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/biome_js_analyze/src/lint/complexity/no_useless_undefined.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d0da8d3e88cea9efdd0df4fe55a950474d71644083b8df0d9a3c62d9b8a466"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/biome_js_analyze/src/lint/correctness/no_invalid_builtin_instantiation.rs:119-133 | crates/biome_js_analyze/src/lint/style/use_consistent_builtin_instantiation.rs:120-135 \u2014 before extracting anything, compare \u0060crates/biome_js_analyze/src/lint/correctness/no_invalid_builtin_instantiation.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/style/use_consistent_builtin_instantiation.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/correctness/no_invalid_builtin_instantiation.rs:119\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/correctness/no_invalid_builtin_instantiation.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6449833b975342a3b4fc6a45ea71d63eb7718ba63bbdfae025e4973590bc7df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/no_misleading_return_type/analysis.rs:84-99 | crates/biome_js_analyze/src/lint/nursery/no_misleading_return_type/analysis.rs:101-116 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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/biome_js_analyze/src/lint/nursery/no_misleading_return_type/analysis.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"61ce374963765e9758f6523d351cfd995f4824ecc2995a5118466e93686ebe0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/use_consistent_json_file_read.rs:398-413 | crates/biome_js_analyze/src/lint/nursery/use_consistent_json_file_read.rs:422-435 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_js_analyze/src/lint/nursery/use_consistent_json_file_read.rs:398\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_consistent_json_file_read.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f33d3ed2bb6907786d2e9e7bf0b77c26a7a13d17c03538dcfe52cfc9e725bc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): crates/biome_js_analyze/src/lint/style/use_number_namespace.rs:102-117 | crates/biome_js_analyze/src/lint/style/use_number_namespace.rs:228-241 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/style/use_number_namespace.rs:102\u0060 it does not close everything it opens, so those exact 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/biome_js_analyze/src/lint/style/use_number_namespace.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e13c9dd48342aa0186cc974b6628caa764ad35816266c028a1d140f03825af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/biome_js_analyze/src/utils.rs:25-41 | crates/biome_tailwind_syntax/src/util.rs:16-32 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/utils.rs:25\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/utils.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b51db1bd17db748754247f917416aa30ba7cdd2310994889164a0de22d22cdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/biome_js_formatter/src/js/expressions/bigint_literal_expression.rs:20-35 | crates/biome_js_formatter/src/ts/types/bigint_literal_type.rs:19-34 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_formatter/src/js/expressions/bigint_literal_expression.rs:20\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/biome_js_formatter/src/js/expressions/bigint_literal_expression.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd02ecadd8a4bc426635dbf7d64a393637c921c2f85fbf841991c30ac6543cb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/biome_js_type_info/src/local_inference.rs:2444-2459 | crates/biome_js_type_info/src/local_inference.rs:2492-2507 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_js_type_info/src/local_inference.rs:2444\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_js_type_info/src/local_inference.rs"},"region":{"startLine":2444}}}],"partialFingerprints":{"codehealthFindingId/v1":"d99ebd401dedcedcf56686b2c7f5937c703f04ea49882967574e6c10a3ce8938"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/biome_json_analyze/src/assist/source/use_sorted_package_json/sorters/dependencies_meta.rs:70-85 | crates/biome_json_analyze/src/assist/source/use_sorted_package_json/sorters/helpers.rs:37-52 \u2014 before extracting anything, compare \u0060crates/biome_json_analyze/src/assist/source/use_sorted_package_json/sorters/dependencies_meta.rs\u0060 and \u0060crates/biome_json_analyze/src/assist/source/use_sorted_package_json/sorters/helpers.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_json_analyze/src/assist/source/use_sorted_package_json/sorters/dependencies_meta.rs:70\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/biome_json_analyze/src/assist/source/use_sorted_package_json/sorters/dependencies_meta.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"9228828c829eea89e7ab8872c933d05c1bfb5edb910164d78f59052e3c5ac6c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/biome_markdown_formatter/src/gfm/auxiliary/table_delimiter_row.rs:65-80 | crates/biome_markdown_formatter/src/gfm/auxiliary/table_row.rs:62-77 \u2014 before extracting anything, compare \u0060crates/biome_markdown_formatter/src/gfm/auxiliary/table_delimiter_row.rs\u0060 and \u0060crates/biome_markdown_formatter/src/gfm/auxiliary/table_row.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_markdown_formatter/src/gfm/auxiliary/table_delimiter_row.rs:65\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_markdown_formatter/src/gfm/auxiliary/table_delimiter_row.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b408a65068e1f36ba55dec75189633efdebe06da728738995d117ac5db1e6d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/biome_markdown_parser/src/lexer/mod.rs:513-528 | crates/biome_markdown_parser/src/lexer/mod.rs:756-771 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_markdown_parser/src/lexer/mod.rs:513\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/lexer/mod.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d92899f2d58e0334460d4cd6daf75ab05db0eaf446f23192b530bc78712b4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/biome_markdown_parser/src/syntax/list.rs:860-875 | crates/biome_markdown_parser/src/syntax/list.rs:1280-1295 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_markdown_parser/src/syntax/list.rs:860\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"0469a5c6b255d1d2bef77e064aa0b9785ecf10be86efb4fea5893c4fa0578a0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/biome_module_graph/src/db/queries/type_inference/calls/implementation.rs:1534-1549 | crates/biome_module_graph/src/db/queries/type_inference/calls/implementation.rs:1589-1604 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_module_graph/src/db/queries/type_inference/calls/implementation.rs:1534\u0060 it begins part-way through the construct above it, so those exact 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/biome_module_graph/src/db/queries/type_inference/calls/implementation.rs:1605\u0060 calls \u0060has_unknown_members\u0060 and \u0060crates/biome_module_graph/src/db/queries/type_inference/calls/implementation.rs:1550\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/biome_module_graph/src/db/queries/type_inference/calls/implementation.rs"},"region":{"startLine":1534}}}],"partialFingerprints":{"codehealthFindingId/v1":"b708f1929000a76d68406b969394ecd8de238f373a0babab9b085f0e164b37a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 2): crates/biome_parser/src/lexer.rs:642-657 | crates/biome_parser/src/lexer.rs:679-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/biome_parser/src/lexer.rs:642\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_parser/src/lexer.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"286a0c98b6b559177d94aa19ce916ed0505ba8244f992d2081ddbaf82564524b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/biome_service/src/file_handlers/html.rs:661-676 | crates/biome_service/src/file_handlers/md.rs:386-401 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/html.rs\u0060 and \u0060crates/biome_service/src/file_handlers/md.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 187 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_service/src/file_handlers/html.rs:661\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/html.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"718f14e2bfa02c2bd4890df71a55cce3cfaba4667d40dfe8f6358e3f36272546"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/biome_service/src/file_handlers/html.rs:1720-1735 | crates/biome_service/src/file_handlers/html.rs:1750-1765 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_service/src/file_handlers/html.rs:1720\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/biome_service/src/file_handlers/html.rs"},"region":{"startLine":1720}}}],"partialFingerprints":{"codehealthFindingId/v1":"547a13bf8d044da3ee0271fdb6e19ffc4a643bbd46170ed34ffbbf4878dee0c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/biome_service/src/file_handlers/md.rs:163-178 | crates/biome_service/src/file_handlers/yaml.rs:115-130 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/md.rs\u0060 and \u0060crates/biome_service/src/file_handlers/yaml.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 248 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/biome_service/src/file_handlers/md.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec79c390d6e96757f421b382519ffb8c548cf846ae48bea5406694a88a3fc0c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/biome_service/src/settings.rs:1195-1210 | crates/biome_service/src/settings.rs:1216-1230 \u2014 both copies are in the same file, so extract the block 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/biome_service/src/settings.rs"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"e29502d4dfda6f90bd7198805849d0e574a618e5f8a2693bf459fe716a3ed269"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/biome_syntax_codegen/src/generate_nodes.rs:401-416 | xtask/codegen/src/generate_nodes.rs:433-448 \u2014 before extracting anything, compare \u0060crates/biome_syntax_codegen/src/generate_nodes.rs\u0060 and \u0060xtask/codegen/src/generate_nodes.rs\u0060 as WHOLE FILES: this scan already matched 26 separate duplicated blocks between them, totalling at least 933 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_syntax_codegen/src/generate_nodes.rs:401\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_syntax_codegen/src/generate_nodes.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f6cfc306240cfbd4b5e93e874d7a51695e7767dbadf4c89efba17c4cd2855b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/biome_syntax_codegen/src/generate_nodes.rs:557-572 | xtask/codegen/src/generate_nodes.rs:589-603 \u2014 before extracting anything, compare \u0060crates/biome_syntax_codegen/src/generate_nodes.rs\u0060 and \u0060xtask/codegen/src/generate_nodes.rs\u0060 as WHOLE FILES: this scan already matched 26 separate duplicated blocks between them, totalling at least 933 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_syntax_codegen/src/generate_nodes.rs:557\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_syntax_codegen/src/generate_nodes.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"79dd17581a2e402653f137ae92d0626988546ac07b987c26c3f01d30ef11671f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/biome_syntax_codegen/src/generate_nodes.rs:1136-1151 | xtask/codegen/src/generate_nodes.rs:1176-1191 \u2014 before extracting anything, compare \u0060crates/biome_syntax_codegen/src/generate_nodes.rs\u0060 and \u0060xtask/codegen/src/generate_nodes.rs\u0060 as WHOLE FILES: this scan already matched 26 separate duplicated blocks between them, totalling at least 933 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_syntax_codegen/src/generate_nodes.rs"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a52735a25966467e7dfee6fa15c1decc04a25ac29040753f2540aa1a693b9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/biome_syntax_codegen/src/generate_syntax_factory.rs:169-184 | xtask/codegen/src/generate_syntax_factory.rs:158-173 \u2014 before extracting anything, compare \u0060crates/biome_syntax_codegen/src/generate_syntax_factory.rs\u0060 and \u0060xtask/codegen/src/generate_syntax_factory.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 137 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_syntax_codegen/src/generate_syntax_factory.rs:169\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_syntax_codegen/src/generate_syntax_factory.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4a6c438cb5a603c7579901747cb40e2e443e724573d1c6a6a66cfc309deb5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/biome_vue_semantic/src/semantic_model/component.rs:685-700 | crates/biome_vue_semantic/src/semantic_model/component.rs:1671-1686 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_vue_semantic/src/semantic_model/component.rs:685\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_vue_semantic/src/semantic_model/component.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4947512dc90c2fdc7275eb5005636f61f4b82202bf2613853e03ebf8d27da5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): xtask/codegen/src/generate_configuration.rs:325-340 | xtask/codegen/src/generate_configuration.rs:388-403 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/generate_configuration.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a7aa53e74b27a073222542b842c3adc75ed3d63bdc302ae1d464cb99a518439"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 6): crates/biome_css_analyze/src/lint/nursery/use_consistent_unicode_bom.rs:102-116 | crates/biome_graphql_analyze/src/lint/nursery/use_consistent_unicode_bom.rs:98-112 | crates/biome_html_analyze/src/lint/nursery/use_consistent_unicode_bom.rs:90-104 | crates/biome_js_analyze/src/lint/nursery/use_consistent_unicode_bom.rs:111-125 | crates/biome_json_analyze/src/lint/nursery/use_consistent_unicode_bom.rs:98-112 | crates/biome_markdown_analyze/src/lint/nursery/use_consistent_unicode_bom.rs:90-104 \u2014 before extracting anything, compare \u0060crates/biome_css_analyze/src/lint/nursery/use_consistent_unicode_bom.rs\u0060 and \u0060crates/biome_graphql_analyze/src/lint/nursery/use_consistent_unicode_bom.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 50 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_analyze/src/lint/nursery/use_consistent_unicode_bom.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"3765dea4a6676166d38350b1394b33534d70e95c031820aabd92855ddbedcbcf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 6): crates/biome_grit_formatter/src/grit/patterns/pattern_any.rs:10-24 | crates/biome_grit_formatter/src/grit/patterns/pattern_or.rs:10-24 | crates/biome_grit_formatter/src/grit/patterns/pattern_or_else.rs:10-24 | crates/biome_grit_formatter/src/grit/predicates/predicate_and.rs:10-23 | crates/biome_grit_formatter/src/grit/predicates/predicate_any.rs:10-23 | crates/biome_grit_formatter/src/grit/predicates/predicate_or.rs:9-23 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 6 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 6 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_grit_formatter/src/grit/patterns/pattern_any.rs:10\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026GritPatternAny\u0060 in one and \u0060\u0026GritPatternOr\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/biome_grit_formatter/src/grit/patterns/pattern_any.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ed54866b5696ea55624375776978adb03a678e4f31dcf740186195d12e2271"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 5): crates/biome_css_formatter/src/css/auxiliary/container_style_query_in_parens.rs:14-27 | crates/biome_css_formatter/src/css/auxiliary/if_function.rs:11-25 | crates/biome_css_formatter/src/css/auxiliary/import_named_layer.rs:10-23 | crates/biome_css_formatter/src/css/auxiliary/import_supports.rs:10-24 | crates/biome_css_formatter/src/scss/auxiliary/legacy_if_function.rs:11-25 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 5 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_formatter/src/css/auxiliary/container_style_query_in_parens.rs:14\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026CssContainerStyleQueryInParens\u0060 in one and \u0060\u0026CssIfFunction\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/biome_css_formatter/src/css/auxiliary/container_style_query_in_parens.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed9e116843168d176623ff286bf4e7721ad6e3ac7ccd0d52860ec3c7ff99425"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 5): crates/biome_css_formatter/src/verbatim.rs:345-359 | crates/biome_graphql_formatter/src/verbatim.rs:217-231 | crates/biome_grit_formatter/src/verbatim.rs:216-230 | crates/biome_js_formatter/src/verbatim.rs:225-239 | crates/biome_json_formatter/src/verbatim.rs:215-229 \u2014 before extracting anything, compare \u0060crates/biome_css_formatter/src/verbatim.rs\u0060 and \u0060crates/biome_graphql_formatter/src/verbatim.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 150 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060\u0026mut Formatter\u003CCssFormatContext\u003E\u0060 in one and \u0060\u0026mut Formatter\u003CGraphqlFormatContext\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_formatter/src/verbatim.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f3207f07224f59a814b09a8be0e3d8ac9b505f444a691fbc2476e3b8131ab9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 5): crates/biome_grit_patterns/src/pattern_compiler/auto_wrap.rs:100-114 | crates/biome_grit_patterns/src/pattern_compiler/auto_wrap.rs:165-179 | crates/biome_grit_patterns/src/pattern_compiler/auto_wrap.rs:259-273 | crates/biome_grit_patterns/src/pattern_compiler/auto_wrap.rs:323-337 | crates/biome_grit_patterns/src/pattern_compiler/step_compiler.rs:47-61 \u2014 there are 5 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/biome_grit_patterns/src/pattern_compiler/auto_wrap.rs:116\u0060 calls \u0060Contains\u0060 and \u0060crates/biome_grit_patterns/src/pattern_compiler/auto_wrap.rs:181\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/biome_grit_patterns/src/pattern_compiler/auto_wrap.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"9739763578cbf8b1a05ea8683a4ba8784216ba52dd9abd729c74cce33dc9ccf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 5): crates/biome_service/src/settings.rs:2161-2174 | crates/biome_service/src/settings.rs:2202-2215 | crates/biome_service/src/settings.rs:2239-2252 | crates/biome_service/src/settings.rs:2272-2285 | crates/biome_service/src/settings.rs:2297-2311 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060options\u0060 to \u0060\u0026mut JsonFormatOptions\u0060 in one and \u0060\u0026mut CssFormatOptions\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/biome_service/src/settings.rs:2216\u0060 calls \u0060Some\u0060, \u0060set_quote_style\u0060 and \u0060crates/biome_service/src/settings.rs:2253\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/biome_service/src/settings.rs"},"region":{"startLine":2161}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d7a894bb8537bbdd557b0ce11cfadea69dd20d4e4baa4c8436329b7c9a9a544"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4): crates/biome_module_graph/src/db/type_inference/expressions.rs:1152-1166 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1546-1560 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1782-1796 | crates/biome_module_graph/src/db/type_inference/expressions.rs:2485-2499 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs:1167\u0060 calls \u0060Tuple\u0060 and \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs:1797\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/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"72210c6d3193dffdb9411a26daa3897a690bcbfb55db7cc86a5a4fd27e5c6340"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4): crates/biome_service/src/file_handlers/graphql.rs:366-380 | crates/biome_service/src/file_handlers/grit.rs:304-318 | crates/biome_service/src/file_handlers/json.rs:435-449 | crates/biome_service/src/file_handlers/yaml.rs:344-358 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/graphql.rs\u0060 and \u0060crates/biome_service/src/file_handlers/grit.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 111 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_service/src/file_handlers/graphql.rs:366\u0060 it begins part-way through the construct above it, so those exact 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/biome_service/src/file_handlers/yaml.rs:359\u0060 calls \u0060Some\u0060 and \u0060crates/biome_service/src/file_handlers/grit.rs:319\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/biome_service/src/file_handlers/graphql.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf4485ae3b3bb30b38e94f36a8af53ed3c5fa945e68a7bcf1f4456e698dac04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/biome_cli/src/execute/migrate/eslint.rs:336-350 | crates/biome_cli/src/execute/migrate/stylelint.rs:189-203 \u2014 before extracting anything, compare \u0060crates/biome_cli/src/execute/migrate/eslint.rs\u0060 and \u0060crates/biome_cli/src/execute/migrate/stylelint.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_cli/src/execute/migrate/eslint.rs:336\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_cli/src/execute/migrate/eslint.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"f37e497ba40ab41387bd077e27a70e446b417062a9358f9a990a669ea162cf82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/biome_cli/src/execute/migrate/eslint_to_biome.rs:250-264 | crates/biome_cli/src/execute/migrate/eslint_to_biome.rs:290-304 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_cli/src/execute/migrate/eslint_to_biome.rs:250\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_cli/src/execute/migrate/eslint_to_biome.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b9ca31b44372ee043dcddaeaa443460112f0f0c4ea7aeffa54b70bb9de8220"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/biome_cli/src/runner/impls/process_file/check.rs:121-135 | crates/biome_cli/src/runner/impls/process_file/format.rs:102-116 \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/biome_cli/src/runner/impls/process_file/check.rs:121\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/biome_cli/src/runner/impls/process_file/check.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"c595581e06d8cbccf029fe0fa712f0b6002120d9db6de3eb2080af7ff69dd4ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/biome_css_analyze/src/lint/suspicious/no_duplicate_custom_properties.rs:83-97 | crates/biome_css_analyze/src/lint/suspicious/no_duplicate_properties.rs:92-106 \u2014 before extracting anything, compare \u0060crates/biome_css_analyze/src/lint/suspicious/no_duplicate_custom_properties.rs\u0060 and \u0060crates/biome_css_analyze/src/lint/suspicious/no_duplicate_properties.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_analyze/src/lint/suspicious/no_duplicate_custom_properties.rs:83\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/biome_css_analyze/src/lint/suspicious/no_duplicate_custom_properties.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec9ef9641a60aa35856fa77c98e7e483d04d6b2075fbeac8a0b391b43e4e1178"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/biome_css_formatter/src/comments.rs:706-720 | crates/biome_css_formatter/src/comments.rs:852-866 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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/biome_css_formatter/src/comments.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"d81b541553a8ea857edb341710f7e197148cb73c66a223bd98e525a229d0addb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/biome_css_formatter/src/css/auxiliary/query_feature_range_interval.rs:17-30 | crates/biome_css_formatter/src/css/auxiliary/query_feature_reverse_range.rs:15-29 \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/biome_css_formatter/src/css/auxiliary/query_feature_range_interval.rs:17\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026CssQueryFeatureRangeInterval\u0060 in one and \u0060\u0026CssQueryFeatureReverseRange\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/biome_css_formatter/src/css/auxiliary/query_feature_range_interval.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"450bc59d7125659cc7f6bf18fa2e07e7c9592fcb304d26bf71ad0f7fa0eceb2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/biome_deserialize_macros/src/deserializable_derive.rs:542-556 | crates/biome_deserialize_macros/src/deserializable_derive.rs:575-589 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_deserialize_macros/src/deserializable_derive.rs:542\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060data\u0060 to \u0060DeserializableFromData\u0060 in one and \u0060DeserializableTryFromData\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/biome_deserialize_macros/src/deserializable_derive.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"f74796206ec896fccc80ddfb4689094ade0e7e49d03f36b6151d3395e540171d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/biome_graphql_formatter/src/graphql/definitions/fragment_definition.rs:16-30 | crates/biome_graphql_formatter/src/graphql/definitions/variable_definition.rs:15-29 \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/biome_graphql_formatter/src/graphql/definitions/fragment_definition.rs:16\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026GraphqlFragmentDefinition\u0060 in one and \u0060\u0026GraphqlVariableDefinition\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/biome_graphql_formatter/src/graphql/definitions/fragment_definition.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bf1e31cd64a962ba9748d29143de0b0a2dd530be852c10af7091924fad59d6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/biome_grit_patterns/src/pattern_compiler/assignment_compiler.rs:20-34 | crates/biome_grit_patterns/src/pattern_compiler/assignment_compiler.rs:44-58 \u2014 both copies are in the same file, so extract the block 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/biome_grit_patterns/src/pattern_compiler/assignment_compiler.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11836ae3f6da1404e2c9b9a5ac28896c509962d6bb5c197025ee17585ceaf59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/biome_html_analyze/src/lint/a11y/no_ambiguous_anchor_text.rs:94-108 | crates/biome_js_analyze/src/lint/a11y/no_ambiguous_anchor_text.rs:99-113 \u2014 before extracting anything, compare \u0060crates/biome_html_analyze/src/lint/a11y/no_ambiguous_anchor_text.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/a11y/no_ambiguous_anchor_text.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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/biome_html_analyze/src/lint/a11y/no_ambiguous_anchor_text.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb1f38de9247d396ba6410b4942b65947e014783b8795a15c2757362474941f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201315 lines \u00D7 2): crates/biome_html_analyze/src/lint/a11y/use_anchor_content.rs:191-202 | crates/biome_html_analyze/src/lint/a11y/use_heading_content.rs:241-255 \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/biome_html_analyze/src/lint/a11y/use_anchor_content.rs:191\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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/biome_html_analyze/src/lint/a11y/use_anchor_content.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"2310c923638bf5ca365581ecddd7d4f1e41f5ed55a4bb826cdf63c0672c77d1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/biome_html_analyze/src/lint/nursery/no_invalid_file_input_accept.rs:140-154 | crates/biome_js_analyze/src/lint/nursery/no_invalid_file_input_accept.rs:130-144 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_analyze/src/lint/nursery/no_invalid_file_input_accept.rs:140\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/biome_html_analyze/src/lint/nursery/no_invalid_file_input_accept.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"81fdac6780cf211efb153652854e1bdc970010856382ee67c66f834a6443e375"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/biome_html_analyze/src/lint/nursery/no_tailwind_restyled_components.rs:159-173 | crates/biome_js_analyze/src/lint/nursery/no_tailwind_restyled_components.rs:182-196 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/nursery/no_tailwind_restyled_components.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"85625961bad49134bc177d9b8e54b5fe1b6889ad6442a127aecc10cd0f7a6b29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/biome_html_parser/src/lexer/mod.rs:193-207 | crates/biome_html_parser/src/lexer/mod.rs:263-277 \u2014 both copies are in the same file, so extract the block into one function there 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/biome_html_parser/src/lexer/mod.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a6fc0c3394afbe6ec8910d027d52df84ce3995adde0906aa07add4ddca2d6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): crates/biome_js_analyze/src/lint/correctness/no_unused_function_parameters.rs:113-127 | crates/biome_js_analyze/src/lint/suspicious/no_parameters_only_used_in_recursion.rs:355-367 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/correctness/no_unused_function_parameters.rs:113\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_js_analyze/src/lint/correctness/no_unused_function_parameters.rs:111\u0060 calls \u0060Some\u0060 and \u0060crates/biome_js_analyze/src/lint/suspicious/no_parameters_only_used_in_recursion.rs:354\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/biome_js_analyze/src/lint/correctness/no_unused_function_parameters.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"6297766ce490091b004cb5e73b5eb81ab1b05980129b5ce413accff856b0afd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/no_misleading_return_type/analysis.rs:856-870 | crates/biome_js_analyze/src/lint/nursery/no_misleading_return_type/analysis.rs:886-900 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_js_analyze/src/lint/nursery/no_misleading_return_type/analysis.rs:856\u0060 it does not close everything it opens, so those exact 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/biome_js_analyze/src/lint/nursery/no_misleading_return_type/analysis.rs:871\u0060 calls \u0060JsIdentifierExpression\u0060, \u0060identifier_refers_to_const_assertion\u0060 and \u0060crates/biome_js_analyze/src/lint/nursery/no_misleading_return_type/analysis.rs:901\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/biome_js_analyze/src/lint/nursery/no_misleading_return_type/analysis.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"603325ea148955e2cce69457d605ed703dc31b29c9d2c6733d1b769fe4bcc711"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/biome_js_analyze/src/lint/suspicious/no_drizzle_delete_without_where.rs:63-77 | crates/biome_js_analyze/src/lint/suspicious/no_drizzle_update_without_where.rs:63-77 \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/biome_js_analyze/src/lint/suspicious/no_drizzle_delete_without_where.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"1229b17f3ced58e306c5124f239331ae7be772a287cc99849c63f3e681f70107"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/biome_js_control_flow/src/nodes/for_stmt.rs:50-64 | crates/biome_js_control_flow/src/nodes/while_stmt.rs:32-46 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_control_flow/src/nodes/for_stmt.rs:50\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_control_flow/src/nodes/for_stmt.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd00b1ec50192a6ae7c4a06d386b673c65ae4ae3ef82ec5cd58c794976e031cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/biome_js_formatter/src/js/expressions/call_arguments.rs:566-580 | crates/biome_js_formatter/src/js/expressions/call_arguments.rs:608-622 \u2014 both copies are in the same file, so extract the block into one function there 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/biome_js_formatter/src/js/expressions/call_arguments.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5a309a13151721342d8bbf9004113dfed157bf15629c2a7759d759d673894de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/biome_js_parser/src/syntax/module.rs:835-857 | crates/biome_js_parser/src/syntax/module.rs:1129-1143 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_js_parser/src/syntax/module.rs:835\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_js_parser/src/syntax/module.rs"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9df846dab503ab379da0fa03d3f603696515e21d8842213a8be74ab65084fb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/biome_js_type_info/src/local_inference.rs:2202-2216 | crates/biome_js_type_info/src/local_inference.rs:2218-2232 \u2014 both copies are in the same file, so extract the block 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/biome_js_type_info/src/local_inference.rs"},"region":{"startLine":2202}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba430d72fcc6293078251f78ca4e247b140d94d829b4049e21db80adf802c6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/biome_markdown_formatter/src/gfm/auxiliary/table.rs:201-215 | crates/biome_markdown_formatter/src/gfm/auxiliary/table.rs:228-241 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_markdown_formatter/src/gfm/auxiliary/table.rs:201\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_formatter/src/gfm/auxiliary/table.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a742d89f3fa4f14b76e7bc12f878e6a40b7e20d3df2226392febf6bce9da5e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/biome_markdown_formatter/src/markdown/auxiliary/quote.rs:23-37 | crates/biome_markdown_formatter/src/quote.rs:40-54 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_markdown_formatter/src/markdown/auxiliary/quote.rs:23\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/biome_markdown_formatter/src/markdown/auxiliary/quote.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"a90cf99daf47429ee4c9a94100aca18400de3b7e8237023713093323b23361f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/biome_markdown_parser/src/syntax/mod.rs:1661-1674 | crates/biome_ruledoc/src/lower.rs:189-203 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_markdown_parser/src/syntax/mod.rs:1661\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_markdown_parser/src/syntax/mod.rs"},"region":{"startLine":1661}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca272de30174b911e47f68dc7f7a2b12728c0f7248c1b8bd45fdbd386cf9de19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/biome_markdown_parser/src/syntax/mod.rs:2233-2247 | crates/biome_markdown_parser/src/syntax/mod.rs:2273-2287 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_markdown_parser/src/syntax/mod.rs:2233\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_markdown_parser/src/syntax/mod.rs"},"region":{"startLine":2233}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d454f696175329673764e95d0dd3bc394c17c48b840bec08d9dbd48f91ce81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/biome_migrate/src/analyzers/includes.rs:101-115 | crates/biome_migrate/src/analyzers/use_naming_convention_enum_member_case.rs:112-125 \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/biome_migrate/src/analyzers/includes.rs:101\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_migrate/src/analyzers/includes.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccdd4c51ab2ec8b990e3700124270bc53edb9c067d14fa75f5b3a12cc1dea763"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/biome_module_graph/src/type_inference/profiling.rs:574-588 | crates/biome_module_graph/src/type_inference/profiling.rs:664-678 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_module_graph/src/type_inference/profiling.rs:574\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/biome_module_graph/src/type_inference/profiling.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0eba840a55b93572a8e7f9ca658a41b6cee81854279c6ab39295695944a7e7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/biome_parser/src/lexer.rs:659-673 | crates/biome_parser/src/lexer.rs:693-706 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_parser/src/lexer.rs:659\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_parser/src/lexer.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"594d158f6a3e79f732a03a2be2803785fead942921690d08a8ed8ef981d5cb25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/biome_rule_options/src/no_restricted_imports.rs:404-418 | crates/biome_rule_options/src/no_restricted_imports.rs:429-443 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_rule_options/src/no_restricted_imports.rs:404\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_rule_options/src/no_restricted_imports.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd1db49ed7c76e3706e614235f1c6af22438df993d8a6c28a4ad77c6cdcefac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/biome_service/src/file_handlers/html/go_to.rs:61-75 | crates/biome_service/src/file_handlers/javascript/go_to.rs:331-345 \u2014 \u0060crates/biome_service/src/file_handlers/html/go_to.rs\u0060 and \u0060crates/biome_service/src/file_handlers/javascript/go_to.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 42 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_service/src/file_handlers/html/go_to.rs:61\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_service/src/file_handlers/html/go_to.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"9000adf876fae8a91cf3d13421fedadbbccf23aa12c522b66832fa8a12b33d9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/biome_syntax_codegen/src/generate_nodes.rs:447-469 | xtask/codegen/src/generate_nodes.rs:479-501 \u2014 before extracting anything, compare \u0060crates/biome_syntax_codegen/src/generate_nodes.rs\u0060 and \u0060xtask/codegen/src/generate_nodes.rs\u0060 as WHOLE FILES: this scan already matched 26 separate duplicated blocks between them, totalling at least 933 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_syntax_codegen/src/generate_nodes.rs:447\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_syntax_codegen/src/generate_nodes.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd90c063e920c19812879c8c174b41642cbf338f2df39e5d534e713a5a3364c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): crates/biome_syntax_codegen/src/generate_nodes.rs:906-918 | xtask/codegen/src/generate_nodes.rs:943-957 \u2014 before extracting anything, compare \u0060crates/biome_syntax_codegen/src/generate_nodes.rs\u0060 and \u0060xtask/codegen/src/generate_nodes.rs\u0060 as WHOLE FILES: this scan already matched 26 separate duplicated blocks between them, totalling at least 933 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060xtask/codegen/src/generate_nodes.rs:943\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_syntax_codegen/src/generate_nodes.rs"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"f845b376bf04dbea42d517d1251bcdb3d274ae6a77abe725adc7e33b5cb9fe9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/biome_syntax_codegen/src/generate_syntax_kinds.rs:171-184 | xtask/codegen/src/generate_syntax_kinds.rs:284-298 \u2014 before extracting anything, compare \u0060crates/biome_syntax_codegen/src/generate_syntax_kinds.rs\u0060 and \u0060xtask/codegen/src/generate_syntax_kinds.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 50 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_syntax_codegen/src/generate_syntax_kinds.rs:171\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_syntax_codegen/src/generate_syntax_kinds.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"68113996576f7f73516a32039ba5adcc73f616ad0bbec2d1ce7538a60e35cfd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/biome_yaml_formatter/src/yaml/auxiliary/flow_mapping.rs:9-23 | crates/biome_yaml_formatter/src/yaml/auxiliary/flow_sequence.rs:9-23 \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/biome_yaml_formatter/src/yaml/auxiliary/flow_mapping.rs:9\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026YamlFlowMapping\u0060 in one and \u0060\u0026YamlFlowSequence\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/biome_yaml_formatter/src/yaml/auxiliary/flow_mapping.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dbc2c9aac201543403a7bd9da821193a37d343a8b4351440e4783e179f3fee7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/biome_yaml_formatter/src/yaml/lists/block_map_entry_list.rs:10-24 | crates/biome_yaml_formatter/src/yaml/lists/block_sequence_entry_list.rs:10-24 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026YamlBlockMapEntryList\u0060 in one and \u0060\u0026YamlBlockSequenceEntryList\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/biome_yaml_formatter/src/yaml/lists/block_map_entry_list.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d59f6472a775e91014f05189904c6d3ec3600cd6285bd10e2e9bc6b0e77069"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 11): crates/biome_grit_formatter/src/grit/auxiliary/like.rs:24-37 | crates/biome_grit_formatter/src/grit/auxiliary/map.rs:15-25 | crates/biome_grit_formatter/src/grit/auxiliary/sequential.rs:19-31 | crates/biome_grit_formatter/src/grit/patterns/curly_pattern.rs:15-25 | crates/biome_grit_formatter/src/grit/patterns/pattern_any.rs:17-27 | crates/biome_grit_formatter/src/grit/patterns/pattern_or.rs:17-27 | crates/biome_grit_formatter/src/grit/patterns/pattern_or_else.rs:17-27 | crates/biome_grit_formatter/src/grit/predicates/predicate_and.rs:16-26 | crates/biome_grit_formatter/src/grit/predicates/predicate_any.rs:16-26 | crates/biome_grit_formatter/src/grit/predicates/predicate_curly.rs:15-25 | crates/biome_grit_formatter/src/grit/predicates/predicate_or.rs:16-26 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 11 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 11 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_grit_formatter/src/grit/auxiliary/like.rs:24\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_formatter/src/grit/auxiliary/like.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce463855cedfaac65e97871ae74ba9ed76a387d25f6ff4dba5283f733ac63cd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 10): crates/biome_css_formatter/src/css/auxiliary/container_query_in_parens.rs:14-26 | crates/biome_css_formatter/src/css/auxiliary/container_size_feature_in_parens.rs:14-26 | crates/biome_css_formatter/src/css/auxiliary/container_style_in_parens.rs:14-26 | crates/biome_css_formatter/src/css/auxiliary/media_condition_in_parens.rs:14-26 | crates/biome_css_formatter/src/css/auxiliary/media_feature_in_parens.rs:10-22 | crates/biome_css_formatter/src/css/auxiliary/parenthesized_expression.rs:14-26 | crates/biome_css_formatter/src/css/auxiliary/scope_edge.rs:10-22 | crates/biome_css_formatter/src/css/auxiliary/supports_feature_declaration.rs:14-26 | crates/biome_css_formatter/src/scss/auxiliary/supports_feature_declaration.rs:15-25 | crates/biome_css_formatter/src/tailwind/auxiliary/custom_variant_shorthand.rs:15-28 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 10 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 10 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_formatter/src/css/auxiliary/container_query_in_parens.rs:14\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026CssContainerQueryInParens\u0060 in one and \u0060\u0026CssContainerSizeFeatureInParens\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/biome_css_formatter/src/css/auxiliary/container_query_in_parens.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"e46326eac0c28e7e34e296a1366d1fd7105ef2e69d49f6ef270e0d52746508d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 8): crates/biome_js_formatter/src/js/classes/setter_class_member.rs:23-37 | crates/biome_js_formatter/src/js/declarations/catch_declaration.rs:38-52 | crates/biome_js_formatter/src/js/expressions/call_arguments.rs:77-90 | crates/biome_js_formatter/src/js/expressions/parenthesized_expression.rs:35-49 | crates/biome_js_formatter/src/js/objects/computed_member_name.rs:18-32 | crates/biome_js_formatter/src/js/objects/setter_object_member.rs:22-36 | crates/biome_js_formatter/src/js/statements/for_in_statement.rs:23-37 | crates/biome_js_formatter/src/js/statements/for_of_statement.rs:26-40 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 8 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 8 times. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/biome_js_formatter/src/js/expressions/parenthesized_expression.rs:52\u0060 calls \u0060format\u0060 and \u0060crates/biome_js_formatter/src/js/statements/for_in_statement.rs:39\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/biome_js_formatter/src/js/classes/setter_class_member.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"c469930a0a21a14868cb07e65699154e6533efd8575313bed303853a7d897228"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 7): crates/biome_css_formatter/src/verbatim.rs:239-252 | crates/biome_graphql_formatter/src/verbatim.rs:155-168 | crates/biome_grit_formatter/src/verbatim.rs:154-167 | crates/biome_html_formatter/src/verbatim.rs:164-177 | crates/biome_js_formatter/src/verbatim.rs:154-167 | crates/biome_json_formatter/src/verbatim.rs:153-166 | crates/biome_yaml_formatter/src/verbatim.rs:196-209 \u2014 before extracting anything, compare \u0060crates/biome_css_formatter/src/verbatim.rs\u0060 and \u0060crates/biome_graphql_formatter/src/verbatim.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 150 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060\u0026mut Formatter\u003CCssFormatContext\u003E\u0060 in one and \u0060\u0026mut Formatter\u003CGraphqlFormatContext\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_formatter/src/verbatim.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"0577d8f7bc5d8f98959eeda4edbd16fc77391b44e06be3b919185376e8a775c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 6): crates/biome_css_analyze/src/lint/nursery/use_consistent_unicode_bom.rs:119-132 | crates/biome_graphql_analyze/src/lint/nursery/use_consistent_unicode_bom.rs:115-127 | crates/biome_html_analyze/src/lint/nursery/use_consistent_unicode_bom.rs:107-120 | crates/biome_js_analyze/src/lint/nursery/use_consistent_unicode_bom.rs:128-141 | crates/biome_json_analyze/src/lint/nursery/use_consistent_unicode_bom.rs:115-128 | crates/biome_markdown_analyze/src/lint/nursery/use_consistent_unicode_bom.rs:107-119 \u2014 before extracting anything, compare \u0060crates/biome_css_analyze/src/lint/nursery/use_consistent_unicode_bom.rs\u0060 and \u0060crates/biome_graphql_analyze/src/lint/nursery/use_consistent_unicode_bom.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 50 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_analyze/src/lint/nursery/use_consistent_unicode_bom.rs:119\u0060 it does not close everything it opens, so those exact 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/biome_css_analyze/src/lint/nursery/use_consistent_unicode_bom.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"3157137db851757d1bcad3e33dcdeefd2da81e2ef60ed408d03d455554fd96db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 6): crates/biome_module_graph/src/db/type_inference/expressions.rs:1089-1102 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1172-1185 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1800-1813 | crates/biome_module_graph/src/db/type_inference/expressions.rs:2505-2518 | crates/biome_module_graph/src/db/type_inference/lookup.rs:767-780 | crates/biome_module_graph/src/db/type_inference/lookup.rs:835-848 \u2014 before extracting anything, compare \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs\u0060 and \u0060crates/biome_module_graph/src/db/type_inference/lookup.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 234 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs:1088\u0060 calls \u0060Union\u0060 and \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs:1799\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f0391382468c4f492d5d1658de8282db9bad756886c1f0d2bcf36fe72a3444"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 6): crates/biome_service/src/file_handlers/graphql.rs:581-592 | crates/biome_service/src/file_handlers/html.rs:1103-1114 | crates/biome_service/src/file_handlers/javascript.rs:1319-1331 | crates/biome_service/src/file_handlers/json.rs:649-662 | crates/biome_service/src/file_handlers/md.rs:587-600 | crates/biome_service/src/file_handlers/yaml.rs:479-492 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/graphql.rs\u0060 and \u0060crates/biome_service/src/file_handlers/html.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 213 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_service/src/file_handlers/javascript.rs:1319\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_service/src/file_handlers/graphql.rs:579\u0060 calls \u0060tree\u0060 and \u0060crates/biome_service/src/file_handlers/javascript.rs:1319\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/graphql.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbae21bc8a39a8cd7d9b3722fdd90c5a37769db5a0abf9a7db678e0bb0842884"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 4): crates/biome_module_graph/src/db/type_inference/promise_classification.rs:831-844 | crates/biome_module_graph/src/db/type_inference/promise_classification.rs:875-887 | crates/biome_module_graph/src/db/type_inference/promise_classification.rs:895-907 | crates/biome_module_graph/src/db/type_inference/promise_classification.rs:1013-1026 \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/biome_module_graph/src/db/type_inference/promise_classification.rs:831\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_module_graph/src/db/type_inference/promise_classification.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"d71bdb05755d07a193613d0e7b799461bd1c429c5ab3145f8bb385a2d7af9f47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201314 lines \u00D7 3): crates/biome_graphql_formatter/src/graphql/definitions/enum_value_definition.rs:14-21 | crates/biome_graphql_formatter/src/graphql/definitions/field_definition.rs:17-30 | crates/biome_graphql_formatter/src/graphql/definitions/schema_definition.rs:15-28 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_graphql_formatter/src/graphql/definitions/enum_value_definition.rs:14\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026GraphqlEnumValueDefinition\u0060 in one and \u0060\u0026GraphqlFieldDefinition\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/biome_graphql_formatter/src/graphql/definitions/field_definition.rs:31\u0060 calls \u0060format\u0060 and \u0060crates/biome_graphql_formatter/src/graphql/definitions/schema_definition.rs:29\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/biome_graphql_formatter/src/graphql/definitions/enum_value_definition.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"b483040ba4f3f9d6b2acdf05f2457d20083b720433063f77d5fda24a4b1898db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/biome_html_parser/src/lexer/mod.rs:159-172 | crates/biome_html_parser/src/lexer/mod.rs:218-231 | crates/biome_html_parser/src/lexer/mod.rs:285-298 \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/biome_html_parser/src/lexer/mod.rs:159\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/biome_html_parser/src/lexer/mod.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"c595a77e69c36a8153a4657aa9c9e1455eb6afd7d8118f49ddabb9bca268a1ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 3): crates/biome_js_analyze/src/lint/correctness/no_unused_function_parameters.rs:235-246 | crates/biome_js_analyze/src/lint/correctness/no_unused_variables.rs:451-462 | crates/biome_js_analyze/src/lint/suspicious/no_parameters_only_used_in_recursion.rs:192-205 \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/biome_js_analyze/src/lint/correctness/no_unused_function_parameters.rs:235\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_js_analyze/src/lint/correctness/no_unused_function_parameters.rs:234\u0060 calls \u0060model\u0060 and \u0060crates/biome_js_analyze/src/lint/suspicious/no_parameters_only_used_in_recursion.rs:189\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/no_unused_function_parameters.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"7127bbec9d9805b29fd776216dc64abe36d71c81f4f93819cccac9d98d5a3d34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/biome_js_formatter/src/js/module/import_combined_clause.rs:26-39 | crates/biome_js_formatter/src/js/module/import_default_clause.rs:32-45 | crates/biome_js_formatter/src/js/module/import_namespace_clause.rs:32-45 \u2014 before extracting anything, compare \u0060crates/biome_js_formatter/src/js/module/import_default_clause.rs\u0060 and \u0060crates/biome_js_formatter/src/js/module/import_namespace_clause.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_formatter/src/js/module/import_combined_clause.rs:26\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_js_formatter/src/js/module/import_combined_clause.rs:23\u0060 calls \u0060format\u0060, \u0060space\u0060 and \u0060crates/biome_js_formatter/src/js/module/import_default_clause.rs:31\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/biome_js_formatter/src/js/module/import_combined_clause.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbea346639f1ed40527c6cea647b3202441893c0a25e68dcfee6a7b0e939a83e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/biome_service/src/file_handlers/graphql.rs:370-383 | crates/biome_service/src/file_handlers/html.rs:665-678 | crates/biome_service/src/file_handlers/json.rs:439-452 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/graphql.rs\u0060 and \u0060crates/biome_service/src/file_handlers/html.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 213 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_service/src/file_handlers/graphql.rs:370\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_service/src/file_handlers/graphql.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"865b627a32a85b024647599deac468042eaf3cf0e76ad475c82970988f390417"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/biome_css_analyze/src/lib.rs:231-244 | crates/biome_js_analyze/src/lib.rs:243-256 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_analyze/src/lib.rs:231\u0060 it begins part-way through the construct above it, so those exact 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/biome_css_analyze/src/lib.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b3988b8f68860bf16f9651ccbe98cc373a68086f4347f5473256b44870920d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/biome_css_analyze/src/lint/suspicious/no_useless_escape_in_string.rs:76-89 | crates/biome_js_analyze/src/lint/suspicious/no_useless_escape_in_string.rs:118-131 \u2014 before extracting anything, compare \u0060crates/biome_css_analyze/src/lint/suspicious/no_useless_escape_in_string.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/suspicious/no_useless_escape_in_string.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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/biome_css_analyze/src/lint/suspicious/no_useless_escape_in_string.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cc949158c0482bcb2cc7655e5a52b7fc999e2aa2813107e9c92abd4da974fb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/biome_css_analyze/src/services/semantic.rs:121-134 | crates/biome_js_analyze/src/services/semantic.rs:158-171 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060event\u0060 to \u0060\u0026WalkEvent\u003CCssSyntaxNode\u003E\u0060 in one and \u0060\u0026WalkEvent\u003CJsSyntaxNode\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_analyze/src/services/semantic.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"762d12f7a4f001834e6676bbc703e8af331e8a5489d28e55d48eaeb73336e78f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/biome_css_formatter/src/css/auxiliary/container_at_rule_declarator.rs:15-28 | crates/biome_css_formatter/src/tailwind/statements/source_at_rule.rs:10-25 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_formatter/src/css/auxiliary/container_at_rule_declarator.rs:15\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026CssContainerAtRuleDeclarator\u0060 in one and \u0060\u0026TwSourceAtRule\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/biome_css_formatter/src/css/auxiliary/container_at_rule_declarator.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc7a5a3ac42d847686c2a7eeff4d865612cc4502f86a7d57341348b3df3c4d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/biome_embeds/src/visitor.rs:99-112 | crates/biome_service/src/embed/html.rs:107-120 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_embeds/src/visitor.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"2395c26ac5046165745f4dff4903f662432ea605fa1b11836b9514171192579f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/biome_formatter/src/lib.rs:1242-1255 | crates/biome_formatter/src/lib.rs:1269-1282 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_formatter/src/lib.rs:1242\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/biome_formatter/src/lib.rs"},"region":{"startLine":1242}}}],"partialFingerprints":{"codehealthFindingId/v1":"66d59f1d1ace158bafe8c976e3ae7aa9105487213896cd637bdbf1032e1ee8bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/biome_graphql_analyze/src/assist/source/use_graphql_sorted_variables.rs:136-149 | crates/biome_graphql_analyze/src/utils.rs:94-107 \u2014 before extracting anything, compare \u0060crates/biome_graphql_analyze/src/assist/source/use_graphql_sorted_variables.rs\u0060 and \u0060crates/biome_graphql_analyze/src/utils.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_graphql_analyze/src/assist/source/use_graphql_sorted_variables.rs:136\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060GraphqlVariableDefinition\u0060 in one and \u0060N\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/biome_graphql_analyze/src/assist/source/use_graphql_sorted_variables.rs:150\u0060 calls \u0060variable_name\u0060 and \u0060crates/biome_graphql_analyze/src/utils.rs:108\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_graphql_analyze/src/assist/source/use_graphql_sorted_variables.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d71905f65291bad5326d706d03dce45a8d4d72506f772cd6f55058019ed035"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/biome_grit_formatter/src/grit/lists/list_pattern_list.rs:13-26 | crates/biome_json_formatter/src/json/lists/array_element_list.rs:32-45 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_grit_formatter/src/grit/lists/list_pattern_list.rs:13\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060\u0026mut GritFormatter\u0060 in one and \u0060\u0026mut JsonFormatter\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/biome_grit_formatter/src/grit/lists/list_pattern_list.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee42c34c6acb5e9bd321686dc5f2acca0fff363875ae23225be3e3acbf7db50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/biome_grit_patterns/src/grit_resolved_pattern.rs:164-177 | crates/biome_grit_patterns/src/grit_resolved_pattern.rs:257-270 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_grit_patterns/src/grit_resolved_pattern.rs:164\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_grit_patterns/src/grit_resolved_pattern.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"d586267d068384eaab2a8bb766d108e47a053f18f9c8e37b88c728bead77d295"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/biome_html_analyze/src/lint/a11y/no_ambiguous_anchor_text.rs:143-156 | crates/biome_js_analyze/src/lint/a11y/no_ambiguous_anchor_text.rs:154-167 \u2014 before extracting anything, compare \u0060crates/biome_html_analyze/src/lint/a11y/no_ambiguous_anchor_text.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/a11y/no_ambiguous_anchor_text.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026AnyHtmlTagElement\u0060 in one and \u0060\u0026AnyJsxElement\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/biome_html_analyze/src/lint/a11y/no_ambiguous_anchor_text.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ce850e3b97dd92cddf0dde3aa20eb5c0ba43dbc0895002d6fab13a8e8428c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/biome_html_analyze/src/lint/correctness/no_restricted_elements.rs:91-104 | crates/biome_js_analyze/src/lint/correctness/no_restricted_elements.rs:99-112 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_analyze/src/lint/correctness/no_restricted_elements.rs:91\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/biome_html_analyze/src/lint/correctness/no_restricted_elements.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"312e7a97252f2c2e6a2c01b0b9bfe3b24ada8be5b37e07dddcf0e18b8accfb13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/biome_html_analyze/src/lint/nursery/no_misplaced_list_elements.rs:151-164 | crates/biome_js_analyze/src/lint/nursery/no_misplaced_list_elements.rs:121-134 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/nursery/no_misplaced_list_elements.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ca64502fd1dd6736f4b1fc7fa048faa48f579e9a77d46e3931af2e6d522753"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/biome_html_analyze/src/lint/nursery/use_tailwind_shorthand_classes.rs:90-103 | crates/biome_js_analyze/src/lint/nursery/use_tailwind_shorthand_classes.rs:90-103 \u2014 before extracting anything, compare \u0060crates/biome_html_analyze/src/lint/nursery/use_tailwind_shorthand_classes.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/nursery/use_tailwind_shorthand_classes.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/nursery/use_tailwind_shorthand_classes.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"052dc604492d89f22bc46836ccc62651e58977376983826bd1a11cd95bb1a947"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/biome_html_analyze/src/lint/style/use_vue_hyphenated_attributes.rs:201-213 | crates/biome_html_analyze/src/lint/style/use_vue_hyphenated_attributes.rs:217-230 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_analyze/src/lint/style/use_vue_hyphenated_attributes.rs:217\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_html_analyze/src/lint/style/use_vue_hyphenated_attributes.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad3a15955550a1169fe9f2584fbaf275338cfdf57c69115cd919612bc9e6285b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/biome_html_parser/src/syntax/vue.rs:98-111 | crates/biome_html_parser/src/syntax/vue.rs:127-140 \u2014 both copies are in the same file, so extract the block into one function there 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/biome_html_parser/src/syntax/vue.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc631b39a081361a6fcc4f316689708861c993e2aae25b604afb39350a0ef2d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/biome_js_analyze/src/frameworks/mod.rs:24-37 | crates/biome_js_analyze/src/react.rs:219-232 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/frameworks/mod.rs:24\u0060 it does not close everything it opens, so those exact 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/biome_js_analyze/src/frameworks/mod.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8017e364e2f71fb856f7856db379c602cf287b83456b6b7ad00c7ccf42bd738"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/biome_js_analyze/src/lint/correctness/no_self_assign.rs:429-441 | crates/biome_js_analyze/src/lint/correctness/no_self_assign.rs:444-457 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060source\u0060 to \u0060\u0026JsComputedMemberAssignment\u0060 in one and \u0060\u0026JsComputedMemberExpression\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/biome_js_analyze/src/lint/correctness/no_self_assign.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c7bd4d9120ac64969d12d565c3967090cab955f2a8b631cfdbb4622ff59355"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/no_undeclared_classes.rs:142-155 | crates/biome_js_analyze/src/lint/nursery/no_undeclared_classes.rs:321-333 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_js_analyze/src/lint/nursery/no_undeclared_classes.rs:142\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/nursery/no_undeclared_classes.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"c865f0b6d4bf201d8c68d11f17c8ba8b523c9d0d226431adc61779d013bd774f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/no_undeclared_classes.rs:376-387 | crates/biome_js_analyze/src/lint/nursery/no_undeclared_classes.rs:518-531 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/nursery/no_undeclared_classes.rs:376\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/biome_js_analyze/src/lint/nursery/no_undeclared_classes.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb70a8c5dfb70cf8567f622bc303c2419c60879c313dd0857e2a772dee6ae8b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/use_nullish_coalescing.rs:565-578 | crates/biome_js_analyze/src/lint/nursery/use_nullish_coalescing.rs:608-621 \u2014 both copies are in the same file, so extract the block into one function there 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/biome_js_analyze/src/lint/nursery/use_nullish_coalescing.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"196eac637d54be8dfb436f7741a12cf7fcb14f095f93fc49fcdd613683eea0d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/biome_js_analyze/src/lint/style/use_export_type.rs:340-353 | crates/biome_js_analyze/src/lint/style/use_export_type.rs:374-387 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/style/use_export_type.rs:340\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/biome_js_analyze/src/lint/style/use_export_type.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f70214fe4d41f7435b6715d148ca20cf70a124e377327e14d407c3f0913a29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/biome_js_analyze/src/lint/suspicious/no_unnecessary_conditions.rs:625-638 | crates/biome_js_analyze/src/lint/suspicious/no_unnecessary_conditions.rs:708-721 \u2014 both copies are in the same file, so extract the block 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_js_analyze/src/lint/suspicious/no_unnecessary_conditions.rs:622\u0060 calls \u0060Ok\u0060, \u0060value_token\u0060 and \u0060crates/biome_js_analyze/src/lint/suspicious/no_unnecessary_conditions.rs:707\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/biome_js_analyze/src/lint/suspicious/no_unnecessary_conditions.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ef617d55b388613a6263f6ec0fcd77348aa3b1d0c88066961293154baa23690"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/biome_js_parser/src/syntax/expr.rs:1096-1109 | crates/biome_js_parser/src/syntax/function.rs:1491-1504 \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/biome_js_parser/src/syntax/expr.rs:1096\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_parser/src/syntax/expr.rs"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f7a6596c5ab8b9733c9c1abf3e56ce9a98511755012b8fc325eb61e3658e1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/biome_js_parser/src/syntax/program.rs:108-121 | crates/biome_js_parser/src/syntax/program.rs:135-148 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_js_parser/src/syntax/program.rs:108\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_js_parser/src/syntax/program.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"df160729394b7eadfbb8fba6bc8f4510a5d5496efeda87eecf171d674a37145c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/biome_js_semantic/src/events.rs:1231-1244 | crates/biome_js_semantic/src/events.rs:1245-1258 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_semantic/src/events.rs:1231\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_js_semantic/src/events.rs"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc85477dc859d203c838c3115e4dedf84d2f58002e7da1148dd61e99907d14a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/biome_js_syntax/src/parentheses/tstype.rs:68-81 | crates/biome_js_syntax/src/parentheses/tstype.rs:124-137 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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/biome_js_syntax/src/parentheses/tstype.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"f45e47b1ee91154081dbaa0dd8b2a79f3275f3821b3ad4bab7aa17538a9ed41d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/biome_js_transform/src/lib.rs:56-69 | crates/biome_migrate/src/lib.rs:63-76 \u2014 before extracting anything, compare \u0060crates/biome_js_transform/src/lib.rs\u0060 and \u0060crates/biome_migrate/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_transform/src/lib.rs:56\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_migrate/src/lib.rs:61\u0060 calls \u0060insert_service\u0060, \u0060IsRoot\u0060 and \u0060crates/biome_js_transform/src/lib.rs:54\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_transform/src/lib.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca8402d0cedd429d6e5ed2f6816486974808fd218eccb8ba1760b6ddc8cbaa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): crates/biome_js_type_info/src/format_inferred_type_info.rs:626-639 | crates/biome_js_type_info/src/format_type_info.rs:920-931 \u2014 before extracting anything, compare \u0060crates/biome_js_type_info/src/format_inferred_type_info.rs\u0060 and \u0060crates/biome_js_type_info/src/format_type_info.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 242 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_type_info/src/format_inferred_type_info.rs:626\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060\u0026mut Formatter\u003CFormatInferredTypeContext\u003C\u0027db\u003E\u003E\u0060 in one and \u0060\u0026mut Formatter\u003CFormatTypeContext\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/format_inferred_type_info.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"901399afeb0d68edec414023aad039772047c507224d4a1827f1d6c762e674fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/biome_js_type_info/src/format_inferred_type_info.rs:1248-1261 | crates/biome_js_type_info/src/format_type_info.rs:1131-1144 \u2014 before extracting anything, compare \u0060crates/biome_js_type_info/src/format_inferred_type_info.rs\u0060 and \u0060crates/biome_js_type_info/src/format_type_info.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 242 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060\u0026mut Formatter\u003CFormatInferredTypeContext\u003C\u0027db\u003E\u003E\u0060 in one and \u0060\u0026mut biome_formatter::formatter::Formatter\u003CFormatTypeContext\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/format_inferred_type_info.rs"},"region":{"startLine":1248}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c2d04162b8771d8343b01d42a3bde94a4577134cfdb8de7572b435a2115b3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/biome_js_type_info/src/format_type_info.rs:752-765 | crates/biome_js_type_info/src/format_type_info.rs:958-971 \u2014 both copies are in the same file, so extract the block into one function there 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/biome_js_type_info/src/format_type_info.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc6948cc2b533ae288f65c30e457038322f53739b240748c2685ddb3b8f455d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/biome_markdown_parser/src/lexer/mod.rs:912-925 | crates/biome_markdown_parser/src/lexer/mod.rs:973-986 \u2014 both copies are in the same file, so extract the block into one function there 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/biome_markdown_parser/src/lexer/mod.rs"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc8ce12a449b7411e26807e4b1f29df38d979b618168755ba841abad01cb46c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/biome_markdown_parser/src/syntax/list.rs:1526-1539 | crates/biome_markdown_parser/src/syntax/list.rs:1568-1581 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_markdown_parser/src/syntax/list.rs:1526\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_markdown_parser/src/syntax/list.rs:1523\u0060 calls \u0060find\u0060, \u0060map_or\u0060 and \u0060crates/biome_markdown_parser/src/syntax/list.rs:1566\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/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":1526}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02b9f8fb4088b23f625b2d838f13c7d6a0098d783e46a9c672473028df8584c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/biome_module_graph/src/db/type_inference/expressions.rs:1292-1305 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1331-1344 \u2014 both copies are in the same file, so extract the block into one function there 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/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"51cd03660d076dd1b23efe3279f2eea68d20bd2c167a536efca03ec3777ce61f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/biome_parser/src/parse_lists.rs:153-166 | crates/biome_tailwind_parser/src/syntax/variant.rs:51-64 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_parser/src/parse_lists.rs:153\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/biome_parser/src/parse_lists.rs:168\u0060 calls \u0060allow_trailing_separating_element\u0060, \u0060is_at_list_end\u0060 and \u0060crates/biome_tailwind_parser/src/syntax/variant.rs:65\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/biome_parser/src/parse_lists.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"109fab64a418ebfbc793a1aaa184852daeaf09d8c89cd2521fe6d19b7c877576"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/biome_react_compiler/src/convert_ast/identifiers.rs:102-115 | crates/biome_react_compiler/src/convert_ast/identifiers.rs:292-305 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_react_compiler/src/convert_ast/identifiers.rs:102\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/biome_react_compiler/src/convert_ast/identifiers.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f278473cacf9e8390a779e2b5a0bbc4cadbc90421dcbeed502309c21cf6d519"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/biome_react_compiler/src/convert_ast/modules.rs:395-408 | crates/biome_react_compiler/src/convert_ast/statements.rs:332-345 \u2014 before extracting anything, compare \u0060crates/biome_react_compiler/src/convert_ast/modules.rs\u0060 and \u0060crates/biome_react_compiler/src/convert_ast/statements.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_react_compiler/src/convert_ast/modules.rs:395\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060class\u0060 to \u0060\u0026JsClassExportDefaultDeclaration\u0060 in one and \u0060\u0026JsClassDeclaration\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/biome_react_compiler/src/convert_ast/modules.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab7a8b974fd0b0e0652c8fef1215018fdc7f50d715f92385f367349fa0515c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/biome_rowan/src/syntax/token.rs:305-318 | crates/biome_rowan/src/syntax/token.rs:336-349 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_rowan/src/syntax/token.rs:305\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_rowan/src/syntax/token.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"4387beb404f96ac876e63d0c9a8613328905b293a9c5b6ba2f1e2bc38a4ac378"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/biome_service/src/file_handlers/javascript/go_to.rs:244-257 | crates/biome_service/src/file_handlers/javascript/go_to.rs:275-288 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_service/src/file_handlers/javascript/go_to.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/javascript/go_to.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"222c44a3f31de3a5bbf523576736457308a7badbdf1d96dfeccb41b38ea9105b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/biome_service/src/file_handlers/json.rs:875-888 | crates/biome_service/src/file_handlers/json.rs:922-935 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_service/src/file_handlers/json.rs:875\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_service/src/file_handlers/json.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6216eaaa81977344663bbf45efbebd5ce9bf769765adffeac38cd45e3949e59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/biome_service/src/file_handlers/md.rs:390-403 | crates/biome_service/src/file_handlers/yaml.rs:348-361 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/md.rs\u0060 and \u0060crates/biome_service/src/file_handlers/yaml.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 248 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_service/src/file_handlers/md.rs:390\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/md.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"a613f96c2f722d19f08b7abd55a8b7f1dfd151cae912da050b78b49ced6e9140"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/biome_yaml_formatter/src/yaml/auxiliary/folded_scalar.rs:11-24 | crates/biome_yaml_formatter/src/yaml/auxiliary/literal_scalar.rs:11-24 \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/biome_yaml_formatter/src/yaml/auxiliary/folded_scalar.rs:11\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026YamlFoldedScalar\u0060 in one and \u0060\u0026YamlLiteralScalar\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/biome_yaml_formatter/src/yaml/auxiliary/folded_scalar.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea0e36917c1633380fd9f18814b698e203a7f884e9481b9b0bd0072bdb248495"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): xtask/codegen/src/generate_configuration.rs:699-712 | xtask/codegen/src/generate_configuration.rs:856-869 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"xtask/codegen/src/generate_configuration.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c43561faae32398a8312925bff56256c16f6c7e898e23c1cb6b8ec194a05200"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 7): crates/biome_service/src/file_handlers/css.rs:698-710 | crates/biome_service/src/file_handlers/graphql.rs:587-599 | crates/biome_service/src/file_handlers/html.rs:1109-1121 | crates/biome_service/src/file_handlers/javascript.rs:1326-1338 | crates/biome_service/src/file_handlers/json.rs:657-669 | crates/biome_service/src/file_handlers/md.rs:595-607 | crates/biome_service/src/file_handlers/yaml.rs:487-499 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/css.rs\u0060 and \u0060crates/biome_service/src/file_handlers/graphql.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 202 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_service/src/file_handlers/css.rs:698\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_service/src/file_handlers/css.rs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"d496d9b3536a5617939efec7495ae32b68c08c7a2020faf11305bf8ff36b8a45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 6): crates/biome_css_analyze/src/suppression.rs:15-27 | crates/biome_graphql_analyze/src/suppression.rs:15-27 | crates/biome_html_analyze/src/suppression.rs:15-27 | crates/biome_js_analyze/src/suppression.rs:15-27 | crates/biome_json_analyze/src/suppression.rs:15-27 | crates/biome_yaml_analyze/src/suppression.rs:15-27 \u2014 before extracting anything, compare \u0060crates/biome_css_analyze/src/suppression.rs\u0060 and \u0060crates/biome_graphql_analyze/src/suppression.rs\u0060 as WHOLE FILES: 90% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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/biome_css_analyze/src/suppression.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea15ee6ffe57343d673090cbce5f7c05da132926ad1d6d49cc2b3aae8a492486"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 5): crates/biome_css_formatter/src/comments.rs:52-64 | crates/biome_graphql_formatter/src/comments.rs:24-36 | crates/biome_grit_formatter/src/comments.rs:40-52 | crates/biome_js_formatter/src/comments.rs:39-51 | crates/biome_json_formatter/src/comments.rs:25-37 \u2014 before extracting anything, compare \u0060crates/biome_css_formatter/src/comments.rs\u0060 and \u0060crates/biome_js_formatter/src/comments.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_formatter/src/comments.rs:52\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060comment\u0060 to \u0060\u0026SourceComment\u003CCssLanguage\u003E\u0060 in one and \u0060\u0026SourceComment\u003CGraphqlLanguage\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_formatter/src/comments.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e670b82dcf03f4a9636d3cc4c6b1a57d47961e16f3a56604e9ae7f04f34010"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): crates/biome_cli/src/execute/migrate.rs:265-277 | crates/biome_cli/src/execute/migrate.rs:345-357 | crates/biome_cli/src/execute/migrate.rs:430-442 | crates/biome_cli/src/execute/migrate.rs:519-531 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/execute/migrate.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"b956d62e4bde78ebc77549d0d55db0b4a876e37d783bb2a54b7efabda1206ba6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): crates/biome_css_analyze/src/lib.rs:282-294 | crates/biome_graphql_analyze/src/lib.rs:131-143 | crates/biome_json_analyze/src/lib.rs:205-217 | crates/biome_yaml_analyze/src/lib.rs:131-143 \u2014 before extracting anything, compare \u0060crates/biome_graphql_analyze/src/lib.rs\u0060 and \u0060crates/biome_yaml_analyze/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_analyze/src/lib.rs:282\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_analyze/src/lib.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"faef95535c81584dc732d7113036de330bb6fef7643a41de33e40e7ca20b601d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): crates/biome_graphql_analyze/src/lib.rs:124-136 | crates/biome_html_analyze/src/lib.rs:307-319 | crates/biome_markdown_analyze/src/lib.rs:183-195 | crates/biome_yaml_analyze/src/lib.rs:124-136 \u2014 before extracting anything, compare \u0060crates/biome_graphql_analyze/src/lib.rs\u0060 and \u0060crates/biome_yaml_analyze/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_graphql_analyze/src/lib.rs:124\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/biome_graphql_analyze/src/lib.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c35fc4c47e7bfa87321c3888476f2a3d5146a30a67c9dbbd763aeade065b01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 4): crates/biome_js_analyze/src/lint/nursery/no_tailwind_legacy_utilities.rs:127-137 | crates/biome_js_analyze/src/lint/nursery/no_tailwind_restricted_classes.rs:239-249 | crates/biome_js_analyze/src/lint/nursery/use_tailwind_shorthand_classes.rs:143-155 | crates/biome_js_analyze/src/lint/nursery/use_tailwind_variables_shorthand.rs:99-109 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/nursery/no_tailwind_legacy_utilities.rs:127\u0060 it does not close everything it opens, so those exact 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/biome_js_analyze/src/lint/nursery/no_tailwind_legacy_utilities.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f410c666b4a9f4f856308c445eed235e3f90573e2ca174bb84f7fb2c8c7f91d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): crates/biome_service/src/file_handlers/css.rs:719-731 | crates/biome_service/src/file_handlers/css.rs:924-936 | crates/biome_service/src/file_handlers/css.rs:984-996 | crates/biome_service/src/file_handlers/css.rs:1054-1066 \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/biome_service/src/file_handlers/css.rs:719\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/biome_service/src/file_handlers/css.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"282b237e8ec0049007a9f40ac9ff55735c40c9df5febe8b6d31753f2d698250d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): crates/biome_service/src/file_handlers/graphql.rs:789-801 | crates/biome_service/src/file_handlers/html.rs:1512-1524 | crates/biome_service/src/file_handlers/md.rs:830-842 | crates/biome_service/src/file_handlers/yaml.rs:684-696 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/graphql.rs\u0060 and \u0060crates/biome_service/src/file_handlers/html.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 213 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_service/src/file_handlers/graphql.rs:789\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/biome_service/src/file_handlers/graphql.rs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"d626331b685e1c9cf83524ef008fca218335e15aee3a4b23041142ee09105964"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/biome_grit_formatter/src/grit/auxiliary/within.rs:10-22 | crates/biome_grit_formatter/src/grit/patterns/pattern_contains.rs:10-22 | crates/biome_js_formatter/src/ts/types/infer_type.rs:13-25 \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/biome_grit_formatter/src/grit/auxiliary/within.rs:10\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026GritWithin\u0060 in one and \u0060\u0026GritPatternContains\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/biome_grit_formatter/src/grit/auxiliary/within.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"1120b02c046fc8e0eda740d03edbcfff3a85459a6c97efd29aa9b1719fcf26e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/biome_html_parser/src/lexer/mod.rs:136-148 | crates/biome_html_parser/src/lexer/mod.rs:196-208 | crates/biome_html_parser/src/lexer/mod.rs:266-278 \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/biome_html_parser/src/lexer/mod.rs:136\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/biome_html_parser/src/lexer/mod.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6596fdfd0bfa8628f205629458a16bd967319b4a125c8181b2479c8df204549"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/biome_js_analyze/src/lint/complexity/use_regex_literals.rs:301-313 | crates/biome_js_analyze/src/lint/style/use_named_capture_group.rs:166-178 | crates/biome_js_analyze/src/lint/style/use_unicode_regex.rs:316-328 \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. 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/biome_js_analyze/src/lint/complexity/use_regex_literals.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"943ebb8dbad41fc05c7f52b45755a143f78c1fcec402c983b4e8067d6e375202"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): crates/biome_js_analyze/src/lint/correctness/use_react_async_server_function.rs:157-168 | crates/biome_js_analyze/src/lint/correctness/use_react_async_server_function.rs:170-181 | crates/biome_js_analyze/src/lint/correctness/use_react_async_server_function.rs:184-196 \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/biome_js_analyze/src/lint/correctness/use_react_async_server_function.rs:184\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/correctness/use_react_async_server_function.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a53871f1ba5a6a8ed66d90b0d450e94d93ccf898f8b78a9e4ebcd50799d386e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/biome_js_analyze/src/lint/nursery/no_tanstack_query_void_query_fn.rs:341-353 | crates/biome_js_analyze/src/lint/nursery/use_vue_render_return.rs:154-166 | crates/biome_js_analyze/src/lint/suspicious/no_fallthrough_switch_clause.rs:265-277 \u2014 before extracting anything, compare \u0060crates/biome_js_analyze/src/lint/nursery/no_tanstack_query_void_query_fn.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/nursery/use_vue_render_return.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/nursery/no_tanstack_query_void_query_fn.rs:341\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/nursery/no_tanstack_query_void_query_fn.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c114a43074cf56cd8e0d1bbed010065a7de59d9458e615e546e7725de39913"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): crates/biome_js_analyze/src/lint/style/use_export_type.rs:324-336 | crates/biome_js_analyze/src/lint/style/use_export_type.rs:358-370 | crates/biome_js_analyze/src/lint/style/use_import_type.rs:505-516 \u2014 before extracting anything, compare \u0060crates/biome_js_analyze/src/lint/style/use_export_type.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/style/use_import_type.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/style/use_export_type.rs:324\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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/biome_js_analyze/src/lint/style/use_export_type.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf4a913767a9519545eb6b0f83cdca281c0bed2fa8f4301ee6d704a1699360a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): crates/biome_js_analyze/src/lint/style/use_import_type.rs:559-571 | crates/biome_js_analyze/src/lint/style/use_import_type.rs:582-593 | crates/biome_js_analyze/src/lint/style/use_import_type.rs:698-710 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/style/use_import_type.rs:559\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/style/use_import_type.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce86d73bf310787d6062df85ee8475c3c8322c034bf1a607e58bdbcffefd2eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/biome_js_analyze/src/lint/style/use_number_namespace.rs:213-225 | crates/biome_js_analyze/src/lint/suspicious/no_global_is_finite.rs:107-119 | crates/biome_js_analyze/src/lint/suspicious/no_global_is_nan.rs:108-120 \u2014 before extracting anything, compare \u0060crates/biome_js_analyze/src/lint/suspicious/no_global_is_finite.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/suspicious/no_global_is_nan.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 78 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/style/use_number_namespace.rs:213\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/biome_js_analyze/src/lint/style/use_number_namespace.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb04beabad04a17e3adac7b7d5cb9d01dea5bfad4f45bb0ba5e07eed969cbd34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): crates/biome_markdown_parser/src/syntax/header.rs:306-317 | crates/biome_markdown_parser/src/syntax/inline/emphasis.rs:823-835 | crates/biome_markdown_parser/src/syntax/mod.rs:1715-1727 \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/biome_markdown_parser/src/syntax/header.rs:306\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_markdown_parser/src/syntax/header.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d57142144ff342f53b0604beed5b5e703fc9fe700a662c08966b33cd020896"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/biome_module_graph/src/db/type_inference/expressions.rs:873-885 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1498-1510 | crates/biome_module_graph/src/db/type_inference/lookup.rs:581-593 \u2014 before extracting anything, compare \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs\u0060 and \u0060crates/biome_module_graph/src/db/type_inference/lookup.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 234 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/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6fb660832508991757392f442bb77a8c6823e7b3b619966cc52ea55b6b4c08d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/biome_service/src/file_handlers/css.rs:1006-1018 | crates/biome_service/src/file_handlers/javascript.rs:1675-1687 | crates/biome_service/src/file_handlers/json.rs:936-948 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/css.rs\u0060 and \u0060crates/biome_service/src/file_handlers/javascript.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 211 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_service/src/file_handlers/css.rs:1006\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_service/src/file_handlers/css.rs"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"c743c819b101753d9203e68e16747454f4db4b2a2e11ea8a39678d439eca4ef9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): crates/biome_service/src/settings.rs:507-518 | crates/biome_service/src/settings.rs:569-581 | crates/biome_service/src/settings.rs:605-616 \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/biome_service/src/settings.rs:507\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/biome_service/src/settings.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"2003d263cec34956d6bf0e99f7b8f131ffe2e0e513cf471f4dbece1c0d67848d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/biome_cli/src/runner/impls/process_file/format.rs:78-89 | crates/biome_cli/src/runner/impls/process_file/lint_and_assist.rs:104-116 \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/biome_cli/src/runner/impls/process_file/format.rs:78\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_cli/src/runner/impls/process_file/lint_and_assist.rs:102\u0060 calls \u0060Some\u0060, \u0060clone\u0060 and \u0060crates/biome_cli/src/runner/impls/process_file/format.rs:77\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/biome_cli/src/runner/impls/process_file/format.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c37049d8cd1e5f5cdb9b84f7e46d5131bb5ca424118375c54266092a94f0a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/biome_configuration_macros/src/group_struct.rs:222-233 | crates/biome_configuration_macros/src/group_struct.rs:327-339 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_configuration_macros/src/group_struct.rs:222\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_configuration_macros/src/group_struct.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d7aba249cecee086ad3479a3033b6b46f88da90cbf67813e53cbb80c9a71374"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/biome_css_analyze/src/lib.rs:268-280 | crates/biome_js_analyze/src/lib.rs:266-278 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_analyze/src/lib.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d4abb0e2cd45c042d907814c634bc503c2b896c39ed998d450171397a9fad3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/biome_css_formatter/src/css/auxiliary/list_of_component_values_expression.rs:17-29 | crates/biome_css_formatter/src/scss/auxiliary/expression.rs:13-25 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_formatter/src/css/auxiliary/list_of_component_values_expression.rs:17\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026CssListOfComponentValuesExpression\u0060 in one and \u0060\u0026ScssExpression\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/biome_css_formatter/src/css/auxiliary/list_of_component_values_expression.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e49930088bfd0c8b5e916776bee5b884ecafd592a516b4c53f3369a6fc2b081"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/biome_css_formatter/src/css/auxiliary/nested_qualified_rule.rs:11-23 | crates/biome_css_formatter/src/css/auxiliary/qualified_rule.rs:11-23 \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/biome_css_formatter/src/css/auxiliary/nested_qualified_rule.rs:11\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026CssNestedQualifiedRule\u0060 in one and \u0060\u0026CssQualifiedRule\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/biome_css_formatter/src/css/auxiliary/nested_qualified_rule.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac8a89fab484b633a1d591dfde5d26ef45f9fde3e62d0fe92baebb25177aa08f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/biome_css_formatter/src/css/auxiliary/root.rs:11-23 | crates/biome_graphql_formatter/src/graphql/auxiliary/root.rs:10-22 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_formatter/src/css/auxiliary/root.rs:11\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060\u0026mut CssFormatter\u0060 in one and \u0060\u0026mut GraphqlFormatter\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/biome_css_formatter/src/css/auxiliary/root.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad0062457a3ca2d12f80966523ce0a4b3d23f20093ca7a8f65a5d4fd4b80dff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/biome_css_formatter/src/utils/string_utils.rs:263-275 | crates/biome_js_formatter/src/utils/string_utils.rs:336-348 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_formatter/src/utils/string_utils.rs:263\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_css_formatter/src/utils/string_utils.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2034aabbb448a727dc239d541f6e9ddaf83261a7f3d062fa71de1d4dba30b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/biome_graphql_analyze/src/lib.rs:109-121 | crates/biome_yaml_analyze/src/lib.rs:109-121 \u2014 before extracting anything, compare \u0060crates/biome_graphql_analyze/src/lib.rs\u0060 and \u0060crates/biome_yaml_analyze/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_graphql_analyze/src/lib.rs:109\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_graphql_analyze/src/lib.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"4baa5cdeac28e6f7703886dfa31c8c4f5e293ce7836c28e9c28f5c7ce1d1915f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/biome_graphql_parser/src/parser/definitions/interface.rs:56-68 | crates/biome_graphql_parser/src/parser/definitions/object.rs:45-57 \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/biome_graphql_parser/src/parser/definitions/interface.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"b964c38e1bcecea909c2604d3603bfb7ddfa8b12ad01c7e2b5ab9a7d94f220d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/biome_grit_patterns/src/pattern_compiler/accumulate_compiler.rs:17-29 | crates/biome_grit_patterns/src/pattern_compiler/accumulate_compiler.rs:40-52 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_grit_patterns/src/pattern_compiler/accumulate_compiler.rs:17\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/biome_grit_patterns/src/pattern_compiler/accumulate_compiler.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e00f8bce28b8978f5bbdf91088e7c54e2439801d87b74172b927c09c254c1ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/biome_html_analyze/src/lint/a11y/no_noninteractive_element_to_interactive_role.rs:110-122 | crates/biome_js_analyze/src/lint/a11y/no_noninteractive_element_to_interactive_role.rs:118-130 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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/biome_html_analyze/src/lint/a11y/no_noninteractive_element_to_interactive_role.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"55a994d2575ac3adf937512962e3068517cb1e8b15ab161ce227a777bda34aa3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/biome_html_analyze/src/lint/a11y/no_svg_without_title.rs:174-186 | crates/biome_js_analyze/src/lint/a11y/no_svg_without_title.rs:170-182 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/a11y/no_svg_without_title.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ebb0f6928df724f45a503f30efe89eaabc52c96ac4fe498b1ded8c9fe115fab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/biome_html_analyze/src/lint/a11y/use_aria_props_for_role.rs:104-116 | crates/biome_js_analyze/src/lint/a11y/use_aria_props_for_role.rs:116-128 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_analyze/src/lint/a11y/use_aria_props_for_role.rs:104\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/biome_html_analyze/src/lint/a11y/use_aria_props_for_role.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eee317b355393c3de2591ad9f6e04cb2e2c5ebbc977a545a7106a26660d174a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/biome_html_analyze/src/lint/nursery/no_astro_conflicting_set_directives.rs:123-135 | crates/biome_js_analyze/src/lint/nursery/no_astro_conflicting_set_directives.rs:117-129 \u2014 before extracting anything, compare \u0060crates/biome_html_analyze/src/lint/nursery/no_astro_conflicting_set_directives.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/nursery/no_astro_conflicting_set_directives.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_analyze/src/lint/nursery/no_astro_conflicting_set_directives.rs:123\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_html_analyze/src/lint/nursery/no_astro_conflicting_set_directives.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"765d8b28a1af58e341956f3b7679b76755508a23e8760e143c5df35da4b43dff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/biome_html_analyze/src/lint/nursery/no_disabled_attribute.rs:287-299 | crates/biome_html_analyze/src/lint/nursery/no_disabled_attribute.rs:330-341 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_html_analyze/src/lint/nursery/no_disabled_attribute.rs:287\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_html_analyze/src/lint/nursery/no_disabled_attribute.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b7844b5522a19e796b73333ef133290fc59f2e9862d1bba103ff3eb6e30447f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): crates/biome_html_analyze/src/lint/nursery/no_tailwind_restricted_classes.rs:230-240 | crates/biome_js_analyze/src/lint/nursery/no_tailwind_restricted_classes.rs:229-241 \u2014 before extracting anything, compare \u0060crates/biome_html_analyze/src/lint/nursery/no_tailwind_restricted_classes.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/nursery/no_tailwind_restricted_classes.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/nursery/no_tailwind_restricted_classes.rs:229\u0060 it does not close everything it opens, so those exact 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/biome_html_analyze/src/lint/nursery/no_tailwind_restricted_classes.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"2502329d87e479bc2cbba9bb5a00d7ff6591ebac7bd24ebde697389db68df4dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/biome_html_analyze/src/lint/nursery/no_undeclared_classes.rs:260-271 | crates/biome_service/src/file_handlers/html/go_to.rs:44-56 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_analyze/src/lint/nursery/no_undeclared_classes.rs:260\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_html_analyze/src/lint/nursery/no_undeclared_classes.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"883bd52799eb10156dd45730a3cea6b619543abecb94b589d9048c6d23f8bc30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/biome_html_analyze/src/lint/nursery/use_tailwind_variables_shorthand.rs:84-96 | crates/biome_js_analyze/src/lint/nursery/use_tailwind_variables_shorthand.rs:83-95 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/nursery/use_tailwind_variables_shorthand.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"420887d9d7aa60d5233ecadc18b7dd3416d4a31dd05f7469a630f79c8e13d3ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/biome_html_analyze/src/lint/security/use_iframe_sandbox.rs:62-74 | crates/biome_js_analyze/src/lint/security/use_iframe_sandbox.rs:82-94 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_analyze/src/lint/security/use_iframe_sandbox.rs:62\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_html_analyze/src/lint/security/use_iframe_sandbox.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"31115e5e7e48f7c25eeb340abbbfa87772001a18d65a389d645632fb4e1723ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/biome_js_analyze/src/lint/complexity/no_useless_fragments.rs:531-543 | crates/biome_js_analyze/src/lint/style/use_fragment_syntax.rs:53-64 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/complexity/no_useless_fragments.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"b199dd802570504c7ee18f3db365a3ffe1cd1a5f2a87c697e16b55bd990365f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/use_explicit_return_type.rs:918-930 | crates/biome_js_analyze/src/lint/nursery/use_explicit_type.rs:896-908 \u2014 before extracting anything, compare \u0060crates/biome_js_analyze/src/lint/nursery/use_explicit_return_type.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/nursery/use_explicit_type.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 80 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/nursery/use_explicit_return_type.rs:918\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/nursery/use_explicit_return_type.rs"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"983b175eaa7538046ed17a423b9da7162aa6a5e094aa34ba8d74fb06976c0306"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/biome_js_analyze/src/lint/suspicious/no_undeclared_env_vars.rs:174-185 | crates/biome_js_analyze/src/lint/suspicious/no_undeclared_env_vars.rs:199-211 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/no_undeclared_env_vars.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"60a3f4eb1e074f1c97f03f2011dbc8873c3ba239ca0388b66e85d0b5f9ffce29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/biome_js_formatter/src/comments.rs:955-967 | crates/biome_js_formatter/src/comments.rs:1042-1054 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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/biome_js_formatter/src/comments.rs"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f868e2c1248b2567010f557352b6aeee61d47773d3a1aeb5f4660dbe2532287"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/biome_js_formatter/src/js/statements/break_statement.rs:15-27 | crates/biome_js_formatter/src/js/statements/continue_statement.rs:15-27 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_formatter/src/js/statements/break_statement.rs:15\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026JsBreakStatement\u0060 in one and \u0060\u0026JsContinueStatement\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/biome_js_formatter/src/js/statements/break_statement.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"a901564c459a52eebbacd37017a372ed68f6977c233d121bcffb4d68f17b8417"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/biome_js_formatter/src/js/statements/if_statement.rs:28-40 | crates/biome_js_formatter/src/js/statements/while_statement.rs:21-33 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_formatter/src/js/statements/if_statement.rs:28\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/js/statements/if_statement.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a32ab10074b1dc656a51c86c5c1083c9287ee8c2a84be370b778dc507d6f971"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/biome_js_type_info/src/format_inferred_type_info.rs:1270-1282 | crates/biome_js_type_info/src/format_type_info.rs:1156-1168 \u2014 before extracting anything, compare \u0060crates/biome_js_type_info/src/format_inferred_type_info.rs\u0060 and \u0060crates/biome_js_type_info/src/format_type_info.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 242 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060\u0026mut Formatter\u003CFormatInferredTypeContext\u003C\u0027db\u003E\u003E\u0060 in one and \u0060\u0026mut biome_formatter::formatter::Formatter\u003CFormatTypeContext\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/format_inferred_type_info.rs"},"region":{"startLine":1270}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8517eaee70d6b935b60f6f3da9ae6ad2308a51d6e723c8fa9ccd9765793e89e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/biome_js_type_info/src/local_inference.rs:1048-1060 | crates/biome_js_type_info/src/local_inference.rs:1430-1442 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_js_type_info/src/local_inference.rs:1048\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060decl\u0060 to \u0060\u0026JsFunctionDeclaration\u0060 in one and \u0060\u0026TsDeclareFunctionDeclaration\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/biome_js_type_info/src/local_inference.rs"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0173f05460b4c7b421258f5061c0e52d0d9fa0b8df969ed2826a8606b825223"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/biome_json_analyze/src/lib.rs:160-171 | crates/biome_markdown_analyze/src/lib.rs:162-174 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_json_analyze/src/lib.rs:160\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/biome_markdown_analyze/src/lib.rs:176\u0060 calls \u0060insert_service\u0060 and \u0060crates/biome_json_analyze/src/lib.rs:173\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/biome_json_analyze/src/lib.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"12fdaaef02b9f8cc5cce1963c3c059fb8a2d4609e90a39e7c7e2b64443b03ab2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): crates/biome_markdown_formatter/src/markdown/auxiliary/fenced_code_block.rs:48-58 | crates/biome_markdown_formatter/src/markdown/auxiliary/fenced_code_block.rs:118-130 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_markdown_formatter/src/markdown/auxiliary/fenced_code_block.rs:118\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/biome_markdown_formatter/src/markdown/auxiliary/fenced_code_block.rs:132\u0060 calls \u0060Some\u0060 and \u0060crates/biome_markdown_formatter/src/markdown/auxiliary/fenced_code_block.rs:60\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/biome_markdown_formatter/src/markdown/auxiliary/fenced_code_block.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"33985ed3480bbd3c279b51c9aa024641f84c16426fc2aa021746deb0fbfa1148"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/biome_markdown_parser/src/syntax/mod.rs:2338-2351 | crates/biome_markdown_parser/src/syntax/mod.rs:2391-2404 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_markdown_parser/src/syntax/mod.rs:2338\u0060 it begins part-way through the construct above it, so those exact 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/biome_markdown_parser/src/syntax/mod.rs"},"region":{"startLine":2338}}}],"partialFingerprints":{"codehealthFindingId/v1":"4583997863dcb262812c3ebffd9da40229865683680426c0a20575ca6e5f8ef2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/biome_module_graph/src/db/queries.rs:78-90 | crates/biome_module_graph/src/db/queries.rs:187-199 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_module_graph/src/db/queries.rs:78\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/biome_module_graph/src/db/queries.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed442bce5361024a5734fc3ab0076614a2e950a65b9fd67686ffac40d5164e78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): crates/biome_module_graph/src/db/queries/css.rs:199-209 | crates/biome_module_graph/src/db/queries/css.rs:258-270 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_module_graph/src/db/queries/css.rs:199\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/queries/css.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d1db20267b2faaa0dc50afb407dd7930b4bd7dc2e60aa7225ac4fd0b2cffbf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/biome_module_graph/src/format_module_graph.rs:54-66 | crates/biome_module_graph/src/format_module_graph.rs:608-620 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_module_graph/src/format_module_graph.rs:54\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/biome_module_graph/src/format_module_graph.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc45a7910b2670e3f78fe5ae254fb2f796f37edb17dd13a648e861bb7707495b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/biome_package/src/node_js_package/turbo_json.rs:197-209 | crates/biome_package/src/node_js_package/turbo_json.rs:213-225 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_package/src/node_js_package/turbo_json.rs:197\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_package/src/node_js_package/turbo_json.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bae3212bcbbf2300e5629388954299404b634eadfa5a3494f4a2474fd31638e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/biome_react_compiler/src/convert_ast/expressions.rs:872-884 | crates/biome_react_compiler/src/convert_ast/modules.rs:384-396 \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/biome_react_compiler/src/convert_ast/expressions.rs:872\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060class\u0060 to \u0060\u0026JsClassExpression\u0060 in one and \u0060\u0026JsClassExportDefaultDeclaration\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/biome_react_compiler/src/convert_ast/expressions.rs"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"205121c2465def60a2a4351a6bb20fb7869c92dea6a7ccc370bd83b06dfe3c8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/biome_resolver/src/lib.rs:234-245 | crates/biome_resolver/src/lib.rs:289-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_resolver/src/lib.rs:234\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_resolver/src/lib.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2a2178d15faa3e4c7e7d2ce89776620a71d0fa9ce9b6a3ecce7f70113f7c803"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/biome_service/src/db/mod.rs:586-598 | crates/biome_service/src/db/mod.rs:1460-1472 \u2014 both copies are in the same file, so extract the block 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/biome_service/src/db/mod.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"05929736bf139d13a798c3bf448bac639e86d1bae1e136c6958b52caa1f319e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/biome_service/src/file_handlers/html.rs:397-409 | crates/biome_service/src/file_handlers/json.rs:221-233 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/html.rs\u0060 and \u0060crates/biome_service/src/file_handlers/json.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 141 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/biome_service/src/file_handlers/html.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"65bf49468e2869980bf55c444604222d6bc91dfae8b3a12756e333b3f8449441"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/biome_service/src/file_handlers/html.rs:655-667 | crates/biome_service/src/file_handlers/javascript.rs:661-672 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/html.rs\u0060 and \u0060crates/biome_service/src/file_handlers/javascript.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 202 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_service/src/file_handlers/html.rs:655\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_service/src/file_handlers/html.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb94f51e834a8fecc4a8b03b0313dd5ab8a81a072a873de2016f949d23213951"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 2): crates/biome_service/src/file_handlers/html/parse_embedded_nodes.rs:122-131 | crates/biome_service/src/file_handlers/html/parse_embedded_nodes.rs:427-439 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_service/src/file_handlers/html/parse_embedded_nodes.rs:122\u0060 it does not close everything it opens, so those exact 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/biome_service/src/file_handlers/html/parse_embedded_nodes.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ec2e22e09f90dbf5e3ca6f90ab2ccfdf9f84aa4aeef44da881fcbc13dfd8cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/biome_service/src/file_handlers/javascript.rs:1095-1107 | crates/biome_service/src/file_handlers/javascript.rs:1161-1173 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_service/src/file_handlers/javascript.rs:1095\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_service/src/file_handlers/javascript.rs"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"004fd62dc9d052443afe0d6e98c92c5a1d94db5f98a9e3eeb1bc8180e460217d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): xtask/codegen/src/generate_bindings.rs:419-431 | xtask/codegen/src/generate_js_plugin_ast.rs:522-534 \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":"xtask/codegen/src/generate_bindings.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"834873e878ac84bb24e44196c9aef2fb1e2eb40a9a2f9005f77658353151256a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): xtask/codegen/src/generate_migrate_eslint.rs:134-146 | xtask/codegen/src/generate_migrate_stylelint.rs:143-155 \u2014 before extracting anything, compare \u0060xtask/codegen/src/generate_migrate_eslint.rs\u0060 and \u0060xtask/codegen/src/generate_migrate_stylelint.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060xtask/codegen/src/generate_migrate_eslint.rs:134\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/generate_migrate_eslint.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"afad3805ca19faf672fcbad31e7ff42549f996dec80bcc49506fb76716527766"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): xtask/codegen/src/generate_migrate_eslint.rs:154-166 | xtask/codegen/src/generate_migrate_stylelint.rs:163-175 \u2014 before extracting anything, compare \u0060xtask/codegen/src/generate_migrate_eslint.rs\u0060 and \u0060xtask/codegen/src/generate_migrate_stylelint.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060xtask/codegen/src/generate_migrate_eslint.rs:154\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/generate_migrate_eslint.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"76dbbc6a6013f382857ff9e174d6c784d0c62b139f43331a2e84e5c9b0f2e0da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 10): crates/biome_module_graph/src/db/type_inference/expressions.rs:1072-1083 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1205-1216 | crates/biome_module_graph/src/db/type_inference/expressions.rs:2349-2360 | crates/biome_module_graph/src/db/type_inference/expressions.rs:2424-2435 | crates/biome_module_graph/src/db/type_inference/expressions.rs:2852-2863 | crates/biome_module_graph/src/db/type_inference/expressions.rs:3007-3018 | crates/biome_module_graph/src/db/type_inference/expressions.rs:3089-3100 | crates/biome_module_graph/src/db/type_inference/expressions.rs:3190-3201 | crates/biome_module_graph/src/db/type_inference/lookup.rs:817-828 | crates/biome_module_graph/src/db/type_inference/resolver.rs:1056-1067 \u2014 before extracting anything, compare \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs\u0060 and \u0060crates/biome_module_graph/src/db/type_inference/lookup.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 234 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/biome_module_graph/src/db/type_inference/expressions.rs:1218\u0060 calls \u0060Tuple\u0060 and \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs:1085\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/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf81fa56e4af6e677da2eee351285f0336f7fae564d469d9b326562f8fedec4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 9): crates/biome_module_graph/src/db/type_inference/expressions.rs:870-882 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1149-1161 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1495-1507 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1543-1555 | crates/biome_module_graph/src/db/type_inference/expressions.rs:2483-2494 | crates/biome_module_graph/src/db/type_inference/expressions.rs:2604-2616 | crates/biome_module_graph/src/db/type_inference/lookup.rs:578-590 | crates/biome_module_graph/src/db/type_inference/lookup.rs:746-758 | crates/biome_module_graph/src/db/type_inference/lookup.rs:924-936 \u2014 before extracting anything, compare \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs\u0060 and \u0060crates/biome_module_graph/src/db/type_inference/lookup.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 234 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/biome_module_graph/src/db/type_inference/expressions.rs:1163\u0060 calls \u0060Interface\u0060 and \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs:884\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/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e6aef515de32c2adde45e15155a6e028d87268074735c9fceeb66594464a55b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 9): crates/biome_module_graph/src/db/type_inference/expressions.rs:872-883 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1151-1162 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1497-1508 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1545-1556 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1781-1792 | crates/biome_module_graph/src/db/type_inference/expressions.rs:2484-2495 | crates/biome_module_graph/src/db/type_inference/expressions.rs:2606-2617 | crates/biome_module_graph/src/db/type_inference/lookup.rs:580-591 | crates/biome_module_graph/src/db/type_inference/lookup.rs:926-937 \u2014 before extracting anything, compare \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs\u0060 and \u0060crates/biome_module_graph/src/db/type_inference/lookup.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 234 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/biome_module_graph/src/db/type_inference/expressions.rs:1163\u0060 calls \u0060Interface\u0060 and \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs:884\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e87c625011d2999c249ddb430b64d6553c3a74e3955ac1147b5183fb4d15d74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): crates/biome_css_analyze/src/lint/style/no_excessive_lines_per_file.rs:136-147 | crates/biome_graphql_analyze/src/lint/style/no_excessive_lines_per_file.rs:136-147 | crates/biome_html_analyze/src/lint/style/no_excessive_lines_per_file.rs:136-147 | crates/biome_js_analyze/src/lint/style/no_excessive_lines_per_file.rs:150-161 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_analyze/src/lint/style/no_excessive_lines_per_file.rs:136\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/biome_css_analyze/src/lint/style/no_excessive_lines_per_file.rs:150\u0060 calls \u0060note\u0060 and \u0060crates/biome_js_analyze/src/lint/style/no_excessive_lines_per_file.rs:163\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/biome_css_analyze/src/lint/style/no_excessive_lines_per_file.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf083114a5b870383dcada64afc2b4ef76a74f209f097d521d7057d014f70df1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): crates/biome_formatter/src/builders.rs:637-648 | crates/biome_html_formatter/src/utils/children.rs:82-93 | crates/biome_js_formatter/src/utils/jsx.rs:427-438 | crates/biome_markdown_formatter/src/words.rs:48-59 \u2014 before extracting anything, compare \u0060crates/biome_html_formatter/src/utils/children.rs\u0060 and \u0060crates/biome_js_formatter/src/utils/jsx.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060\u0026mut Formatter\u003CContext\u003E\u0060 in one and \u0060\u0026mut Formatter\u003CHtmlFormatContext\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_formatter/src/builders.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcfbf61e8471c99401176f54e1270ea916aaea1ebabf3fc6630970841afedbf3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): crates/biome_grit_patterns/src/pattern_compiler/auto_wrap.rs:117-128 | crates/biome_grit_patterns/src/pattern_compiler/auto_wrap.rs:181-192 | crates/biome_grit_patterns/src/pattern_compiler/auto_wrap.rs:275-286 | crates/biome_grit_patterns/src/pattern_compiler/auto_wrap.rs:339-350 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_grit_patterns/src/pattern_compiler/auto_wrap.rs:116\u0060 calls \u0060Contains\u0060 and \u0060crates/biome_grit_patterns/src/pattern_compiler/auto_wrap.rs:180\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_patterns/src/pattern_compiler/auto_wrap.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"04109fee5a979ded935315d67f7b1101317f20a12e43508d15f4e9846de870d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): crates/biome_html_parser/src/lexer/mod.rs:136-147 | crates/biome_html_parser/src/lexer/mod.rs:196-207 | crates/biome_html_parser/src/lexer/mod.rs:266-277 | crates/biome_html_parser/src/lexer/mod.rs:325-336 \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/biome_html_parser/src/lexer/mod.rs:136\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/biome_html_parser/src/lexer/mod.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a24347b7519783a364515964dc6b6ef5cf02895e559900f136f18326b4eb3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): crates/biome_service/src/file_handlers/graphql.rs:650-661 | crates/biome_service/src/file_handlers/json.rs:758-769 | crates/biome_service/src/file_handlers/md.rs:684-695 | crates/biome_service/src/file_handlers/yaml.rs:547-558 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/graphql.rs\u0060 and \u0060crates/biome_service/src/file_handlers/json.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 228 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/biome_service/src/file_handlers/graphql.rs:663\u0060 calls \u0060diagnostic_offset\u0060 and \u0060crates/biome_service/src/file_handlers/md.rs:697\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/graphql.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"e38186045031598d6add5ccf3053f5d08c7165301e22ceaf7deb9800b28ebf2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): crates/biome_service/src/file_handlers/html/parse_embedded_nodes.rs:518-529 | crates/biome_service/src/file_handlers/html/parse_embedded_nodes.rs:622-633 | crates/biome_service/src/file_handlers/html/parse_embedded_nodes.rs:650-661 | crates/biome_service/src/file_handlers/html/parse_embedded_nodes.rs:677-688 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/html/parse_embedded_nodes.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"d79ae6db75b63cafc9e5857274f9f8c1ff117377affe54f0679d50423be2da01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/biome_cli/src/execute/migrate/eslint.rs:128-139 | crates/biome_cli/src/execute/migrate/eslint.rs:210-221 | crates/biome_cli/src/execute/migrate/stylelint.rs:141-152 \u2014 before extracting anything, compare \u0060crates/biome_cli/src/execute/migrate/eslint.rs\u0060 and \u0060crates/biome_cli/src/execute/migrate/stylelint.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 60 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/biome_cli/src/execute/migrate/eslint.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"d31b8f7bcfd94e51aca450718305890d932847176761b2f4da48df3c8f0f8954"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/biome_configuration/src/analyzer/mod.rs:68-79 | crates/biome_configuration/src/analyzer/mod.rs:177-188 | crates/biome_configuration/src/analyzer/mod.rs:346-357 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_configuration/src/analyzer/mod.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78b290e49581c7a50a530a7c9807ea96adb3bd98899358e3ca275c22299995a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/biome_embeds/src/visitor.rs:123-134 | crates/biome_embeds/src/visitor.rs:148-159 | crates/biome_embeds/src/visitor.rs:263-274 \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/biome_embeds/src/visitor.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcaf3ea892a170fdb6315885146ea0647a264ea61b688f117ee682df9afa61e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/biome_graphql_formatter/src/graphql/definitions/interface_type_definition.rs:28-39 | crates/biome_graphql_formatter/src/graphql/extensions/interface_type_extension.rs:33-44 | crates/biome_graphql_formatter/src/graphql/extensions/object_type_extension.rs:33-44 \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/biome_graphql_formatter/src/graphql/definitions/interface_type_definition.rs:28\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/biome_graphql_formatter/src/graphql/definitions/interface_type_definition.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f278b93deb571224a56fa8251c19257454e3fc11a37cf4695c29586620e8706"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/biome_html_formatter/src/svelte/auxiliary/await_catch_block.rs:20-31 | crates/biome_html_formatter/src/svelte/auxiliary/await_opening_block.rs:38-49 | crates/biome_html_formatter/src/svelte/auxiliary/await_then_block.rs:20-31 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_formatter/src/svelte/auxiliary/await_catch_block.rs:20\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/biome_html_formatter/src/svelte/auxiliary/await_catch_block.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"250b49c71e7de9b044fbfbb7446c6b8bc1e8a95cad5bd72039cb0e2ecb710353"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/biome_html_parser/src/syntax/mod.rs:398-409 | crates/biome_parser/src/parse_recovery.rs:87-98 | crates/biome_parser/src/parse_recovery.rs:134-145 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_parser/src/syntax/mod.rs:398\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_html_parser/src/syntax/mod.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab18035f62e4fc21ba65e8423399a84fae86a8650594673fd2fd5f0946f7f2f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/biome_js_type_info/src/local_inference.rs:362-373 | crates/biome_js_type_info/src/local_inference.rs:391-402 | crates/biome_js_type_info/src/local_inference.rs:1078-1089 \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/biome_js_type_info/src/local_inference.rs:362\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_js_type_info/src/local_inference.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f0b0ab5f45d9f3a18922fdeda186c2f0229a114713e079549b3512ce86a51a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/biome_json_analyze/src/assist/source/use_sorted_package_json/sorters/dependencies_meta.rs:78-89 | crates/biome_json_analyze/src/assist/source/use_sorted_package_json/sorters/helpers.rs:45-56 | crates/biome_json_analyze/src/assist/source/use_sorted_package_json/sorters/helpers.rs:231-242 \u2014 before extracting anything, compare \u0060crates/biome_json_analyze/src/assist/source/use_sorted_package_json/sorters/dependencies_meta.rs\u0060 and \u0060crates/biome_json_analyze/src/assist/source/use_sorted_package_json/sorters/helpers.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_json_analyze/src/assist/source/use_sorted_package_json/sorters/dependencies_meta.rs:78\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/biome_json_analyze/src/assist/source/use_sorted_package_json/sorters/dependencies_meta.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd134f973cbc9dd0b8f820683483ef49f1d28749237aeca443eea96dcd65ae67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 3): crates/biome_markdown_parser/src/lexer/mod.rs:914-924 | crates/biome_markdown_parser/src/lexer/mod.rs:975-985 | crates/biome_markdown_parser/src/token_source.rs:18-29 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/lexer/mod.rs"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae2f3bc59471dc88f6f42cf965e721e56c4b7164c8ff61e8c27624e7908bd1b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/biome_migrate/src/analyzers/rule_mover.rs:279-290 | crates/biome_migrate/src/analyzers/rule_mover.rs:361-372 | crates/biome_migrate/src/analyzers/rule_mover.rs:388-399 \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/biome_migrate/src/analyzers/rule_mover.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f0162e9f2c893bb5e6fc05158e5ab032dc2d56d4811713096530c2c39ddab87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/biome_module_graph/src/db/queries/type_inference/promises.rs:42-53 | crates/biome_module_graph/src/db/queries/type_inference/promises.rs:88-99 | crates/biome_module_graph/src/db/queries/type_inference/promises.rs:136-147 \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/biome_module_graph/src/db/queries/type_inference/promises.rs:42\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_module_graph/src/db/queries/type_inference/promises.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e0a168c4115e95c93af8e7eabb8340c80c69a030d58abd6ccc64e2a400ffa7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/biome_module_graph/src/db/type_inference/expressions.rs:587-598 | crates/biome_module_graph/src/db/type_inference/expressions.rs:2370-2381 | crates/biome_module_graph/src/db/type_inference/expressions.rs:2626-2637 \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/biome_module_graph/src/db/type_inference/expressions.rs:587\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs:2368\u0060 calls \u0060Literal\u0060, \u0060InstanceOf\u0060 and \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs:2625\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/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdcdd2224ab7d1369eb1b3cb99dd8bb9ffddcb1ed5e6cf109ff4712b4df1a23b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/biome_module_graph/src/db/type_inference/expressions.rs:2225-2236 | crates/biome_module_graph/src/db/type_inference/expressions.rs:2365-2376 | crates/biome_module_graph/src/db/type_inference/expressions.rs:2870-2881 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs:2869\u0060 calls \u0060Union\u0060 and \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs:2224\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":2225}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ffad87bfe7dadce6c2924c12895ee2edcca0d9d51c0d350b675b7382538a06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/biome_module_graph/src/db/type_inference/expressions.rs:2447-2458 | crates/biome_module_graph/src/db/type_inference/lookup.rs:772-783 | crates/biome_module_graph/src/db/type_inference/lookup.rs:948-959 \u2014 before extracting anything, compare \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs\u0060 and \u0060crates/biome_module_graph/src/db/type_inference/lookup.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 234 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs:2447\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs:2446\u0060 calls \u0060InstanceOf\u0060 and \u0060crates/biome_module_graph/src/db/type_inference/lookup.rs:771\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":2447}}}],"partialFingerprints":{"codehealthFindingId/v1":"122909f6257e131a39c0fddb0ff8d617082a71b4cf8677f30068cc76a1639246"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 3): crates/biome_service/src/workspace/server.rs:2049-2060 | crates/biome_service/src/workspace/server.rs:2069-2080 | crates/biome_service/src/workspace/server.rs:2091-2101 \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/biome_service/src/workspace/server.rs:2049\u0060 it does not close everything it opens, so those exact 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/biome_service/src/workspace/server.rs"},"region":{"startLine":2049}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0793d732502261e728b348e7c45e9fdfc69681621308e2cec4ee4926d48f38c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/biome_syntax_codegen/src/generate_nodes.rs:666-677 | xtask/codegen/src/generate_nodes.rs:686-697 | xtask/codegen/src/generate_nodes.rs:774-785 \u2014 before extracting anything, compare \u0060crates/biome_syntax_codegen/src/generate_nodes.rs\u0060 and \u0060xtask/codegen/src/generate_nodes.rs\u0060 as WHOLE FILES: this scan already matched 26 separate duplicated blocks between them, totalling at least 933 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_syntax_codegen/src/generate_nodes.rs:666\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_syntax_codegen/src/generate_nodes.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c84b3de6a096d1f9eff3c5a5537123204ef70271daf581e3520923756a2e6c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_cli/src/execute/migrate/eslint_eslint.rs:522-533 | crates/biome_cli/src/execute/migrate/stylelint_stylelint.rs:126-137 \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/biome_cli/src/execute/migrate/eslint_eslint.rs:522\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/execute/migrate/eslint_eslint.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"17381bf600018f47a3550b85f24181fce57e4399ab93e6c420117acf3302086a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/biome_cli/src/runner/impls/process_file/lint_and_assist.rs:41-52 | crates/biome_cli/src/runner/impls/process_file/lint_and_assist.rs:180-190 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_cli/src/runner/impls/process_file/lint_and_assist.rs:39\u0060 calls \u0060build\u0060, \u0060analyzer_selectors\u0060 and \u0060crates/biome_cli/src/runner/impls/process_file/lint_and_assist.rs:179\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/biome_cli/src/runner/impls/process_file/lint_and_assist.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"7913f2c80db95c1761687688e3d940826e59f6d70e6665dd12543929829e8ffd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): crates/biome_css_analyze/src/lint/correctness/no_unknown_media_feature_name.rs:183-191 | crates/biome_css_analyze/src/lint/correctness/no_unknown_media_feature_name.rs:277-288 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_analyze/src/lint/correctness/no_unknown_media_feature_name.rs:183\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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/biome_css_analyze/src/lint/correctness/no_unknown_media_feature_name.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a4dde917b8dac58223bc91932efd62e9ad43a2bd063c627412eb9bd8dded072"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_css_analyze/src/lint/suspicious/no_empty_source.rs:81-92 | crates/biome_graphql_analyze/src/lint/suspicious/no_empty_source.rs:82-93 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_analyze/src/lint/suspicious/no_empty_source.rs:81\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/biome_css_analyze/src/lint/suspicious/no_empty_source.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"1772ae27ec5ded43d7a7528085f2c0ee8c5710211e0f634bbb018b5e4c6d04b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/biome_css_analyze/src/lint/suspicious/no_useless_escape_in_string.rs:108-118 | crates/biome_js_analyze/src/lint/suspicious/no_useless_escape_in_string.rs:155-166 \u2014 before extracting anything, compare \u0060crates/biome_css_analyze/src/lint/suspicious/no_useless_escape_in_string.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/suspicious/no_useless_escape_in_string.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_analyze/src/lint/suspicious/no_useless_escape_in_string.rs:108\u0060 it does not close everything it opens, so those exact 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/biome_css_analyze/src/lint/suspicious/no_useless_escape_in_string.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e422d9a215097c76f4571a5f35de767e377a9badaef9298607be076bd4fb9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/biome_css_formatter/src/css/lists/attr_name_list.rs:45-56 | crates/biome_css_formatter/src/css/lists/syntax_component_list.rs:39-48 \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/biome_css_formatter/src/css/lists/attr_name_list.rs:45\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_formatter/src/css/lists/attr_name_list.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb23fda8908de7d06af2cbebc898bab2986678e6b68b750befdf15a8501fc58e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_css_parser/src/lexer/mod.rs:1012-1023 | crates/biome_css_parser/src/lexer/mod.rs:1055-1066 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_css_parser/src/lexer/mod.rs:1012\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_css_parser/src/lexer/mod.rs"},"region":{"startLine":1012}}}],"partialFingerprints":{"codehealthFindingId/v1":"934879243e83ad1d4f6df25a28ec6facbcd90da228e7f6b4a02aa0cc9891d543"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/biome_css_parser/src/syntax/at_rule/page.rs:225-235 | crates/biome_css_parser/src/syntax/block/declaration_or_at_rule_list_block.rs:67-78 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_parser/src/syntax/at_rule/page.rs:225\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_parser/src/syntax/at_rule/page.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33455dcbc70718cc52cb6c5ac999ef7d17dffc220f1290465d5f42e53e22639"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_css_parser/src/syntax/mod.rs:1075-1086 | crates/biome_js_parser/src/syntax/typescript.rs:131-142 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060func\u0060 to \u0060impl FnOnce(\u0026mut CssParser) -\u003E Result\u003CT\u0060 in one and \u0060impl FnOnce(\u0026mut JsParser) -\u003E Result\u003CT\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/biome_css_parser/src/syntax/mod.rs"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf91b12e0ed6a39fa826cc9f21d10559fd8d050afa3fca1af2c19ee12f593ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_deserialize/src/json.rs:50-61 | crates/biome_deserialize/src/yaml/mod.rs:62-73 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_deserialize/src/json.rs:50\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/biome_deserialize/src/json.rs:64\u0060 calls \u0060deserialize_from_json_str\u0060, \u0060default\u0060 and \u0060crates/biome_deserialize/src/yaml/mod.rs:78\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/biome_deserialize/src/json.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"453a9bfa93a80e6ac327913848ee650b66195bc192702a549ace396fa917a0f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_embeds/src/visitor.rs:1140-1151 | crates/biome_embeds/src/visitor.rs:1155-1166 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_embeds/src/visitor.rs:1140\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_embeds/src/visitor.rs"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1defe64e8ccc2b4491e409176837e062367b336f000a8416560effc9205b43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/biome_formatter/src/comments.rs:790-799 | crates/biome_markdown_formatter/src/comments.rs:46-57 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_formatter/src/comments.rs:790\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_formatter/src/comments.rs"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d0614cdc6e6f024cf96b606bd9689adff4d009151b5bd2382540eb811293ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_grit_patterns/src/grit_css_parser.rs:72-83 | crates/biome_grit_patterns/src/grit_json_parser.rs:70-81 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_grit_patterns/src/grit_css_parser.rs:72\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/biome_grit_patterns/src/grit_css_parser.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ff1c4f806deade5d71a7691314e40e5f5fbb60728c5e54ace8cdb3c0666774"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_grit_patterns/src/pattern_compiler/not_compiler.rs:21-32 | crates/biome_grit_patterns/src/pattern_compiler/not_compiler.rs:46-57 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_patterns/src/pattern_compiler/not_compiler.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"38372cd983492cad67cb730820347e22637beeaf40852123e25bbfbd2320f3ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_grit_patterns/src/pattern_compiler/predicate_call_compiler.rs:32-43 | crates/biome_grit_patterns/src/pattern_compiler/predicate_call_compiler.rs:65-76 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_grit_patterns/src/pattern_compiler/predicate_call_compiler.rs:32\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/biome_grit_patterns/src/pattern_compiler/predicate_call_compiler.rs:77\u0060 calls \u0060metavariable_prefix\u0060, \u0060to_owned\u0060 and \u0060crates/biome_grit_patterns/src/pattern_compiler/predicate_call_compiler.rs:44\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_patterns/src/pattern_compiler/predicate_call_compiler.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"1235a9bb023d87bb805ce64b2df24871b318334657decdc33f3de9acce865efc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_html_formatter/src/utils/children.rs:934-945 | crates/biome_js_formatter/src/utils/jsx.rs:557-568 \u2014 before extracting anything, compare \u0060crates/biome_html_formatter/src/utils/children.rs\u0060 and \u0060crates/biome_js_formatter/src/utils/jsx.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_formatter/src/utils/children.rs"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2d401cba8827583103d275ee2a2c390bc0963bab9fe6573d1de2b318bec4ff9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_html_parser/src/lexer/mod.rs:178-189 | crates/biome_html_parser/src/lexer/mod.rs:311-322 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_html_parser/src/lexer/mod.rs:178\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_html_parser/src/lexer/mod.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"987b829cc3fe3cff1dc74f1b663d2e6b9f59fe97d73c0b816c180ca354c12bbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_html_parser/src/lexer/mod.rs:1044-1055 | crates/biome_tailwind_parser/src/lexer/mod.rs:575-586 \u2014 before extracting anything, compare \u0060crates/biome_html_parser/src/lexer/mod.rs\u0060 and \u0060crates/biome_tailwind_parser/src/lexer/mod.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_parser/src/lexer/mod.rs"},"region":{"startLine":1044}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d2c13dd1b0a1df0db2ad86bbd2bfe329194753f42ded4a9c49044f832d94d7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_html_parser/src/lexer/mod.rs:1342-1353 | crates/biome_json_parser/src/lexer/mod.rs:536-547 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_parser/src/lexer/mod.rs:1342\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_html_parser/src/lexer/mod.rs"},"region":{"startLine":1342}}}],"partialFingerprints":{"codehealthFindingId/v1":"26804c634a656da6bebfd031b552309ac9bb3e107747ec23b14aeacf395df13a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_html_parser/src/syntax/svelte.rs:42-53 | crates/biome_html_parser/src/syntax/svelte.rs:891-902 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_html_parser/src/syntax/svelte.rs:42\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/biome_html_parser/src/syntax/svelte.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf01e33f6abb801ade0876b26fa243e3ddf91aa0af43527faf4dd87a27bdc34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_js_analyze/src/assist/source/organize_imports.rs:1438-1449 | crates/biome_js_analyze/src/assist/source/organize_imports.rs:1526-1537 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_js_analyze/src/assist/source/organize_imports.rs:1438\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/biome_js_analyze/src/assist/source/organize_imports.rs"},"region":{"startLine":1438}}}],"partialFingerprints":{"codehealthFindingId/v1":"e854f5387ad8bae0b7dd8dccd543a6af92f4526b700def8dff443ae22bf19521"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_js_analyze/src/assist/source/use_sorted_attributes.rs:111-122 | crates/biome_js_analyze/src/assist/source/use_sorted_attributes.rs:195-206 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/assist/source/use_sorted_attributes.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b24e4acf6e2958e775be7bc5e312e06a6ffc10354780308b0fca45130031cd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_js_analyze/src/assist/source/use_sorted_keys.rs:250-261 | crates/biome_json_analyze/src/assist/source/use_sorted_keys.rs:269-280 \u2014 before extracting anything, compare \u0060crates/biome_js_analyze/src/assist/source/use_sorted_keys.rs\u0060 and \u0060crates/biome_json_analyze/src/assist/source/use_sorted_keys.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/assist/source/use_sorted_keys.rs:250\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_js_analyze/src/assist/source/use_sorted_keys.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"654bd5a08bba7603c233494e5cc8a66556927daaec82c8885687d060cdda8881"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_js_analyze/src/lint/a11y/use_anchor_content.rs:185-196 | crates/biome_js_analyze/src/lint/a11y/use_heading_content.rs:136-148 \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/biome_js_analyze/src/lint/a11y/use_anchor_content.rs:185\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_js_analyze/src/lint/a11y/use_anchor_content.rs:184\u0060 calls \u0060find_attribute_by_name\u0060, \u0060is_some\u0060 and \u0060crates/biome_js_analyze/src/lint/a11y/use_heading_content.rs:136\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/biome_js_analyze/src/lint/a11y/use_anchor_content.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"4820657952f91f3aec94e2940639e1719cb026daba215e1a2b031aed1b71f870"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_js_analyze/src/lint/complexity/no_extra_boolean_cast.rs:137-148 | crates/biome_js_analyze/src/lint/complexity/no_extra_boolean_cast.rs:157-168 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_js_analyze/src/lint/complexity/no_extra_boolean_cast.rs:137\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/complexity/no_extra_boolean_cast.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada2c7a21f8ac2f1359ef34d34a57c711039ca51b265f4f4cdcd93c8f32029a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_js_analyze/src/lint/correctness/no_unresolved_imports.rs:100-111 | crates/biome_js_analyze/src/lint/suspicious/no_deprecated_imports.rs:81-92 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/no_unresolved_imports.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5245c9cf84d04b55f4eaf6a5b6dbf58f10e78babb3d758f16b1bf1bcf3a28fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_js_analyze/src/lint/correctness/no_unused_imports.rs:383-394 | crates/biome_js_analyze/src/lint/correctness/no_unused_imports.rs:397-408 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_js_analyze/src/lint/correctness/no_unused_imports.rs:383\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/biome_js_analyze/src/lint/correctness/no_unused_imports.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7fc69f3acd11406711493bba7c05eaaa96b49b7aec878512ac8edd37815ceb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/no_floating_promises.rs:327-338 | crates/biome_js_analyze/src/lint/nursery/no_misused_promises.rs:217-228 \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/biome_js_analyze/src/lint/nursery/no_floating_promises.rs:327\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/biome_js_analyze/src/lint/nursery/no_floating_promises.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"d358589d5331378de1fbc9ffe4076c4a5f4d093b8133f9af20910cde7123d180"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/no_misplaced_list_elements.rs:199-210 | crates/biome_js_analyze/src/lint/nursery/use_valid_character_comparison.rs:204-215 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/nursery/no_misplaced_list_elements.rs:199\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_misplaced_list_elements.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"af0cb033170ac0b3e1d133e621dd81bcb017610dc13a65e69d1c55b1f4c8ae9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/no_svelte_ignored_unsubscribe.rs:90-101 | crates/biome_js_analyze/src/lint/nursery/no_uninvoked_array_callback.rs:118-129 \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/biome_js_analyze/src/lint/nursery/no_svelte_ignored_unsubscribe.rs:90\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/biome_js_analyze/src/lint/nursery/no_svelte_ignored_unsubscribe.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"82f514d81eee6276006aa05196a9e0d8083ec3bca850ae168ba4f05f0fcbac65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/no_svelte_unnecessary_state_wrap.rs:162-173 | crates/biome_js_analyze/src/lint/nursery/no_svelte_useless_derived_by.rs:114-123 \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/biome_js_analyze/src/lint/nursery/no_svelte_unnecessary_state_wrap.rs:162\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/nursery/no_svelte_unnecessary_state_wrap.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"77e3927caccf95ebac5f56cd8f7246fe39773adf0bd4b099807da0e540055883"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/no_useless_spread.rs:728-737 | crates/biome_js_analyze/src/lint/nursery/no_useless_spread.rs:789-800 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/nursery/no_useless_spread.rs:728\u0060 it begins part-way through the construct above it, so those exact 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/biome_js_analyze/src/lint/nursery/no_useless_spread.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"85db2f9b5d358146cbe8aeaec559955649f8f6a69f34a58a0db9f7de96259a5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/use_explicit_return_type.rs:408-419 | crates/biome_js_analyze/src/lint/nursery/use_explicit_type.rs:633-644 \u2014 before extracting anything, compare \u0060crates/biome_js_analyze/src/lint/nursery/use_explicit_return_type.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/nursery/use_explicit_type.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 80 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/nursery/use_explicit_return_type.rs:408\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/nursery/use_explicit_return_type.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"778646277132e8c478b92e9b300b9fb4a818df28153766a3eaad0338b3935e54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/use_explicit_type.rs:522-533 | crates/biome_js_analyze/src/lint/nursery/use_explicit_type.rs:1189-1200 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_js_analyze/src/lint/nursery/use_explicit_type.rs:522\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/nursery/use_explicit_type.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"630e4845b0dc67011c8d16caecf1df27c062bc1d9f3a11227b3c7ba0a9307256"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/use_iterator_zip.rs:434-445 | crates/biome_js_analyze/src/lint/nursery/use_set_size.rs:209-220 \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/biome_js_analyze/src/lint/nursery/use_iterator_zip.rs:434\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_iterator_zip.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"d430fd97b6df15d887b03e1f608594431891fe41e38707aa473cdc76fee9082f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/biome_js_analyze/src/lint/suspicious/no_evolving_types.rs:72-83 | crates/biome_js_analyze/src/lint/suspicious/no_implicit_any_let.rs:59-68 \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/biome_js_analyze/src/lint/suspicious/no_evolving_types.rs:72\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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/biome_js_analyze/src/lint/suspicious/no_evolving_types.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6c229f48191caf9d2a086a71baacc6f54c292f6ab0d47e62fcaf3d102f9f9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_js_analyze/src/services/semantic_class.rs:899-910 | crates/biome_js_analyze/src/services/semantic_class.rs:981-992 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/services/semantic_class.rs:899\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_js_analyze/src/services/semantic_class.rs"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"73250cf0dfa686e5132093e7b58ef558589d0af515a95021844ec5822807504d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_js_formatter/src/ts/declarations/enum_declaration.rs:20-31 | crates/biome_js_formatter/src/ts/declarations/import_equals_declaration.rs:28-39 \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/biome_js_formatter/src/ts/declarations/enum_declaration.rs:20\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_js_formatter/src/ts/declarations/import_equals_declaration.rs:26\u0060 calls \u0060format\u0060, \u0060space\u0060 and \u0060crates/biome_js_formatter/src/ts/declarations/enum_declaration.rs:18\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/ts/declarations/enum_declaration.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"288c3d84fb0e64e40aa9f9d756773aef8f1ca0900bed30a57484a20f5b333037"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_js_transform/src/lib.rs:88-99 | crates/biome_migrate/src/lib.rs:86-97 \u2014 before extracting anything, compare \u0060crates/biome_js_transform/src/lib.rs\u0060 and \u0060crates/biome_migrate/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_transform/src/lib.rs:88\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_js_transform/src/lib.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d7d31c6c82725861e9a12f2344877f7715b52c1d44ee2c3fc7767287cd06ac7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/biome_js_transform/src/lib.rs:103-114 | crates/biome_migrate/src/lib.rs:101-111 \u2014 before extracting anything, compare \u0060crates/biome_js_transform/src/lib.rs\u0060 and \u0060crates/biome_migrate/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/biome_js_transform/src/lib.rs:116\u0060 calls \u0060insert_service\u0060 and \u0060crates/biome_migrate/src/lib.rs:113\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_transform/src/lib.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b104dd1ae5e9eef49943db7e476d31ab11df1228c41967d9828f716ef5267ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_js_type_info/src/format_inferred_type_info.rs:397-408 | crates/biome_js_type_info/src/format_inferred_type_info.rs:437-448 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_type_info/src/format_inferred_type_info.rs:397\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_js_type_info/src/format_inferred_type_info.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc307c4d9479f1e509fd955acf96c2be2d2e4387d9361d71fe3a1a35ce3571c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_js_type_info/src/format_inferred_type_info.rs:601-612 | crates/biome_js_type_info/src/format_type_info.rs:904-915 \u2014 before extracting anything, compare \u0060crates/biome_js_type_info/src/format_inferred_type_info.rs\u0060 and \u0060crates/biome_js_type_info/src/format_type_info.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 242 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_type_info/src/format_inferred_type_info.rs:601\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060\u0026mut Formatter\u003CFormatInferredTypeContext\u003C\u0027db\u003E\u003E\u0060 in one and \u0060\u0026mut Formatter\u003CFormatTypeContext\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/format_inferred_type_info.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"35df8ef296e37716450495751626d74069b3482816cd1695e86a5a7eac4fbe68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_js_type_info/src/inferred_type.rs:556-567 | crates/biome_js_type_info/src/inferred_type.rs:615-626 \u2014 both copies are in the same file, so extract the block 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/biome_js_type_info/src/inferred_type.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df3a5ee067fe4e514017e2c23a62f249fe3efad7f5ca51d39b0c84fea302adb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_js_type_info/src/inferred_type.rs:1640-1651 | crates/biome_js_type_info/src/inferred_type.rs:1716-1727 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_js_type_info/src/inferred_type.rs:1640\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_js_type_info/src/inferred_type.rs"},"region":{"startLine":1640}}}],"partialFingerprints":{"codehealthFindingId/v1":"65341c014cb855ab936d05b38e0612ab8704b72ac387b5394536655ee0253292"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_json_analyze/src/assist/source/use_sorted_keys.rs:181-192 | crates/biome_json_analyze/src/assist/source/use_sorted_keys.rs:280-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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/biome_json_analyze/src/assist/source/use_sorted_keys.rs:292\u0060 calls \u0060token\u0060 and \u0060crates/biome_json_analyze/src/assist/source/use_sorted_keys.rs:193\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/biome_json_analyze/src/assist/source/use_sorted_keys.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"17def93400d51fd6ddab38310ca554c6f170423c12fec916a1ac8e672ffa78e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_json_formatter/src/json/lists/array_element_list.rs:48-59 | crates/biome_json_formatter/src/json/lists/member_list.rs:12-23 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026JsonArrayElementList\u0060 in one and \u0060\u0026JsonMemberList\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/biome_json_formatter/src/json/lists/array_element_list.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"52060e13d654b00439cd3c8008a2d865367d31bdf4f6b934d171a1aabe98ea69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_json_parser/src/lexer/mod.rs:137-148 | crates/biome_parser/src/lexer.rs:91-102 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_json_parser/src/lexer/mod.rs:137\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_json_parser/src/lexer/mod.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"f93107b4fb76b25f276f5f491fd07cf27bb4cc28562111cb0653851cf370c1a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201312 lines \u00D7 3): crates/biome_lsp/src/capabilities.rs:38-49 | crates/biome_lsp/src/capabilities.rs:51-62 | crates/biome_lsp/src/capabilities.rs:63-69 \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/biome_lsp/src/capabilities.rs:38\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note 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/biome_lsp/src/capabilities.rs:38\u0060 calls \u0060and_then\u0060 and \u0060crates/biome_lsp/src/capabilities.rs:63\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/capabilities.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"2efb3f0ebab7bb6b3449bdbb1cf04f0ead716ba297c6b4c1cd092a56a2878b36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_markdown_formatter/src/markdown/lists/inline_item_list.rs:1022-1033 | crates/biome_markdown_formatter/src/markdown/lists/inline_item_list.rs:1057-1068 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_markdown_formatter/src/markdown/lists/inline_item_list.rs:1022\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/biome_markdown_formatter/src/markdown/lists/inline_item_list.rs"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"78fd613e133e7cd1a85e4a74dabc0c2c11331577ffbcda660ca5319283a74811"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_markdown_parser/src/syntax/list.rs:834-845 | crates/biome_markdown_parser/src/syntax/list.rs:1265-1276 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_markdown_parser/src/syntax/list.rs:834\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"80fa7231895087a7c5a5e3bc4ae4cf1eb23b1ddf7ca6d7c3fc8b0e7dbffcc8f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_markdown_parser/src/syntax/list.rs:1017-1028 | crates/biome_markdown_parser/src/syntax/list.rs:1051-1062 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_markdown_parser/src/syntax/list.rs:1017\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"2147a4dadc8024e74409ea2ede84dad10713f17a286f41378ef3361d237e5312"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_markdown_parser/src/syntax/list.rs:1858-1869 | crates/biome_markdown_parser/src/syntax/list.rs:1930-1941 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_markdown_parser/src/syntax/list.rs:1858\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/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":1858}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ad22caf3199b45d9e0a75ad0a1a55092dec751e72b7d19576bb87890c377fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): crates/biome_markdown_parser/src/syntax/list.rs:3198-3206 | crates/biome_markdown_parser/src/syntax/mod.rs:705-716 \u2014 before extracting anything, compare \u0060crates/biome_markdown_parser/src/syntax/list.rs\u0060 and \u0060crates/biome_markdown_parser/src/syntax/mod.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 59 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060p\u0060 to \u0060\u0026MarkdownParser\u0060 in one and \u0060\u0026mut MarkdownParser\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/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":3198}}}],"partialFingerprints":{"codehealthFindingId/v1":"f899f3805fd88d02e6b670aeda9b6d5d4424b4e74bd4a891eb5c1a79440e015d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/biome_markdown_parser/src/syntax/list.rs:3456-3467 | crates/biome_markdown_parser/src/syntax/mod.rs:349-359 \u2014 before extracting anything, compare \u0060crates/biome_markdown_parser/src/syntax/list.rs\u0060 and \u0060crates/biome_markdown_parser/src/syntax/mod.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 59 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_markdown_parser/src/syntax/list.rs:3456\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":3456}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e6bccdd57300310159c47ec93b1820e47896e654c0ef9d72c2be54269501c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_markdown_parser/src/syntax/mod.rs:2105-2116 | crates/biome_markdown_parser/src/syntax/mod.rs:2123-2134 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_markdown_parser/src/syntax/mod.rs:2105\u0060 it begins part-way through the construct above it, so those exact 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/biome_markdown_parser/src/syntax/mod.rs"},"region":{"startLine":2105}}}],"partialFingerprints":{"codehealthFindingId/v1":"99139d08056e2d92314714a17e893f39fb22f69147a97d2f536028901db59a27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/biome_markdown_parser/src/to_html.rs:1648-1659 | crates/biome_markdown_parser/src/to_html.rs:2088-2097 \u2014 both copies are in the same file, so extract the block into one function there 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/biome_markdown_parser/src/to_html.rs"},"region":{"startLine":1648}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d4f2dc16204998e14f9c7634d87fb8572491608e419139030511687e07e5d94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_module_graph/src/db/queries/type_inference/calls/implementation.rs:73-84 | crates/biome_module_graph/src/db/queries/type_inference/calls/implementation.rs:121-132 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_module_graph/src/db/queries/type_inference/calls/implementation.rs:73\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_module_graph/src/db/queries/type_inference/calls/implementation.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd2b505023a9adeccadfc5368a29b8ac1bd997941e5e0a229ed0588c4c09ce1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/biome_module_graph/src/db/queries/type_inference/calls/implementation.rs:1720-1731 | crates/biome_module_graph/src/db/type_inference/resolver.rs:1158-1168 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/queries/type_inference/calls/implementation.rs"},"region":{"startLine":1720}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb53cfcc8e67cfa9f73d43adff7298dccecedd823869221c78cfac592077e18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_module_graph/src/type_inference/profiling.rs:590-601 | crates/biome_module_graph/src/type_inference/profiling.rs:680-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/biome_module_graph/src/type_inference/profiling.rs:590\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/biome_module_graph/src/type_inference/profiling.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"172a177f67ae626d389d818176de2accf6cf057420293d037412c3d6082e79c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/biome_parser/src/token_set.rs:15-24 | crates/biome_rowan/src/ast/mod.rs:74-85 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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/biome_parser/src/token_set.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"47261ee9941bf5c66562c419bf2023062090022a2736b2db6a2b158b7e1d89ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/biome_rule_options/src/organize_imports/import_groups.rs:298-310 | crates/biome_rule_options/src/organize_imports/import_groups.rs:516-528 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_rule_options/src/organize_imports/import_groups.rs:298\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/biome_rule_options/src/organize_imports/import_groups.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf3cbad0d77d9ee9abc77a9cf814d7d64a912ab5b6b81de04b8c2acf6ae0886"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/biome_service/src/configuration.rs:1700-1711 | crates/biome_service/src/configuration.rs:1721-1731 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_service/src/configuration.rs:1700\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_service/src/configuration.rs"},"region":{"startLine":1700}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d0109165977990a6b5f6ddc28ee1b0e648e416c93d7d96330e25bea77aa4a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/biome_service/src/file_handlers/css.rs:953-964 | crates/biome_service/src/file_handlers/css.rs:1018-1027 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_service/src/file_handlers/css.rs:953\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_service/src/file_handlers/css.rs"},"region":{"startLine":953}}}],"partialFingerprints":{"codehealthFindingId/v1":"44faaec3122f57b9b4666e3ed774acf41fb3748ac9d691f74823eefcd3906852"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_service/src/file_handlers/html/go_to.rs:133-144 | crates/biome_service/src/file_handlers/javascript/go_to.rs:185-196 \u2014 \u0060crates/biome_service/src/file_handlers/html/go_to.rs\u0060 and \u0060crates/biome_service/src/file_handlers/javascript/go_to.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 42 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/html/go_to.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"642d68874fa41a337988c450feb40c6590b4e67f6b0f1231190d9c00ad38e305"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/biome_service/src/file_handlers/javascript.rs:1636-1647 | crates/biome_service/src/file_handlers/javascript.rs:1687-1696 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_service/src/file_handlers/javascript.rs:1636\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_service/src/file_handlers/javascript.rs"},"region":{"startLine":1636}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa8d071f785fcd1693b3bb5894fb8e85f15da58c924756c6ed9e17da5ca2c4cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_service/src/file_handlers/javascript.rs:1744-1755 | crates/biome_service/src/file_handlers/md.rs:535-546 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/javascript.rs\u0060 and \u0060crates/biome_service/src/file_handlers/md.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 161 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/biome_service/src/file_handlers/javascript.rs"},"region":{"startLine":1744}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3cbcafa1b47acbfc6b9ff923108497b5476f9b8ef64fc13194c0eb5c4cc9cf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/biome_service/src/workspace/server.rs:3836-3846 | crates/biome_service/src/workspace/server.rs:3959-3970 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_service/src/workspace/server.rs:3836\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060params\u0060 to \u0060PullDiagnosticsAndActionsParams\u0060 in one and \u0060PullActionsParams\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/biome_service/src/workspace/server.rs"},"region":{"startLine":3836}}}],"partialFingerprints":{"codehealthFindingId/v1":"db98253c12205bfd1167e1a0935d74d17860a1185565b180b03d899f869482a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_service/src/workspace_types.rs:23-34 | xtask/codegen/src/generate_bindings.rs:22-33 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/workspace_types.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"94af90394ddd9c8d0429528c14188c517aecd925ec2fe238a4903de9a858dcd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_syntax_codegen/src/ast.rs:143-154 | xtask/codegen/src/ast.rs:181-192 \u2014 before extracting anything, compare \u0060crates/biome_syntax_codegen/src/ast.rs\u0060 and \u0060xtask/codegen/src/ast.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 344 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_syntax_codegen/src/ast.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"13864985f6558d5fca8d20fc50618113d8098eeff258324e96b50eee7ee79c45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/biome_tailwind_logic/src/use_tailwind_shorthand_classes.rs:487-497 | crates/biome_tailwind_logic/src/use_tailwind_shorthand_classes.rs:529-540 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_tailwind_logic/src/use_tailwind_shorthand_classes.rs:529\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_tailwind_logic/src/use_tailwind_shorthand_classes.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"c06340636fb6a0ab4145fb16790578f786bebc823127339cc7772819d2df56d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_tailwind_parser/src/syntax/mod.rs:208-219 | crates/biome_tailwind_parser/src/syntax/value.rs:60-71 \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/biome_tailwind_parser/src/syntax/mod.rs:208\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_tailwind_parser/src/syntax/mod.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"e397dccab7ee9ed49a223d9bcfb2378616916ca42c8e07613699f363f2852718"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): xtask/codegen/src/generate_configuration.rs:40-51 | xtask/codegen/src/generate_configuration.rs:123-134 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"xtask/codegen/src/generate_configuration.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1a7a72a39daf4b5f90216ebd60c31903a87c241a2364e44227ab2dafe667a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 13): crates/biome_module_graph/src/db/type_inference/expressions.rs:884-894 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1164-1174 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1215-1225 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1509-1519 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1558-1568 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1721-1731 | crates/biome_module_graph/src/db/type_inference/expressions.rs:2497-2507 | crates/biome_module_graph/src/db/type_inference/expressions.rs:2862-2872 | crates/biome_module_graph/src/db/type_inference/expressions.rs:3149-3159 | crates/biome_module_graph/src/db/type_inference/expressions.rs:3200-3210 | crates/biome_module_graph/src/db/type_inference/lookup.rs:759-769 | crates/biome_module_graph/src/db/type_inference/lookup.rs:827-837 | crates/biome_module_graph/src/db/type_inference/resolver.rs:1066-1076 \u2014 before extracting anything, compare \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs\u0060 and \u0060crates/biome_module_graph/src/db/type_inference/lookup.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 234 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs:1214\u0060 calls \u0060Interface\u0060 and \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs:883\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/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d909a3385f3d0ea299ed4a310a21ecd43e7d022500750e967ad78111b840444"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 11): crates/biome_module_graph/src/db/type_inference/expressions.rs:896-906 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1227-1237 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1521-1531 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1570-1580 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1733-1743 | crates/biome_module_graph/src/db/type_inference/expressions.rs:2228-2237 | crates/biome_module_graph/src/db/type_inference/expressions.rs:2368-2378 | crates/biome_module_graph/src/db/type_inference/expressions.rs:2445-2455 | crates/biome_module_graph/src/db/type_inference/expressions.rs:2873-2883 | crates/biome_module_graph/src/db/type_inference/expressions.rs:3161-3171 | crates/biome_module_graph/src/db/type_inference/expressions.rs:3212-3222 \u2014 all 11 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs:895\u0060 calls \u0060Extends\u0060 and \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs:2227\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/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f4b52dc4d0807dbb84d68aee3680f7737dc004b910233595728060a74efe95f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 9): crates/biome_cli/src/execute/migrate/eslint_to_biome.rs:226-236 | crates/biome_cli/src/execute/migrate/eslint_to_biome.rs:238-248 | crates/biome_cli/src/execute/migrate/eslint_to_biome.rs:266-276 | crates/biome_cli/src/execute/migrate/eslint_to_biome.rs:278-288 | crates/biome_cli/src/execute/migrate/eslint_to_biome.rs:306-316 | crates/biome_cli/src/execute/migrate/eslint_to_biome.rs:318-328 | crates/biome_cli/src/execute/migrate/eslint_to_biome.rs:330-340 | crates/biome_cli/src/execute/migrate/eslint_to_biome.rs:342-352 | crates/biome_cli/src/execute/migrate/stylelint_to_biome.rs:171-180 \u2014 before extracting anything, compare \u0060crates/biome_cli/src/execute/migrate/eslint_to_biome.rs\u0060 and \u0060crates/biome_cli/src/execute/migrate/stylelint_to_biome.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_cli/src/execute/migrate/eslint_to_biome.rs:226\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/execute/migrate/eslint_to_biome.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a31ca039aaf75000ed6b4bfa0cebd37c76a0e3285127082da7724891002d93e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): crates/biome_cli/src/execute/migrate/eslint.rs:129-139 | crates/biome_cli/src/execute/migrate/eslint.rs:211-221 | crates/biome_cli/src/execute/migrate/prettier.rs:549-559 | crates/biome_cli/src/execute/migrate/stylelint.rs:142-152 \u2014 before extracting anything, compare \u0060crates/biome_cli/src/execute/migrate/eslint.rs\u0060 and \u0060crates/biome_cli/src/execute/migrate/stylelint.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_cli/src/execute/migrate/prettier.rs:548\u0060 calls \u0060is_none\u0060, \u0060extension\u0060 and \u0060crates/biome_cli/src/execute/migrate/eslint.rs:210\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/execute/migrate/eslint.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa496bd87710cb1ef17ce0512954edcb4663b635d86824e57fd609ad7f17561"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): crates/biome_html_parser/src/lexer/mod.rs:2197-2207 | crates/biome_js_parser/src/lexer/mod.rs:338-348 | crates/biome_markdown_parser/src/lexer/mod.rs:1905-1915 | crates/biome_tailwind_parser/src/lexer/mod.rs:710-720 \u2014 before extracting anything, compare \u0060crates/biome_html_parser/src/lexer/mod.rs\u0060 and \u0060crates/biome_tailwind_parser/src/lexer/mod.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_parser/src/lexer/mod.rs"},"region":{"startLine":2197}}}],"partialFingerprints":{"codehealthFindingId/v1":"2badca08a225e909fc56705434c234543d582dcab01f5832b39bc1774cc8cd63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): crates/biome_js_analyze/src/lint/complexity/use_regex_literals.rs:288-298 | crates/biome_js_analyze/src/lint/nursery/use_global_regex_in_replace_all.rs:194-204 | crates/biome_js_analyze/src/lint/style/use_named_capture_group.rs:151-161 | crates/biome_js_analyze/src/lint/style/use_unicode_regex.rs:303-313 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/complexity/use_regex_literals.rs:288\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/complexity/use_regex_literals.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eca0d9052e0c00897c974c959f0563371ba707ca8d4fdeac984bcb82e736ace"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): crates/biome_js_formatter/src/js/module/export_named_specifier.rs:19-30 | crates/biome_js_formatter/src/js/module/import_default_clause.rs:25-35 | crates/biome_js_formatter/src/js/module/import_namespace_clause.rs:25-35 | crates/biome_js_formatter/src/js/module/named_import_specifier.rs:19-30 \u2014 before extracting anything, compare \u0060crates/biome_js_formatter/src/js/module/export_named_specifier.rs\u0060 and \u0060crates/biome_js_formatter/src/js/module/named_import_specifier.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_formatter/src/js/module/export_named_specifier.rs:19\u0060 it does not close everything it opens, so those exact 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/biome_js_formatter/src/js/module/import_default_clause.rs:21\u0060 calls \u0060Some\u0060, \u0060format\u0060, \u0060space\u0060 and \u0060crates/biome_js_formatter/src/js/module/export_named_specifier.rs:17\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/biome_js_formatter/src/js/module/export_named_specifier.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9131a7cc9b2b2fd0712affe70b4272def86e94f4290eaa832aab150423b8ec5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): crates/biome_markdown_formatter/src/markdown/lists/block_list.rs:443-453 | crates/biome_markdown_formatter/src/markdown/lists/block_list.rs:465-475 | crates/biome_markdown_formatter/src/markdown/lists/block_list.rs:487-497 | crates/biome_markdown_formatter/src/markdown/lists/block_list.rs:580-590 \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/biome_markdown_formatter/src/markdown/lists/block_list.rs:443\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_markdown_formatter/src/markdown/lists/block_list.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2282aefd2e1c8c92aac9520fe8cde4267032d8a62629a2998c9251f3d55ab0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 4): crates/biome_migrate/src/analyzers/rule_mover.rs:279-288 | crates/biome_migrate/src/analyzers/rule_mover.rs:361-370 | crates/biome_migrate/src/analyzers/rule_mover.rs:388-397 | crates/biome_migrate/src/analyzers/tailwind_options.rs:314-324 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_migrate/src/analyzers/tailwind_options.rs:313\u0060 calls \u0060extend\u0060, \u0060into_iter\u0060 and \u0060crates/biome_migrate/src/analyzers/rule_mover.rs:360\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/biome_migrate/src/analyzers/rule_mover.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"b908b118ef908c922b5c80ab99ee844aa606a68114b4c590ca3c601186696121"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 4): crates/biome_service/src/file_handlers/mod.rs:2437-2445 | crates/biome_service/src/file_handlers/mod.rs:2459-2469 | crates/biome_service/src/file_handlers/mod.rs:2474-2482 | crates/biome_service/src/file_handlers/mod.rs:2511-2521 \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/biome_service/src/file_handlers/mod.rs:2459\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_service/src/file_handlers/mod.rs"},"region":{"startLine":2437}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b8d617db511148422d7e4418d7fe106a89be81358bae38330225570915a975"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/biome_graphql_formatter/src/graphql/definitions/field_definition.rs:14-28 | crates/biome_graphql_formatter/src/graphql/definitions/interface_type_definition.rs:14-24 | crates/biome_graphql_formatter/src/graphql/definitions/object_type_definition.rs:14-28 \u2014 before extracting anything, compare \u0060crates/biome_graphql_formatter/src/graphql/definitions/interface_type_definition.rs\u0060 and \u0060crates/biome_graphql_formatter/src/graphql/definitions/object_type_definition.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 46 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_graphql_formatter/src/graphql/definitions/field_definition.rs:14\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026GraphqlFieldDefinition\u0060 in one and \u0060\u0026GraphqlInterfaceTypeDefinition\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/biome_graphql_formatter/src/graphql/definitions/field_definition.rs:30\u0060 calls \u0060format\u0060 and \u0060crates/biome_graphql_formatter/src/graphql/definitions/object_type_definition.rs:30\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_graphql_formatter/src/graphql/definitions/field_definition.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c6350481288d6f7beb41b9feab0f6f8375e99b86f9c08f6c26e329ce5626dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/biome_graphql_formatter/src/graphql/definitions/fragment_definition.rs:15-29 | crates/biome_graphql_formatter/src/graphql/definitions/operation_definition.rs:13-23 | crates/biome_graphql_formatter/src/graphql/definitions/variable_definition.rs:14-28 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_graphql_formatter/src/graphql/definitions/fragment_definition.rs:15\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026GraphqlFragmentDefinition\u0060 in one and \u0060\u0026GraphqlOperationDefinition\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/biome_graphql_formatter/src/graphql/definitions/fragment_definition.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"779517694745c70fc6286b77ae71189bb07ffcd1d6555c88c98f310e91a08117"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 3): crates/biome_grit_parser/src/lexer/mod.rs:986-996 | crates/biome_js_parser/src/lexer/mod.rs:1591-1598 | crates/biome_json_parser/src/lexer/mod.rs:752-762 \u2014 before extracting anything, compare \u0060crates/biome_grit_parser/src/lexer/mod.rs\u0060 and \u0060crates/biome_json_parser/src/lexer/mod.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 260 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_grit_parser/src/lexer/mod.rs:986\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_grit_parser/src/lexer/mod.rs"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4f184bff3b1df929f92ef95d3ebc927a7689ab233e2f66ad549375dc79cf956"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/biome_js_analyze/src/lint/correctness/no_invalid_builtin_instantiation.rs:156-166 | crates/biome_js_analyze/src/lint/style/use_consistent_builtin_instantiation.rs:164-174 | crates/biome_js_analyze/src/lint/style/use_throw_new_error.rs:119-129 \u2014 before extracting anything, compare \u0060crates/biome_js_analyze/src/lint/correctness/no_invalid_builtin_instantiation.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/style/use_consistent_builtin_instantiation.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/style/use_throw_new_error.rs:119\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/biome_js_analyze/src/lint/correctness/no_invalid_builtin_instantiation.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c314acfc6faea1dba88c09c75c743edcdd24b97d2708eaa846c5067cb876a10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/biome_js_analyze/src/lint/nursery/no_array_for_each.rs:236-246 | crates/biome_js_analyze/src/lint/nursery/no_unnecessary_string_trim.rs:275-285 | crates/biome_js_analyze/src/utils/indexed_collection.rs:36-46 \u2014 before extracting anything, compare \u0060crates/biome_js_analyze/src/lint/nursery/no_array_for_each.rs\u0060 and \u0060crates/biome_js_analyze/src/utils/indexed_collection.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/nursery/no_array_for_each.rs:236\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/biome_js_analyze/src/lint/nursery/no_array_for_each.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab76b42079406ec3106eb08856092c9bd356b12539c27a34217beb1718dfc912"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/biome_js_analyze/src/lint/nursery/no_unsafe_type_assertion.rs:187-197 | crates/biome_js_analyze/src/lint/nursery/no_useless_type_assertion.rs:530-540 | crates/biome_js_type_info/src/local_inference.rs:3591-3601 \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. 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/biome_js_analyze/src/lint/nursery/no_unsafe_type_assertion.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbc5784f036ac23bcfc7e356a84ab0de9b3ba5f43d8c1d30465d05ef4e4eff6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): crates/biome_js_formatter/src/js/classes/static_initialization_block_class_member.rs:27-37 | crates/biome_js_formatter/src/ts/auxiliary/module_block.rs:20-30 | crates/biome_js_formatter/src/ts/declarations/interface_declaration.rs:96-105 \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/biome_js_formatter/src/js/classes/static_initialization_block_class_member.rs:27\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026JsStaticInitializationBlockClassMember\u0060 in one and \u0060\u0026TsModuleBlock\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/biome_js_formatter/src/ts/declarations/interface_declaration.rs:105\u0060 calls \u0060format\u0060, \u0060group\u0060 and \u0060crates/biome_js_formatter/src/js/classes/static_initialization_block_class_member.rs:37\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/biome_js_formatter/src/js/classes/static_initialization_block_class_member.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cdd4a8667b826fd4338df4e8bf24d3650e0bb62214665b8f75aa4856379f895"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): crates/biome_module_graph/src/db/type_inference/expressions.rs:1229-1238 | crates/biome_module_graph/src/db/type_inference/expressions.rs:2447-2457 | crates/biome_module_graph/src/db/type_inference/lookup.rs:948-958 \u2014 before extracting anything, compare \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs\u0060 and \u0060crates/biome_module_graph/src/db/type_inference/lookup.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 234 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs:2447\u0060 it begins part-way through the construct above it, so those exact 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/biome_module_graph/src/db/type_inference/expressions.rs:1227\u0060 calls \u0060Literal\u0060 and \u0060crates/biome_module_graph/src/db/type_inference/lookup.rs:946\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/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":1229}}}],"partialFingerprints":{"codehealthFindingId/v1":"6370d43e3b7cd8004d20b9d0c75c1db368b22c1338215fb86877c79611c04347"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/biome_vue_semantic/src/semantic_model/component.rs:1465-1475 | crates/biome_vue_semantic/src/semantic_model/component.rs:1525-1535 | crates/biome_vue_semantic/src/semantic_model/component.rs:1809-1819 \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/biome_vue_semantic/src/semantic_model/component.rs:1465\u0060 it does not close everything it opens, so those exact 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/biome_vue_semantic/src/semantic_model/component.rs"},"region":{"startLine":1465}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a94f2f08426f4f874e0b6f64a42591425193a2ca8ba5568f258381c371b8291"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): xtask/codegen/src/formatter.rs:336-345 | xtask/codegen/src/formatter.rs:351-360 | xtask/codegen/src/formatter.rs:435-445 \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 \u0060xtask/codegen/src/formatter.rs:336\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/formatter.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d6bf98e79b8750a750272d8574f691219630440ff59870182e665006c4786c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_analyze/src/utils.rs:206-217 | crates/biome_analyze/src/utils.rs:219-230 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_analyze/src/utils.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"6150350f39ead76249dbad5cc5b53b33d4e32ffcb85ed3faf0256298b99a034a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_configuration/src/overrides.rs:297-307 | crates/biome_configuration/src/overrides.rs:313-323 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_configuration/src/overrides.rs:297\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_configuration/src/overrides.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cdb80e7fabcf335edc10bcea718b6228ab52a68c77307bfdb86ae6c6baa0b4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): crates/biome_css_analyze/src/lint/correctness/no_unknown_media_feature_name.rs:214-222 | crates/biome_css_analyze/src/lint/correctness/no_unknown_media_feature_name.rs:320-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/biome_css_analyze/src/lint/correctness/no_unknown_media_feature_name.rs:214\u0060 it begins part-way through the construct above it, so those exact 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/biome_css_analyze/src/lint/correctness/no_unknown_media_feature_name.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"1350caf78b24c1aff536448e5c2d72dfc37851876f41a06a73b16dca78828752"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_css_analyze/src/lint/nursery/use_consistent_font_weight_notation.rs:237-247 | crates/biome_css_analyze/src/lint/nursery/use_consistent_lightness_notation.rs:195-205 \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/biome_css_analyze/src/lint/nursery/use_consistent_font_weight_notation.rs:237\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_analyze/src/lint/nursery/use_consistent_font_weight_notation.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"9428513c43df015c1af7b43d13d1311f9862c98c65f2ffe6a19dde7b95bb70e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_css_parser/src/syntax/at_rule/media.rs:396-406 | crates/biome_css_parser/src/syntax/scss/at_rule/media.rs:232-242 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_parser/src/syntax/at_rule/media.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_parser/src/syntax/at_rule/media.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43a962c25ecd53d75230231a67ab7e983a9e600e3ef6d50ce3d1f22f75b6842"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_css_parser/src/syntax/selector/pseudo_class/identifier.rs:22-32 | crates/biome_css_parser/src/syntax/selector/pseudo_element.rs:60-70 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_parser/src/syntax/selector/pseudo_class/identifier.rs:22\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_css_parser/src/syntax/selector/pseudo_class/identifier.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"a33f68d052d291dd1de3a2186a918d72e62f87d3b6b12432d4f717f2c45a5c29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_diagnostics_macros/src/generate.rs:27-37 | crates/biome_diagnostics_macros/src/generate.rs:268-278 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_diagnostics_macros/src/generate.rs:27\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060input\u0060 to \u0060DeriveStructInput\u0060 in one and \u0060DeriveEnumInput\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/biome_diagnostics_macros/src/generate.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"918d8867774f5b849eb87fb9f25608d6af3a702e903e6b0f90def08d57a7c6b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/biome_embeds/src/visitor.rs:695-704 | crates/biome_embeds/src/visitor.rs:716-726 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_embeds/src/visitor.rs:695\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/biome_embeds/src/visitor.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"87cc485bcda4d93710046f9acfc1a51f38c0943c3ab265fe8a02e66070a02817"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_formatter/src/lib.rs:375-385 | crates/biome_formatter/src/lib.rs:497-507 \u2014 both copies are in the same file, so extract the block 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/biome_formatter/src/lib.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea7685ef9dd5ff9c3f8f8e3e8512ffedf57f527f64c3b0aade5069a032b8b66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_graphql_analyze/src/assist/source/use_sorted_enum_members.rs:160-170 | crates/biome_graphql_analyze/src/assist/source/use_sorted_selection_set.rs:191-201 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_graphql_analyze/src/assist/source/use_sorted_enum_members.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"855cba1f66e41850af433d94919eee7f666f0745447eb5e56900b7e9ce6c7ba7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_graphql_parser/src/lexer/mod.rs:370-381 | crates/biome_graphql_parser/src/lexer/mod.rs:387-397 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_graphql_parser/src/lexer/mod.rs:370\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_graphql_parser/src/lexer/mod.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"534e7fbf5ad7f453d1c0a4e040f28626f7bca28d7944b1d148b78acba46bef0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_grit_parser/src/lexer/mod.rs:441-451 | crates/biome_json_parser/src/lexer/mod.rs:492-502 \u2014 before extracting anything, compare \u0060crates/biome_grit_parser/src/lexer/mod.rs\u0060 and \u0060crates/biome_json_parser/src/lexer/mod.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 260 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_grit_parser/src/lexer/mod.rs:441\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_grit_parser/src/lexer/mod.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a4780801815b4d0541db1584534264cebb19555f0f0e67eef3ffb9674271602"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_html_analyze/src/lib.rs:271-281 | crates/biome_markdown_analyze/src/lib.rs:166-176 \u2014 before extracting anything, compare \u0060crates/biome_html_analyze/src/lib.rs\u0060 and \u0060crates/biome_markdown_analyze/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lib.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d100ed36827476eebe35cad147aecb08eed522556ab8001bb6d1d5983d81177"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_html_analyze/src/lint/a11y/no_interactive_element_to_noninteractive_role.rs:62-72 | crates/biome_html_analyze/src/lint/a11y/no_noninteractive_element_to_interactive_role.rs:71-81 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/a11y/no_interactive_element_to_noninteractive_role.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"5657ae3f02fbc67b17d1d579a114afc1e105d42b1223c7a55a34c40cbefbe780"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_html_analyze/src/lint/a11y/use_semantic_elements.rs:142-152 | crates/biome_js_analyze/src/lint/a11y/use_semantic_elements.rs:174-184 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_analyze/src/lint/a11y/use_semantic_elements.rs:142\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/biome_html_analyze/src/lint/a11y/use_semantic_elements.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"08aa67e440f57dd2f053c1e70a9ed58f73600018292314f3696b38716e918993"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_html_analyze/src/lint/correctness/no_duplicate_attributes.rs:141-151 | crates/biome_html_analyze/src/lint/correctness/no_duplicate_attributes.rs:156-166 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_analyze/src/lint/correctness/no_duplicate_attributes.rs:141\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/biome_html_analyze/src/lint/correctness/no_duplicate_attributes.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"3009fb47f8693ea47345f5af35757253377bb3ba34a0c839b076f3cace1caa4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_html_analyze/src/lint/nursery/no_astro_conflicting_set_directives.rs:159-169 | crates/biome_js_analyze/src/lint/nursery/no_astro_conflicting_set_directives.rs:153-163 \u2014 before extracting anything, compare \u0060crates/biome_html_analyze/src/lint/nursery/no_astro_conflicting_set_directives.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/nursery/no_astro_conflicting_set_directives.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_analyze/src/lint/nursery/no_astro_conflicting_set_directives.rs:159\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_html_analyze/src/lint/nursery/no_astro_conflicting_set_directives.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"1329bce1cc068d30f26a197ed3cf4fd4f0cddc976cee43a408891513b1e4e9cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_html_analyze/src/lint/nursery/use_vue_v_model.rs:271-281 | crates/biome_html_analyze/src/lint/nursery/use_vue_v_on_exact.rs:190-200 \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/biome_html_analyze/src/lint/nursery/use_vue_v_model.rs:271\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_html_analyze/src/lint/nursery/use_vue_v_model.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2d6cca367cee044c9ce567e45673daca7d20afb3d5d01e0418d22c92d4d1ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_html_parser/src/syntax/svelte.rs:700-710 | crates/biome_html_parser/src/syntax/svelte.rs:732-742 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_html_parser/src/syntax/svelte.rs:700\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_html_parser/src/syntax/svelte.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"dee90cb253197fa4772016668594e9b11788ef9b1e2a14eeedc415094986e70f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_js_analyze/src/assist/source/organize_imports.rs:1464-1474 | crates/biome_js_analyze/src/assist/source/organize_imports.rs:1515-1525 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_js_analyze/src/assist/source/organize_imports.rs:1464\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/biome_js_analyze/src/assist/source/organize_imports.rs"},"region":{"startLine":1464}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffb847a5002095e072500aff93af6d7495b0be581815b6cec9155d253ba1e973"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_js_analyze/src/assist/source/use_sorted_keys.rs:173-183 | crates/biome_json_analyze/src/assist/source/use_sorted_keys.rs:171-181 \u2014 before extracting anything, compare \u0060crates/biome_js_analyze/src/assist/source/use_sorted_keys.rs\u0060 and \u0060crates/biome_json_analyze/src/assist/source/use_sorted_keys.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/assist/source/use_sorted_keys.rs:173\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_js_analyze/src/assist/source/use_sorted_keys.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e101148f6057827f91b0adf4cbaca07440ff74038c4f230c600222b49c4ebd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/biome_js_analyze/src/assist/source/use_sorted_keys.rs:186-195 | crates/biome_json_analyze/src/assist/source/use_sorted_keys.rs:190-200 \u2014 before extracting anything, compare \u0060crates/biome_js_analyze/src/assist/source/use_sorted_keys.rs\u0060 and \u0060crates/biome_json_analyze/src/assist/source/use_sorted_keys.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/assist/source/use_sorted_keys.rs:186\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/biome_js_analyze/src/assist/source/use_sorted_keys.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"536277a3c2fa5bb710494098272045706e45cd5f9d08db6d5eec78290ef10f60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_js_analyze/src/lint/a11y/use_anchor_content.rs:133-143 | crates/biome_js_analyze/src/lint/a11y/use_heading_content.rs:114-124 \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/biome_js_analyze/src/lint/a11y/use_anchor_content.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/biome_js_analyze/src/lint/a11y/use_anchor_content.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"540e5d85ffa894a787bdf85087d8bb4cf79f335380f6d2f6cd081e87e67166ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_js_analyze/src/lint/a11y/use_anchor_content.rs:182-192 | crates/biome_js_analyze/src/lint/nursery/use_control_label.rs:262-274 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/a11y/use_anchor_content.rs:182\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/a11y/use_anchor_content.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cac30d4d12ecb2b49e0321f5fa7c2bc22ad8a8406d73109405c153ed1985c74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_js_analyze/src/lint/complexity/no_this_in_static.rs:119-129 | crates/biome_js_analyze/src/services/semantic_class.rs:300-310 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/complexity/no_this_in_static.rs:119\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/complexity/no_this_in_static.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff3b7aff0f1e08b8520542473ece067e931f97a4cfc8e67f221d51c9e027fc1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/biome_js_analyze/src/lint/complexity/no_useless_undefined.rs:154-164 | crates/biome_js_analyze/src/lint/complexity/no_useless_undefined.rs:167-176 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/complexity/no_useless_undefined.rs:154\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/complexity/no_useless_undefined.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef0df17cc371ce57184238b5e1c43d60af84b11270dc90497b623a6278458cc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_js_analyze/src/lint/correctness/no_string_case_mismatch.rs:103-113 | crates/biome_js_analyze/src/lint/style/no_unused_template_literal.rs:103-114 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/correctness/no_string_case_mismatch.rs:103\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/biome_js_analyze/src/lint/correctness/no_string_case_mismatch.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"51f8e145ee1d37c0a7c61fa3cc82224c498b88273f0e3a5b28c4d1abeba5934d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_js_analyze/src/lint/correctness/no_unused_imports.rs:423-433 | crates/biome_js_analyze/src/lint/correctness/no_unused_imports.rs:463-473 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/correctness/no_unused_imports.rs:423\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/biome_js_analyze/src/lint/correctness/no_unused_imports.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc0b3e8f49a1acdf6fcb8ab12f73b4ae03309cfd289d883b614b31a2d53d86b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/biome_js_analyze/src/lint/correctness/use_valid_for_direction.rs:124-133 | crates/biome_js_analyze/src/lint/correctness/use_valid_for_direction.rs:135-145 \u2014 both copies are in the same file, so extract the block 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/biome_js_analyze/src/lint/correctness/use_valid_for_direction.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb8872323238322716bb87e70b60435eb8c201e8e7b6ce22af70c2f61940fe7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/no_object_constructor.rs:155-165 | crates/biome_js_analyze/src/lint/nursery/no_zero_fractions.rs:273-282 \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/biome_js_analyze/src/lint/nursery/no_object_constructor.rs:155\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/nursery/no_object_constructor.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"79be1b35c388918da3fcc1e66350424fc2d74eee573e16539c5443844c12bbeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/use_catch_error_name.rs:221-231 | crates/biome_js_analyze/src/lint/nursery/use_vue_macro_variable_name.rs:312-322 \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/biome_js_analyze/src/lint/nursery/use_catch_error_name.rs:221\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/biome_js_analyze/src/lint/nursery/use_catch_error_name.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"9953600ed4182a7f5826a94db1f4d92f53e00712ddcd7d7a0753e207b3b542af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/use_consistent_boolean_name.rs:970-980 | crates/biome_js_analyze/src/lint/nursery/use_consistent_boolean_name.rs:982-992 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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/biome_js_analyze/src/lint/nursery/use_consistent_boolean_name.rs"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"06850a264a32539fe06f212c85e39f5706d9099b6ef301011b0fa0fd20eedb98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/use_explicit_type.rs:429-437 | crates/biome_js_analyze/src/lint/nursery/use_explicit_type.rs:446-456 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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/biome_js_analyze/src/lint/nursery/use_explicit_type.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f16d9e44cb967b477461483a715817ca9cffd75f1b049feef9ea371aa2f9bc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/use_react_function_component_definition.rs:392-402 | crates/biome_js_analyze/src/lint/nursery/use_react_function_component_definition.rs:487-497 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/nursery/use_react_function_component_definition.rs:392\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_react_function_component_definition.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f7c36b392d07d02e65df05a33bff8b7775f9e9f7268d98a8f2126525c47059f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_js_analyze/src/lint/style/use_export_type.rs:525-535 | crates/biome_js_analyze/src/lint/style/use_import_type.rs:851-861 \u2014 before extracting anything, compare \u0060crates/biome_js_analyze/src/lint/style/use_export_type.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/style/use_import_type.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/style/use_export_type.rs:525\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_js_analyze/src/lint/style/use_import_type.rs:850\u0060 calls \u0060specifiers\u0060 and \u0060crates/biome_js_analyze/src/lint/style/use_export_type.rs:524\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_export_type.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ce58b738d94b5137e51cf6e7978acc3af8b37ea9f7fd78b7274a111420758a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_js_analyze/src/lint/style/use_import_type.rs:515-525 | crates/biome_js_analyze/src/lint/style/use_import_type.rs:637-647 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_js_analyze/src/lint/style/use_import_type.rs:515\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_import_type.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"78705f5b2b0b417e8fcebcd6bc946e7aa80ac64f7c57ab59530379b549ca402d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): crates/biome_js_analyze/src/lint/suspicious/no_double_equals.rs:135-148 | crates/biome_js_analyze/src/lint/suspicious/no_equals_to_null.rs:88-99 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/no_double_equals.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"05c6e0d6c4167a888f6a68c69272ce6d2f3241ee96190ba17bd256575a53facb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/biome_js_formatter/src/jsx/tag/closing_element.rs:22-32 | crates/biome_js_formatter/src/jsx/tag/closing_fragment.rs:24-33 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_formatter/src/jsx/tag/closing_element.rs:22\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/jsx/tag/closing_element.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"243bb6aba10c847524054e8ffd1726a9e7e21c8b0a7ad39fbbc277fa7c6d43b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/biome_js_parser/src/syntax/stmt.rs:626-635 | crates/biome_js_parser/src/syntax/stmt.rs:696-706 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_js_parser/src/syntax/stmt.rs:626\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_js_parser/src/syntax/stmt.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f33a5498128cda1a6a5440117f4cccaabedaed3978a992ad836991502a014e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 3): crates/biome_js_semantic/src/events.rs:713-723 | crates/biome_js_semantic/src/events.rs:728-738 | crates/biome_js_semantic/src/events.rs:740-747 \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/biome_js_semantic/src/events.rs:713\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_semantic/src/events.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cbb7a4b99ddf6b0522db8e6b7e9efbd24b02cde908bf1c9324bdd394a09de27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_js_syntax/src/export_ext.rs:103-113 | crates/biome_js_syntax/src/export_ext.rs:117-127 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_syntax/src/export_ext.rs:103\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_syntax/src/export_ext.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"b756ec0a81c22e91c20c80b6b8f19aa57cdee2bdfd8c55a7a872d39ebf02232e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_js_type_info/src/format_type_info.rs:300-310 | crates/biome_js_type_info/src/format_type_info.rs:351-361 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_js_type_info/src/format_type_info.rs:300\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_js_type_info/src/format_type_info.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f7ef532af8a2605b9ab446b59a49116068f254577f3f1a9171ccee6208c084"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_js_type_info/src/return_type_relation.rs:161-171 | crates/biome_js_type_info/src/return_type_relation.rs:234-244 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_js_type_info/src/return_type_relation.rs:234\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_js_type_info/src/return_type_relation.rs:159\u0060 calls \u0060iter\u0060, \u0060zip\u0060 and \u0060crates/biome_js_type_info/src/return_type_relation.rs:233\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/biome_js_type_info/src/return_type_relation.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"4588a16120a744a03dbe8f1c5930241bc226df98383971353c4edc4bbc68d9a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): crates/biome_json_analyze/src/assist/source/use_sorted_package_json/sorters/eslint_config.rs:143-151 | crates/biome_json_analyze/src/assist/source/use_sorted_package_json/sorters/helpers.rs:153-163 \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/biome_json_analyze/src/assist/source/use_sorted_package_json/sorters/eslint_config.rs:143\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_json_analyze/src/assist/source/use_sorted_package_json/sorters/eslint_config.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f12a0a23577989696a8f961cb46233313cb7cbea91974418c93595e44064277"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_lsp/src/handlers/analysis.rs:175-186 | crates/biome_lsp/src/handlers/analysis.rs:685-696 \u2014 both copies are in the same file, so extract the block into one function there 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/biome_lsp/src/handlers/analysis.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0a43c640998b7d01c215c8a09ffbec1af2a58ea769b6d2d11a1d07e62f6e24a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/biome_manifest/src/lib.rs:115-130 | crates/biome_manifest/src/lib.rs:177-192 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_manifest/src/lib.rs:115\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_manifest/src/lib.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"421d09565e0e7240464306e908f7ef04c8a914867a9867528f3090f9502195a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/biome_markdown_parser/src/syntax/list.rs:1469-1479 | crates/biome_markdown_parser/src/syntax/quote.rs:769-778 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":1469}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa279dcedc2ccbbcf13e36d4a5b0e2c2902a347f1cacd37be011cd0c37cf8ab2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/biome_markdown_parser/src/syntax/list.rs:2689-2698 | crates/biome_markdown_parser/src/syntax/quote.rs:116-126 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":2689}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ea08c3c8026966877e8e03ddda4791dc23fbc4a0971fbaee6c4b660d2deda5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_migrate/src/analyzers/rule_mover.rs:100-110 | crates/biome_migrate/src/analyzers/rule_mover.rs:140-150 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_migrate/src/analyzers/rule_mover.rs:100\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_migrate/src/analyzers/rule_mover.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c006b2513184128dddf43c6951f58e4c9253a37f314772656994c301ac1f27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_module_graph/src/db/queries/type_inference/calls/implementation.rs:1251-1261 | crates/biome_module_graph/src/db/queries/type_inference/calls/implementation.rs:1266-1276 \u2014 both copies are in the same file, so extract the block into one function there 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/biome_module_graph/src/db/queries/type_inference/calls/implementation.rs"},"region":{"startLine":1251}}}],"partialFingerprints":{"codehealthFindingId/v1":"369baa583d36ddeb99a480905a0ae9b6c73d690b3c6099ddb0aceca34d693510"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_module_graph/src/db/type_inference/expressions.rs:702-712 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1929-1939 \u2014 both copies are in the same file, so extract the block into one function there 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/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"11afeb17bfba1387847e6687b2e40feea94810703f05d6d92c7f73804823d822"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_module_graph/src/db/type_inference/expressions.rs:1713-1723 | crates/biome_module_graph/src/db/type_inference/expressions.rs:2210-2220 \u2014 both copies are in the same file, so extract the block into one function there 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/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":1713}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc1d360cbeb1ed4e96a622edebed5d5d7f51aabd7d219b7e7a23daf8c54203e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_module_graph/src/db/type_inference/expressions.rs:1792-1802 | crates/biome_module_graph/src/db/type_inference/expressions.rs:2357-2367 \u2014 both copies are in the same file, so extract the block 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/biome_module_graph/src/db/type_inference/expressions.rs:2355\u0060 calls \u0060Class\u0060 and \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs:1790\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/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":1792}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed8bc6c304f38b221526227d0d31e62989557f139a05f8732ca662232fffdc9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_module_graph/src/db/type_inference/expressions.rs:2217-2227 | crates/biome_module_graph/src/db/type_inference/expressions.rs:3098-3108 \u2014 both copies are in the same file, so extract the block into one function there 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/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":2217}}}],"partialFingerprints":{"codehealthFindingId/v1":"94436984a3e5c14ba785ea9d2789998e101697455dd2fea8bf9e93a3259e7294"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_module_graph/src/db/type_inference/imports.rs:681-691 | crates/biome_module_graph/src/db/type_inference/imports.rs:842-852 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_module_graph/src/db/type_inference/imports.rs:681\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/biome_module_graph/src/db/type_inference/imports.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dcde0f09655418a653d0f8e2dcc273a0f8175d219dbe199d76409b0cc1fc405"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_module_graph/src/js_module_info/collector.rs:239-249 | crates/biome_module_graph/src/js_module_info/collector.rs:300-310 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_module_graph/src/js_module_info/collector.rs:239\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/js_module_info/collector.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf88e27d741a6a60f306b39cdaf90da9f7b83c9bd3bb0c11ef1f4feb144dee97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_module_graph/src/type_inference/profiling.rs:630-640 | crates/biome_module_graph/src/type_inference/profiling.rs:735-745 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_module_graph/src/type_inference/profiling.rs:630\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/biome_module_graph/src/type_inference/profiling.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff47f85804f61df91f00000064ab6519c6fc898d843e54fb96a4f83d83f6b15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_react_compiler/src/convert_ast/modules.rs:492-502 | crates/biome_react_compiler/src/convert_ast/statements.rs:386-396 \u2014 before extracting anything, compare \u0060crates/biome_react_compiler/src/convert_ast/modules.rs\u0060 and \u0060crates/biome_react_compiler/src/convert_ast/statements.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_react_compiler/src/convert_ast/modules.rs:492\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060function\u0060 to \u0060\u0026biome_js_syntax::JsFunctionExportDefaultDeclaration\u0060 in one and \u0060\u0026JsFunctionDeclaration\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/biome_react_compiler/src/convert_ast/modules.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffeeb81e03e0e7347de91f03964040e9f072430c3eab4142218160fa9f7371c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_ruledoc_utils/src/analyzer.rs:86-96 | crates/biome_ruledoc_utils/src/analyzer.rs:276-286 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_ruledoc_utils/src/analyzer.rs:86\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_ruledoc_utils/src/analyzer.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"511820806cdca715e196e6d64fd37601a1b2113aedf2bea7ad7d0a30ec4cf053"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_service/src/configuration.rs:426-436 | crates/biome_service/src/configuration.rs:467-477 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_service/src/configuration.rs:426\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_service/src/configuration.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"daaf425d291565765ddfede7079ea19434527736053001870cd9962755a5256e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_service/src/configuration.rs:1160-1170 | crates/biome_service/src/configuration.rs:1230-1240 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_service/src/configuration.rs:1160\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_service/src/configuration.rs"},"region":{"startLine":1160}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e99940c553c7f3407df9add1b326ef573c0190d0c902d70f1128f1854f9ee80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_service/src/file_handlers/css.rs:1020-1030 | crates/biome_service/src/file_handlers/javascript.rs:1689-1699 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/css.rs\u0060 and \u0060crates/biome_service/src/file_handlers/javascript.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 211 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_service/src/file_handlers/css.rs:1020\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/biome_service/src/file_handlers/css.rs"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"d35d94924aea486daa4b91bcfa4d0828af74ac413a364a175b887c1d216df1b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_service/src/file_handlers/graphql.rs:754-764 | crates/biome_service/src/file_handlers/graphql.rs:785-795 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_service/src/file_handlers/graphql.rs:754\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_service/src/file_handlers/graphql.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd61f1690a5d954b71246e88e0f9ba5db23d30152cdf7c0b5081a70b1b2b1c1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_service/src/file_handlers/html.rs:1447-1457 | crates/biome_service/src/file_handlers/html.rs:1508-1518 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_service/src/file_handlers/html.rs:1447\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_service/src/file_handlers/html.rs"},"region":{"startLine":1447}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf27c7c56a86dadba9d7b82353516ccf1ea4c3cc5ed75db9815f00daa5d116d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_service/src/file_handlers/html/parse_embedded_nodes.rs:838-848 | crates/biome_service/src/file_handlers/html/parse_embedded_nodes.rs:876-886 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_service/src/file_handlers/html/parse_embedded_nodes.rs:838\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_service/src/file_handlers/html/parse_embedded_nodes.rs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eed10a320069f19031798ee9e281e04e1cb537887bd795705aa2641b1a11a97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): crates/biome_service/src/file_handlers/json.rs:896-906 | crates/biome_service/src/file_handlers/json.rs:948-956 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_service/src/file_handlers/json.rs:896\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_service/src/file_handlers/json.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"8af73a76dda187115db44741d08d83f1981837caca0c95aa34d2cd80ee715f3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): crates/biome_service/src/file_handlers/md.rs:793-801 | crates/biome_service/src/file_handlers/md.rs:826-836 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_service/src/file_handlers/md.rs:793\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_service/src/file_handlers/md.rs"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f7c75f47643b94a8d78c883a2af5dba08d82b7ea7f7d3ea046d766b062ddf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_service/src/file_handlers/yaml.rs:649-659 | crates/biome_service/src/file_handlers/yaml.rs:680-690 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_service/src/file_handlers/yaml.rs:649\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_service/src/file_handlers/yaml.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab5e438c55e4e01f7828ab65846c5e120ef97fa8875d277327bd92d38ca7304b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/biome_service/src/settings.rs:1146-1155 | crates/biome_service/src/settings.rs:1168-1178 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_service/src/settings.rs:1146\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_service/src/settings.rs"},"region":{"startLine":1146}}}],"partialFingerprints":{"codehealthFindingId/v1":"4734a79948017d5975fe19ba549fcd34388754d704424b15b67a74beea6fdbb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/biome_service/src/settings.rs:2098-2107 | crates/biome_service/src/settings.rs:2356-2366 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060options\u0060 to \u0060\u0026mut JsFormatOptions\u0060 in one and \u0060\u0026mut MdFormatOptions\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/biome_service/src/settings.rs"},"region":{"startLine":2098}}}],"partialFingerprints":{"codehealthFindingId/v1":"52adb12c73ab9130d0b93ec1c6882a337fe395fdb46b30eccd56bffc2c11d990"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): crates/biome_service/src/settings.rs:2129-2137 | crates/biome_service/src/settings.rs:2181-2191 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060options\u0060 to \u0060\u0026mut JsFormatOptions\u0060 in one and \u0060\u0026mut JsonFormatOptions\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_service/src/settings.rs:2179\u0060 calls \u0060set_expand\u0060, \u0060Some\u0060 and \u0060crates/biome_service/src/settings.rs:2129\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/biome_service/src/settings.rs"},"region":{"startLine":2129}}}],"partialFingerprints":{"codehealthFindingId/v1":"626605662ba7788b72e1ca4859acfca0f37f97aa8eb23cfbdd08994c9b570253"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/biome_service/src/workspace_types.rs:287-297 | crates/biome_service/src/workspace_types.rs:314-323 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_service/src/workspace_types.rs:287\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/workspace_types.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed6694abbf64c3e2432c411654509e2ea6078768abeb2b15d1d3e686f734908"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_syntax_codegen/src/generate_nodes.rs:381-391 | xtask/codegen/src/generate_nodes.rs:411-421 \u2014 before extracting anything, compare \u0060crates/biome_syntax_codegen/src/generate_nodes.rs\u0060 and \u0060xtask/codegen/src/generate_nodes.rs\u0060 as WHOLE FILES: this scan already matched 26 separate duplicated blocks between them, totalling at least 933 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_syntax_codegen/src/generate_nodes.rs:381\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_syntax_codegen/src/generate_nodes.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"2291c9ceae67291578574671bc121b16694899f3c7a019c7861fca339a0af9ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_syntax_codegen/src/generate_nodes.rs:510-520 | xtask/codegen/src/generate_nodes.rs:542-552 \u2014 before extracting anything, compare \u0060crates/biome_syntax_codegen/src/generate_nodes.rs\u0060 and \u0060xtask/codegen/src/generate_nodes.rs\u0060 as WHOLE FILES: this scan already matched 26 separate duplicated blocks between them, totalling at least 933 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_syntax_codegen/src/generate_nodes.rs:510\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_syntax_codegen/src/generate_nodes.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6412b12e4e1cd3be252750073db74182c746343f5af0ad5776cf94ba40d9814"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_vue_semantic/src/semantic_model/component.rs:1699-1709 | crates/biome_vue_semantic/src/semantic_model/component.rs:1815-1825 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_vue_semantic/src/semantic_model/component.rs:1699\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_vue_semantic/src/semantic_model/component.rs"},"region":{"startLine":1699}}}],"partialFingerprints":{"codehealthFindingId/v1":"1695a106aaea89d77dae9151b4a66ef6722d9ba903d3e44a4f040490d4f2b588"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): xtask/codegen/src/generate_configuration.rs:648-658 | xtask/codegen/src/generate_configuration.rs:804-814 \u2014 both copies are in the same file, so extract the block 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":"xtask/codegen/src/generate_configuration.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"c67ebacaa534c4ecb266e5bf0f33dc7c9f9cfb9217a0c01f2feaddb33d731a9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): xtask/codegen/src/generate_configuration.rs:746-756 | xtask/codegen/src/generate_configuration.rs:921-931 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060xtask/codegen/src/generate_configuration.rs:746\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/generate_configuration.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"90409cae3a5c5a1d3f41b8ec9e2731632d93ff563f54b857b975887766b64214"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 12): crates/biome_module_graph/src/db/type_inference/expressions.rs:897-906 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1228-1237 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1522-1531 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1571-1580 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1734-1743 | crates/biome_module_graph/src/db/type_inference/expressions.rs:2369-2378 | crates/biome_module_graph/src/db/type_inference/expressions.rs:2446-2455 | crates/biome_module_graph/src/db/type_inference/expressions.rs:2874-2883 | crates/biome_module_graph/src/db/type_inference/expressions.rs:2935-2944 | crates/biome_module_graph/src/db/type_inference/expressions.rs:3162-3171 | crates/biome_module_graph/src/db/type_inference/expressions.rs:3213-3222 | crates/biome_module_graph/src/db/type_inference/lookup.rs:947-956 \u2014 before extracting anything, compare \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs\u0060 and \u0060crates/biome_module_graph/src/db/type_inference/lookup.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 234 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs:895\u0060 calls \u0060Extends\u0060 and \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs:2367\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/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6f160bc29547a30077ca5c9116cb91b03953377d5527194ab1a43018f27fed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 11): crates/biome_module_graph/src/db/type_inference/expressions.rs:1075-1084 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1208-1217 | crates/biome_module_graph/src/db/type_inference/expressions.rs:2352-2361 | crates/biome_module_graph/src/db/type_inference/expressions.rs:2427-2436 | crates/biome_module_graph/src/db/type_inference/expressions.rs:2855-2864 | crates/biome_module_graph/src/db/type_inference/expressions.rs:3010-3019 | crates/biome_module_graph/src/db/type_inference/expressions.rs:3092-3101 | crates/biome_module_graph/src/db/type_inference/expressions.rs:3142-3151 | crates/biome_module_graph/src/db/type_inference/expressions.rs:3193-3202 | crates/biome_module_graph/src/db/type_inference/lookup.rs:820-829 | crates/biome_module_graph/src/db/type_inference/resolver.rs:1059-1068 \u2014 before extracting anything, compare \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs\u0060 and \u0060crates/biome_module_graph/src/db/type_inference/lookup.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 234 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/biome_module_graph/src/db/type_inference/expressions.rs:1218\u0060 calls \u0060Tuple\u0060 and \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs:1085\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c6319f79ca966733a95f4ae99e29632ba4d2d33c446ef7ae9db2f932ad647a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 10): crates/biome_module_graph/src/db/type_inference/expressions.rs:1210-1219 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1716-1725 | crates/biome_module_graph/src/db/type_inference/expressions.rs:2213-2222 | crates/biome_module_graph/src/db/type_inference/expressions.rs:2857-2866 | crates/biome_module_graph/src/db/type_inference/expressions.rs:3012-3021 | crates/biome_module_graph/src/db/type_inference/expressions.rs:3094-3103 | crates/biome_module_graph/src/db/type_inference/expressions.rs:3144-3153 | crates/biome_module_graph/src/db/type_inference/expressions.rs:3195-3204 | crates/biome_module_graph/src/db/type_inference/lookup.rs:822-831 | crates/biome_module_graph/src/db/type_inference/resolver.rs:1061-1070 \u2014 before extracting anything, compare \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs\u0060 and \u0060crates/biome_module_graph/src/db/type_inference/lookup.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 234 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/biome_module_graph/src/db/type_inference/expressions.rs:1222\u0060 calls \u0060Union\u0060 and \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs:2225\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/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":1210}}}],"partialFingerprints":{"codehealthFindingId/v1":"188919a66fae546740bc49abfcf050e703a27aeb51ed0350227620bbb12e3349"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 7): crates/biome_css_formatter/src/verbatim.rs:137-146 | crates/biome_graphql_formatter/src/verbatim.rs:46-55 | crates/biome_grit_formatter/src/verbatim.rs:46-55 | crates/biome_html_formatter/src/verbatim.rs:59-68 | crates/biome_js_formatter/src/verbatim.rs:46-55 | crates/biome_json_formatter/src/verbatim.rs:45-54 | crates/biome_yaml_formatter/src/verbatim.rs:50-59 \u2014 before extracting anything, compare \u0060crates/biome_css_formatter/src/verbatim.rs\u0060 and \u0060crates/biome_graphql_formatter/src/verbatim.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 150 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060\u0026mut Formatter\u003CCssFormatContext\u003E\u0060 in one and \u0060\u0026mut Formatter\u003CGraphqlFormatContext\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_formatter/src/verbatim.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff22336833b997285caa99b05ac115d34d19cbc0ee77d07b7a941501a453616f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 7): crates/biome_css_formatter/src/verbatim.rs:178-186 | crates/biome_graphql_formatter/src/verbatim.rs:93-102 | crates/biome_grit_formatter/src/verbatim.rs:93-101 | crates/biome_html_formatter/src/verbatim.rs:106-114 | crates/biome_js_formatter/src/verbatim.rs:93-101 | crates/biome_json_formatter/src/verbatim.rs:92-100 | crates/biome_yaml_formatter/src/verbatim.rs:117-125 \u2014 before extracting anything, compare \u0060crates/biome_css_formatter/src/verbatim.rs\u0060 and \u0060crates/biome_graphql_formatter/src/verbatim.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 150 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060\u0026mut Formatter\u003CCssFormatContext\u003E\u0060 in one and \u0060\u0026mut Formatter\u003CGraphqlFormatContext\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_formatter/src/verbatim.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd1d473ccfb74b8059de15683aadede7fac9e0f198dbf7a9992c1ec1e26ecfeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 7): crates/biome_module_graph/src/db/type_inference/expressions.rs:586-595 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1093-1102 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1176-1185 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1804-1813 | crates/biome_module_graph/src/db/type_inference/expressions.rs:2509-2518 | crates/biome_module_graph/src/db/type_inference/lookup.rs:771-780 | crates/biome_module_graph/src/db/type_inference/lookup.rs:839-848 \u2014 before extracting anything, compare \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs\u0060 and \u0060crates/biome_module_graph/src/db/type_inference/lookup.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 234 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs:584\u0060 calls \u0060Intersection\u0060, \u0060TypeOperator\u0060 and \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs:1092\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/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a89a1764e89f6f5790109b3ee1fdc6083032de1f268da8f772530a956c53e01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5): crates/biome_graphql_formatter/src/graphql/definitions/enum_type_definition.rs:14-28 | crates/biome_graphql_formatter/src/graphql/definitions/field_definition.rs:15-29 | crates/biome_graphql_formatter/src/graphql/definitions/input_object_type_definition.rs:16-30 | crates/biome_graphql_formatter/src/graphql/definitions/interface_type_definition.rs:15-24 | crates/biome_graphql_formatter/src/graphql/definitions/object_type_definition.rs:15-29 \u2014 before extracting anything, compare \u0060crates/biome_graphql_formatter/src/graphql/definitions/enum_type_definition.rs\u0060 and \u0060crates/biome_graphql_formatter/src/graphql/definitions/input_object_type_definition.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 54 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_graphql_formatter/src/graphql/definitions/enum_type_definition.rs:14\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026GraphqlEnumTypeDefinition\u0060 in one and \u0060\u0026GraphqlFieldDefinition\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/biome_graphql_formatter/src/graphql/definitions/enum_type_definition.rs:31\u0060 calls \u0060format\u0060 and \u0060crates/biome_graphql_formatter/src/graphql/definitions/object_type_definition.rs:32\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/biome_graphql_formatter/src/graphql/definitions/enum_type_definition.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"41be6b16440244f743b4d3b023bdca23ca761ebe3c871d4c8d5198a66db91ef9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5): crates/biome_grit_patterns/src/pattern_compiler/auto_wrap.rs:118-127 | crates/biome_grit_patterns/src/pattern_compiler/auto_wrap.rs:182-191 | crates/biome_grit_patterns/src/pattern_compiler/auto_wrap.rs:276-285 | crates/biome_grit_patterns/src/pattern_compiler/auto_wrap.rs:340-349 | crates/biome_grit_patterns/src/pattern_compiler/step_compiler.rs:64-73 \u2014 there are 5 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_grit_patterns/src/pattern_compiler/auto_wrap.rs:116\u0060 calls \u0060Contains\u0060 and \u0060crates/biome_grit_patterns/src/pattern_compiler/auto_wrap.rs:180\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/biome_grit_patterns/src/pattern_compiler/auto_wrap.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"49cf699637ad705c285681c53eafa4107f680900d8822e04c4c708b37108dc77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5): crates/biome_syntax_codegen/src/generate_nodes.rs:280-289 | crates/biome_syntax_codegen/src/generate_nodes.rs:666-676 | xtask/codegen/src/generate_nodes.rs:312-321 | xtask/codegen/src/generate_nodes.rs:686-696 | xtask/codegen/src/generate_nodes.rs:774-784 \u2014 before extracting anything, compare \u0060crates/biome_syntax_codegen/src/generate_nodes.rs\u0060 and \u0060xtask/codegen/src/generate_nodes.rs\u0060 as WHOLE FILES: this scan already matched 26 separate duplicated blocks between them, totalling at least 933 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_syntax_codegen/src/generate_nodes.rs:280\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_syntax_codegen/src/generate_nodes.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ece2b717c2b47c85ef2356f5d74c9e1305a36b54cd81f3577c529e8a2292cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): crates/biome_css_parser/src/lexer/mod.rs:1707-1716 | crates/biome_graphql_parser/src/lexer/mod.rs:314-323 | crates/biome_grit_parser/src/lexer/mod.rs:329-338 | crates/biome_json_parser/src/lexer/mod.rs:374-383 \u2014 before extracting anything, compare \u0060crates/biome_graphql_parser/src/lexer/mod.rs\u0060 and \u0060crates/biome_grit_parser/src/lexer/mod.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 82 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_parser/src/lexer/mod.rs:1707\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/biome_css_parser/src/lexer/mod.rs"},"region":{"startLine":1707}}}],"partialFingerprints":{"codehealthFindingId/v1":"347660bc4f9b6a73b43cdd28813056a36e47e5c90245151b14b6ab47bf3d6270"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/biome_cli/src/execute/migrate.rs:284-293 | crates/biome_cli/src/execute/migrate.rs:361-370 | crates/biome_cli/src/execute/migrate.rs:446-455 \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/biome_cli/src/execute/migrate.rs:284\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_cli/src/execute/migrate.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c64f32e1bfe8f663ca2576107126ee19c8f4573168b7b33586b2e6efc0e957d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/biome_grit_parser/src/parser/patterns.rs:132-141 | crates/biome_grit_parser/src/parser/patterns.rs:201-210 | crates/biome_grit_parser/src/parser/patterns.rs:308-317 \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/biome_grit_parser/src/parser/patterns.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"43af94fb917799a32541a1a059e3ff20702b188e5476588196b7f67afbc32e19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/biome_js_analyze/src/lint/nursery/no_base_to_string.rs:170-179 | crates/biome_js_analyze/src/lint/nursery/no_useless_type_conversion.rs:235-244 | crates/biome_js_analyze/src/lint/style/use_spread_over_apply.rs:75-84 \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/biome_js_analyze/src/lint/nursery/no_base_to_string.rs:170\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_base_to_string.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"7490354ac15f1ac46ff8ed40129c0b7db85f6d47ff99ff9a40c0a64d7ddc32e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/biome_js_analyze/src/lint/nursery/use_react_function_component_definition.rs:342-351 | crates/biome_js_analyze/src/lint/nursery/use_react_function_component_definition.rs:390-399 | crates/biome_js_analyze/src/lint/nursery/use_react_function_component_definition.rs:485-494 \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/biome_js_analyze/src/lint/nursery/use_react_function_component_definition.rs:342\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/nursery/use_react_function_component_definition.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"7515e67f6ded018a78872c2ad3a7c774542effc413389bbd8ac9be50a700b02d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/biome_js_parser/src/syntax/class.rs:2519-2530 | crates/biome_js_parser/src/syntax/class.rs:2569-2578 | crates/biome_js_parser/src/syntax/class.rs:2611-2624 \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/biome_js_parser/src/syntax/class.rs:2519\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_parser/src/syntax/class.rs"},"region":{"startLine":2519}}}],"partialFingerprints":{"codehealthFindingId/v1":"d86a9371ca587860c7d058ca3d9d1bdc356936933acaffad8c6bd4be51b8aee2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): crates/biome_json_analyze/src/assist/source/use_sorted_package_json/sorters/eslint_config.rs:139-147 | crates/biome_json_analyze/src/assist/source/use_sorted_package_json/sorters/helpers.rs:149-158 | crates/biome_json_analyze/src/assist/source/use_sorted_package_json/sorters/helpers.rs:190-198 \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/biome_json_analyze/src/assist/source/use_sorted_package_json/sorters/eslint_config.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7cdd8501ec49082d5a1fe06ca911556d81a8dbde74738c8224a16552f6e30fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/biome_module_graph/src/format_module_graph.rs:591-600 | crates/biome_module_graph/src/format_module_graph.rs:700-709 | crates/biome_module_graph/src/format_module_graph.rs:720-729 \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/biome_module_graph/src/format_module_graph.rs:591\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_module_graph/src/format_module_graph.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e9eb492f2d5baf8360d90950ff2679c5d8e4a114872b770011cb27ddd4a568"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/biome_ruledoc_utils/src/analyzer.rs:182-191 | crates/biome_ruledoc_utils/src/analyzer.rs:208-217 | crates/biome_ruledoc_utils/src/analyzer.rs:310-320 \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/biome_ruledoc_utils/src/analyzer.rs:182\u0060 it does not close everything it opens, so those exact 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/biome_ruledoc_utils/src/analyzer.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f32bf19fc362ffa5d8a2b07603d1d6919e0f3100376a441cd9a76299855505d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/biome_ruledoc_utils/src/analyzer.rs:235-244 | crates/biome_ruledoc_utils/src/analyzer.rs:257-267 | crates/biome_ruledoc_utils/src/analyzer.rs:336-345 \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/biome_ruledoc_utils/src/analyzer.rs:235\u0060 it does not close everything it opens, so those exact 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/biome_ruledoc_utils/src/analyzer.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b41a90eaf6883d9eaf1d7ba0ffca9842c0e023c623fc9aaadf95d5487d1c41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/biome_service/src/file_handlers/css.rs:1024-1033 | crates/biome_service/src/file_handlers/javascript.rs:1693-1702 | crates/biome_service/src/file_handlers/json.rs:953-962 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/css.rs\u0060 and \u0060crates/biome_service/src/file_handlers/javascript.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 211 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_service/src/file_handlers/css.rs:1024\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/biome_service/src/file_handlers/css.rs"},"region":{"startLine":1024}}}],"partialFingerprints":{"codehealthFindingId/v1":"05cba00ee24194b1a59fbcb09c967a95f0049e5b4cf17ce767d971b25a91b31f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_cli/src/commands/inspect/plugins/mod.rs:511-520 | crates/biome_cli/src/commands/inspect/plugins/mod.rs:522-531 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_cli/src/commands/inspect/plugins/mod.rs:511\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_cli/src/commands/inspect/plugins/mod.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c740e0b868a00279e6c392a987978f3279cc8a211c5b4e6fa13b9bab11887cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/biome_cli/src/commands/rage.rs:141-150 | crates/biome_cli/src/commands/rage.rs:173-181 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_cli/src/commands/rage.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/biome_cli/src/commands/rage.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba414bb83e46c5490a56359aaa97888644e986e7aa8d5e476c190e93f3b158e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_cli/src/execute/migrate.rs:323-332 | crates/biome_cli/src/execute/migrate.rs:408-417 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_cli/src/execute/migrate.rs:323\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_cli/src/execute/migrate.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a8225479beac21dc4089c0ae17c532e440195fee9710c07d4acdfdd5eda39c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_cli/src/execute/migrate/eslint_to_biome.rs:354-363 | crates/biome_cli/src/execute/migrate/stylelint_to_biome.rs:182-191 \u2014 before extracting anything, compare \u0060crates/biome_cli/src/execute/migrate/eslint_to_biome.rs\u0060 and \u0060crates/biome_cli/src/execute/migrate/stylelint_to_biome.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_cli/src/execute/migrate/eslint_to_biome.rs:354\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/execute/migrate/eslint_to_biome.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24a73507ab8a80f4b9f17a3d16bea3f9e93e94f97ab8d0957f689bfd5c6ef86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_cli/src/reporter/json.rs:116-125 | crates/biome_cli/src/reporter/json.rs:138-147 \u2014 both copies are in the same file, so extract the block into one function there 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/biome_cli/src/reporter/json.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"012d55a855fbafcdb5e712e486d59dd1352072fce2565cde451194fea43ab3f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_cli/src/reporter/json.rs:125-134 | crates/biome_cli/src/reporter/json.rs:154-163 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_cli/src/reporter/json.rs:125\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_cli/src/reporter/json.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a9eea16ac56f30bfa915cc09bd3bad135bc4d5ef577d9a126d3fd141630491"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_diagnostics/src/display/diff.rs:574-583 | crates/biome_diagnostics/src/display/diff.rs:588-597 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_diagnostics/src/display/diff.rs:574\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_diagnostics/src/display/diff.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4463d95f4baf383d7c9db1ec34e6dc89f7f9ab762418d2b740c0b3e9dfdd59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_diagnostics/src/display/frame.rs:76-85 | crates/biome_diagnostics/src/display/frame.rs:123-132 \u2014 both copies are in the same file, so extract the block into one function there 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/biome_diagnostics/src/display/frame.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"43041cd1c8b40071f1647212466e99145d6ba8d36706246159022900fe14423c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_diagnostics/src/display_github.rs:114-123 | crates/biome_diagnostics/src/display_github.rs:132-141 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_diagnostics/src/display_github.rs:114\u0060 it does not close everything it opens, so those exact 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/biome_diagnostics/src/display_github.rs:143\u0060 calls \u0060push_str\u0060 and \u0060crates/biome_diagnostics/src/display_github.rs:125\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/biome_diagnostics/src/display_github.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e24ec33f9621c8eeb42e82a81b139b166be2c4c3105d209024ed227eb63686"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/biome_embeds/src/visitor.rs:1460-1468 | crates/biome_embeds/src/visitor.rs:1609-1618 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_embeds/src/visitor.rs:1460\u0060 it does not close everything it opens, so those exact 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/biome_embeds/src/visitor.rs"},"region":{"startLine":1460}}}],"partialFingerprints":{"codehealthFindingId/v1":"6912214734a03bbb957be09e9482df25e417fce998681c9f51f8166beb243f21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_formatter/src/comments/builder.rs:613-622 | crates/biome_formatter/src/comments/builder.rs:657-666 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_formatter/src/comments/builder.rs:613\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/biome_formatter/src/comments/builder.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a7f9ccc86ec853d0da0f379c9f1eda2c15dff9a2e045baae9d1be2e4bfb554"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_fs/src/fs.rs:298-307 | crates/biome_fs/src/fs.rs:308-317 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_fs/src/fs.rs:298\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/biome_fs/src/fs.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"f56ba6d7aa193809b46035230a4dcfa1b00139082e5fb1e1a2c488f4e93cd966"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_graphql_analyze/src/assist/source/use_sorted_enum_members.rs:189-198 | crates/biome_graphql_analyze/src/assist/source/use_sorted_selection_set.rs:238-247 \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/biome_graphql_analyze/src/assist/source/use_sorted_enum_members.rs:189\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060list\u0060 to \u0060\u0026GraphqlEnumValueList\u0060 in one and \u0060\u0026GraphqlSelectionList\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/biome_graphql_analyze/src/assist/source/use_sorted_enum_members.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"aefb2a7d8b2d841c8edad544a0c1ca3da1d4b20e72d18dc4dccd3dc1e307bbfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_html_analyze/src/lint/a11y/no_interactive_element_to_noninteractive_role.rs:132-141 | crates/biome_html_analyze/src/lint/a11y/no_noninteractive_element_to_interactive_role.rs:125-134 \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/biome_html_analyze/src/lint/a11y/no_interactive_element_to_noninteractive_role.rs:132\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_html_analyze/src/lint/a11y/no_interactive_element_to_noninteractive_role.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"df1c4ac167393f5830e7e19e7c02a9ef4b84e99dc8725f87b2fb4a3db201fc7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_html_analyze/src/lint/a11y/no_noninteractive_tabindex.rs:131-140 | crates/biome_html_analyze/src/lint/a11y/no_positive_tabindex.rs:105-114 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/a11y/no_noninteractive_tabindex.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e7b963d5f298cf420d48caa4b545a34124bd0b801383a5c942637a8efe9bac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_html_analyze/src/lint/a11y/use_valid_autocomplete.rs:88-97 | crates/biome_js_analyze/src/lint/a11y/use_valid_autocomplete.rs:93-102 \u2014 before extracting anything, compare \u0060crates/biome_html_analyze/src/lint/a11y/use_valid_autocomplete.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/a11y/use_valid_autocomplete.rs\u0060 as WHOLE FILES: 82% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_analyze/src/lint/a11y/use_valid_autocomplete.rs:88\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_html_analyze/src/lint/a11y/use_valid_autocomplete.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ba39571c147078f84400c005400614c5b165b032e57902a2524ca4ae8c0051"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_html_analyze/src/lint/correctness/use_vue_valid_v_else_if.rs:92-101 | crates/biome_html_analyze/src/lint/correctness/use_vue_valid_v_if.rs:99-108 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/correctness/use_vue_valid_v_else_if.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f60e365b6e7833f369c6911775e3359df96ae649473976e0803f2aab16ecdb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/biome_html_analyze/src/lint/nursery/no_unsafe_iframe_sandbox.rs:82-100 | crates/biome_js_analyze/src/lint/nursery/no_unsafe_iframe_sandbox.rs:83-101 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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/biome_html_analyze/src/lint/nursery/no_unsafe_iframe_sandbox.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f9b4c39582549ccea0ad3f7af5b2892d29a1d7e4b041cfd90e90993ddf4018"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_html_analyze/src/lint/nursery/use_vue_valid_v_is.rs:102-111 | crates/biome_html_analyze/src/lint/nursery/use_vue_valid_v_show.rs:82-91 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_analyze/src/lint/nursery/use_vue_valid_v_is.rs:102\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/biome_html_analyze/src/lint/nursery/use_vue_valid_v_is.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"6741b891337401146473cdf2bd8cc6d4a05e11cc53e43b56c09f3ddd16f5dcd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_html_analyze/src/services/module_graph.rs:38-47 | crates/biome_js_analyze/src/services/database.rs:54-63 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/services/database.rs:54\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/biome_html_analyze/src/services/module_graph.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea165d740c068c57679edaf2ce0896bb911090466f60097f04500fad9975f714"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_html_formatter/src/vue/auxiliary/v_for_tuple_binding.rs:10-19 | crates/biome_js_formatter/src/ts/expressions/import_type_arguments.rs:9-18 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_formatter/src/vue/auxiliary/v_for_tuple_binding.rs:10\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060\u0026mut HtmlFormatter\u0060 in one and \u0060\u0026mut JsFormatter\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/biome_js_formatter/src/ts/expressions/import_type_arguments.rs:19\u0060 calls \u0060format\u0060, \u0060space\u0060, \u0060Some\u0060 and \u0060crates/biome_html_formatter/src/vue/auxiliary/v_for_tuple_binding.rs:20\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_formatter/src/vue/auxiliary/v_for_tuple_binding.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c557c111836bfbdb09f99cd713812904814676b08a2572d07a9663722da3aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/biome_html_parser/src/syntax/svelte.rs:801-810 | crates/biome_html_parser/src/syntax/svelte.rs:816-824 \u2014 both copies are in the same file, so extract the block into one function there 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/biome_html_parser/src/syntax/svelte.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d0668ce16e9bce83b6a9bb0769a536d6d09faa1354fea3a1dc275b3db5a9539"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_html_syntax/src/static_value.rs:89-98 | crates/biome_js_syntax/src/static_value.rs:89-98 \u2014 before extracting anything, compare \u0060crates/biome_html_syntax/src/static_value.rs\u0060 and \u0060crates/biome_js_syntax/src/static_value.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_syntax/src/static_value.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"7529794689d8129ddc9a64e733523a49d738e1439caf9b39238f729c8be1a6f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_js_analyze/src/lint/a11y/no_interactive_element_to_noninteractive_role.rs:143-152 | crates/biome_js_analyze/src/lint/a11y/no_noninteractive_element_to_interactive_role.rs:133-142 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/a11y/no_interactive_element_to_noninteractive_role.rs:143\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/a11y/no_interactive_element_to_noninteractive_role.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ba2f3d4a4b859705f3d1a042aec437eb782b520c701f0d42adb33d4c367b45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): crates/biome_js_analyze/src/lint/complexity/no_playwright_useless_await.rs:130-137 | crates/biome_js_analyze/src/lint/style/use_fragment_syntax.rs:90-99 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/complexity/no_playwright_useless_await.rs:130\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/complexity/no_playwright_useless_await.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab5abf2abd666f551cb4c6eca84238076915a464f12b759fe96652580bf1c7e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/no_array_for_each.rs:280-288 | crates/biome_js_analyze/src/lint/nursery/no_eager_array_methods_in_loops.rs:415-424 \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/biome_js_analyze/src/lint/nursery/no_array_for_each.rs:280\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/nursery/no_array_for_each.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"72ead47ae5bc044454c1c474bab42a77ac946409174bc752cf693d8f6d332309"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/no_eager_array_methods_in_loops.rs:107-116 | crates/biome_js_analyze/src/lint/nursery/no_useless_spread.rs:511-518 \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/biome_js_analyze/src/lint/nursery/no_eager_array_methods_in_loops.rs:107\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_eager_array_methods_in_loops.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"b62e5ffbc0ce48865b00c08d7c508a941d9e000384372c1c315ce21391b8a0c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/use_better_dom_traversing.rs:421-430 | crates/biome_js_analyze/src/lint/nursery/use_better_dom_traversing.rs:479-488 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/biome_js_analyze/src/lint/nursery/use_better_dom_traversing.rs:431\u0060 calls \u0060is_optional\u0060 and \u0060crates/biome_js_analyze/src/lint/nursery/use_better_dom_traversing.rs:489\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/biome_js_analyze/src/lint/nursery/use_better_dom_traversing.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d34c55596c35c35ce82b4ba14bfbaf7726e510b3b5542f365842f30918bd23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/use_modern_math_apis.rs:339-346 | crates/biome_js_analyze/src/lint/nursery/use_modern_math_apis.rs:396-405 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_js_analyze/src/lint/nursery/use_modern_math_apis.rs:339\u0060 it does not close everything it opens, so those exact 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/biome_js_analyze/src/lint/nursery/use_modern_math_apis.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd50f5bb10e37a67935f75875b00afc6c4eaacb6ae45b352ae3719724ef4fb6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/use_nullish_coalescing.rs:786-795 | crates/biome_js_analyze/src/lint/nursery/use_nullish_coalescing.rs:802-811 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_js_analyze/src/lint/nursery/use_nullish_coalescing.rs:786\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/nursery/use_nullish_coalescing.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"219352d3d8284ae53108c95971dd1184f4b205d9700b97e5857e87f4f89818a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_js_analyze/src/lint/style/no_yoda_expression.rs:295-305 | crates/biome_js_analyze/src/lint/style/no_yoda_expression.rs:338-348 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/style/no_yoda_expression.rs:295\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/biome_js_analyze/src/lint/style/no_yoda_expression.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd7b2aaee8ea0cd6b8397f46508e204352c7a5f12bbe8a4a549b863dc9d4f3a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_js_analyze/src/lint/style/use_consistent_array_type.rs:98-107 | crates/biome_js_analyze/src/lint/style/use_consistent_array_type.rs:133-142 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/style/use_consistent_array_type.rs:98\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_consistent_array_type.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f5bfeaa479a7303103029feb28bc11803e69b64f6573f825ebec758cec80884"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_js_analyze/src/lint/style/use_destructuring.rs:144-153 | crates/biome_js_analyze/src/lint/style/use_destructuring.rs:184-193 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_js_analyze/src/lint/style/use_destructuring.rs:144\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_destructuring.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe94bba48fb897bedca63bd5d4533f210772836ea88700aa1b1fefebd394f6b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_js_analyze/src/lint/style/use_export_type.rs:540-549 | crates/biome_js_analyze/src/lint/style/use_import_type.rs:866-875 \u2014 before extracting anything, compare \u0060crates/biome_js_analyze/src/lint/style/use_export_type.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/style/use_import_type.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/style/use_export_type.rs:540\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/style/use_export_type.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e585e50f8e99a55cda39d2122b13cf3e954017e14674d7e50617779feb5941"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_js_analyze/src/services/vue.rs:158-167 | crates/biome_js_analyze/src/services/vue.rs:232-241 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/services/vue.rs:158\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/services/vue.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d56c92df09020719304613e531ef60997398242a25e037f489db21921a0836"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/biome_js_parser/src/syntax/module.rs:771-779 | crates/biome_js_parser/src/syntax/module.rs:1056-1065 \u2014 both copies are in the same file, so extract the block into one function there 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/biome_js_parser/src/syntax/module.rs"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e44522bbf0737704641bd6e395753e7dcd7db1c328c59912f6257026140847"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_js_semantic/src/events.rs:806-815 | crates/biome_js_semantic/src/events.rs:820-829 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_semantic/src/events.rs:806\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_js_semantic/src/events.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b88ee8fdd99912d6bfdc151d47b00ecf7ff18284b08d7d363cc263d60e6aab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_js_type_info/src/local_inference.rs:1062-1071 | crates/biome_js_type_info/src/local_inference.rs:1091-1100 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_type_info/src/local_inference.rs:1062\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/biome_js_type_info/src/local_inference.rs"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee132bc2175aa749cb3251926d0a6471fd6879ac63b4e4908b42f3ec9c161c9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_js_type_info/src/return_type_relation.rs:200-209 | crates/biome_js_type_info/src/return_type_relation.rs:231-240 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_js_type_info/src/return_type_relation.rs:200\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/return_type_relation.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"babe18841c901f6120ba9f221724299073c323bc8796080466c82b91882146de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_json_parser/src/lexer/mod.rs:214-223 | crates/biome_markdown_parser/src/lexer/mod.rs:1400-1409 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_json_parser/src/lexer/mod.rs:214\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_json_parser/src/lexer/mod.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc78b867f0b276477c1b5b30cc2123af76a3e9090028a19e62670f35ce4a1dcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_lsp/src/handlers/analysis.rs:62-71 | crates/biome_lsp/src/handlers/formatting.rs:27-36 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. 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/biome_lsp/src/handlers/analysis.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c1b5d856f39817fa2781791c674260183af0d2b1df1d9e5231e4cdbeb0691d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_manifest/src/lib.rs:103-113 | crates/biome_manifest/src/lib.rs:165-175 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_manifest/src/lib.rs:103\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_manifest/src/lib.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"7378dee0c5d93e5737ae5f7a25a690edfda2af8ca45567ad147e94a4a961579b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/biome_markdown_formatter/src/markdown/lists/block_list.rs:81-90 | crates/biome_markdown_formatter/src/quote.rs:144-152 \u2014 before extracting anything, compare \u0060crates/biome_markdown_formatter/src/markdown/lists/block_list.rs\u0060 and \u0060crates/biome_markdown_formatter/src/quote.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_markdown_formatter/src/markdown/lists/block_list.rs:81\u0060 it does not close everything it opens, so those exact 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/biome_markdown_formatter/src/markdown/lists/block_list.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"879c2538b439ad90a1996b7d661da6d9c879f7b6add7b5282905c42fc53d05fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_markdown_parser/src/syntax/list.rs:765-776 | crates/biome_markdown_parser/src/syntax/list.rs:794-803 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_markdown_parser/src/syntax/list.rs:765\u0060 it does not close everything it opens, so those exact 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/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a76dcc8d216287440bdcab9d0763aeb5ebda627867187d897eae8f1fd5cf722"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_markdown_parser/src/to_html.rs:86-95 | crates/biome_markdown_syntax/src/block_ext.rs:179-189 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_markdown_parser/src/to_html.rs:86\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/to_html.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"deebf4863152671e2abb371c1e91fc58ba99c20c8fc63483813ae181eba6dadb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_module_graph/src/db/queries/css.rs:430-439 | crates/biome_module_graph/src/db/queries/css.rs:730-739 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_module_graph/src/db/queries/css.rs:430\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/biome_module_graph/src/db/queries/css.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ba7ec0c20d1b3a3b920d126c7f4b22521769695806a58a9698a5a1068c7f64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_module_graph/src/db/queries/type_inference/calls/implementation.rs:642-651 | crates/biome_module_graph/src/db/queries/type_inference/calls/implementation.rs:740-749 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_module_graph/src/db/queries/type_inference/calls/implementation.rs:642\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/queries/type_inference/calls/implementation.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbfd2ac8fa33a21d9224e064c2b06a3e8e3367c9dc57bf0ef10f1c3c62b33f3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_module_graph/src/db/type_inference/expressions.rs:2800-2809 | crates/biome_module_graph/src/db/type_inference/expressions.rs:2925-2934 \u2014 both copies are in the same file, so extract the block 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/biome_module_graph/src/db/type_inference/expressions.rs:2935\u0060 calls \u0060InstanceOf\u0060 and \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs:2810\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":2800}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ae000a1c08a67a5ce65a125dda2fed48b854c5086d5c66d67c514582ad45f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_module_graph/src/type_inference/profiling.rs:321-330 | crates/biome_module_graph/src/type_inference/profiling.rs:338-347 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_module_graph/src/type_inference/profiling.rs:321\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/type_inference/profiling.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"67deaaad7b6b9019ce651395e6261801a400cc0ad5d0ff532023fb41ac1ba405"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_module_graph/src/type_inference/profiling/display/compact.rs:822-831 | crates/biome_module_graph/src/type_inference/profiling/display/verbose.rs:466-475 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/type_inference/profiling/display/compact.rs"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"25156e3420051e87bac9d3517c7cd2da9f50577710985ad922e8da4e424ed060"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_project_layout/src/project_layout.rs:176-185 | crates/biome_project_layout/src/project_layout.rs:291-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_project_layout/src/project_layout.rs:176\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/biome_project_layout/src/project_layout.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de34df2f4232bdbd69b0e8deeff7916453d7a5d41e632f5dd431c076c42e5a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_rowan/src/cursor.rs:259-268 | crates/biome_rowan/src/cursor.rs:273-282 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_rowan/src/cursor.rs:259\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_rowan/src/cursor.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"5360491c089ae297e256fc56e6ea28f15178e21ac3bfb442124b3bc0d1a02b2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_rowan/src/cursor/node.rs:259-268 | crates/biome_rowan/src/cursor/node.rs:276-285 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_rowan/src/cursor/node.rs:259\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_rowan/src/cursor/node.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddadc0c20b4c1895a20fe7ee199f75dda40baf80c4ca90d9567e94ee0424693c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_ruledoc_utils/src/analyzer.rs:208-217 | crates/biome_ruledoc_utils/src/analyzer.rs:278-287 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_ruledoc_utils/src/analyzer.rs:208\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_ruledoc_utils/src/analyzer.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"2edbfe75c57fe41dd5dbca74872c46a9659d6d7374b01290fc9e112248046033"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_service/src/diagnostics.rs:639-648 | crates/biome_service/src/diagnostics.rs:654-663 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_service/src/diagnostics.rs:639\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060fmt\u0060 to \u0060\u0026mut Formatter\u003C\u0027_\u003E\u0060 in one and \u0060\u0026mut biome_console::fmt::Formatter\u003C\u0027_\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/diagnostics.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"13310206a88c2795a2e84531d9041fb02f4146b7a3243dd3fbc3ce25e8371d43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_service/src/file_handlers/graphql.rs:673-682 | crates/biome_service/src/file_handlers/yaml.rs:568-577 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/graphql.rs\u0060 and \u0060crates/biome_service/src/file_handlers/yaml.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 236 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_service/src/file_handlers/graphql.rs:673\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_service/src/file_handlers/graphql.rs"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"866e52e03c5b96acd80b599d908ae12822954232e57177836a1aec5e889f1a16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_service/src/file_handlers/html/parse_embedded_nodes.rs:735-744 | crates/biome_service/src/file_handlers/html/parse_embedded_nodes.rs:763-772 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_service/src/file_handlers/html/parse_embedded_nodes.rs:735\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_service/src/file_handlers/html/parse_embedded_nodes.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff1726d720f2ccb09b422c6c855c2c23dc84189794a31f874b6142ed51b0847"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/biome_syntax_codegen/src/generate_nodes.rs:894-903 | xtask/codegen/src/generate_nodes.rs:933-941 \u2014 before extracting anything, compare \u0060crates/biome_syntax_codegen/src/generate_nodes.rs\u0060 and \u0060xtask/codegen/src/generate_nodes.rs\u0060 as WHOLE FILES: this scan already matched 26 separate duplicated blocks between them, totalling at least 933 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_syntax_codegen/src/generate_nodes.rs:894\u0060 it does not close everything it opens, so those exact 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/biome_syntax_codegen/src/generate_nodes.rs"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4977cb3dd7805e99146e5e8b75ca3ab75143775ba3eff724b1e1418f0b6ca15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_syntax_codegen/src/generate_nodes.rs:969-978 | xtask/codegen/src/generate_nodes.rs:1008-1017 \u2014 before extracting anything, compare \u0060crates/biome_syntax_codegen/src/generate_nodes.rs\u0060 and \u0060xtask/codegen/src/generate_nodes.rs\u0060 as WHOLE FILES: this scan already matched 26 separate duplicated blocks between them, totalling at least 933 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_syntax_codegen/src/generate_nodes.rs:969\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_syntax_codegen/src/generate_nodes.rs"},"region":{"startLine":969}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc9cbd1dceafa55203baea922d5751f624b764ca7c77c25788bc31358b1ad7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): xtask/codegen/src/promote_rules.rs:408-417 | xtask/codegen/src/promote_rules.rs:432-441 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060xtask/codegen/src/promote_rules.rs:408\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/promote_rules.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"159006ba9e40b1a5f762242a831b2a96f46d45062fe95f03836c752a9a0c9ed0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 14): crates/biome_module_graph/src/db/type_inference/expressions.rs:888-896 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1085-1093 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1168-1176 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1219-1227 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1513-1521 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1562-1570 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1725-1733 | crates/biome_module_graph/src/db/type_inference/expressions.rs:2437-2445 | crates/biome_module_graph/src/db/type_inference/expressions.rs:2501-2509 | crates/biome_module_graph/src/db/type_inference/expressions.rs:3153-3161 | crates/biome_module_graph/src/db/type_inference/expressions.rs:3204-3212 | crates/biome_module_graph/src/db/type_inference/lookup.rs:763-771 | crates/biome_module_graph/src/db/type_inference/lookup.rs:831-839 | crates/biome_module_graph/src/db/type_inference/resolver.rs:1070-1078 \u2014 before extracting anything, compare \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs\u0060 and \u0060crates/biome_module_graph/src/db/type_inference/lookup.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 234 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/biome_module_graph/src/db/type_inference/expressions.rs:897\u0060 calls \u0060InstanceOf\u0060 and \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs:1177\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"bae25188a4c421cddd885dfe0a98c5e5e57e2a80e9607ea72614a512f07368a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 13): crates/biome_module_graph/src/db/type_inference/expressions.rs:887-895 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1167-1175 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1218-1226 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1512-1520 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1561-1569 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1724-1732 | crates/biome_module_graph/src/db/type_inference/expressions.rs:2500-2508 | crates/biome_module_graph/src/db/type_inference/expressions.rs:3152-3160 | crates/biome_module_graph/src/db/type_inference/expressions.rs:3203-3211 | crates/biome_module_graph/src/db/type_inference/lookup.rs:762-770 | crates/biome_module_graph/src/db/type_inference/lookup.rs:830-838 | crates/biome_module_graph/src/db/type_inference/lookup.rs:938-946 | crates/biome_module_graph/src/db/type_inference/resolver.rs:1069-1077 \u2014 before extracting anything, compare \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs\u0060 and \u0060crates/biome_module_graph/src/db/type_inference/lookup.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 234 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/biome_module_graph/src/db/type_inference/expressions.rs:897\u0060 calls \u0060InstanceOf\u0060 and \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs:1177\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/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e6ed56da9a752e5a131c3e292ea5a405393647b52f2eca2c974c4d47e7913b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 13): crates/biome_module_graph/src/db/type_inference/expressions.rs:1161-1169 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1212-1220 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1555-1563 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1718-1726 | crates/biome_module_graph/src/db/type_inference/expressions.rs:2215-2223 | crates/biome_module_graph/src/db/type_inference/expressions.rs:2494-2502 | crates/biome_module_graph/src/db/type_inference/expressions.rs:2859-2867 | crates/biome_module_graph/src/db/type_inference/expressions.rs:3014-3022 | crates/biome_module_graph/src/db/type_inference/expressions.rs:3096-3104 | crates/biome_module_graph/src/db/type_inference/expressions.rs:3146-3154 | crates/biome_module_graph/src/db/type_inference/expressions.rs:3197-3205 | crates/biome_module_graph/src/db/type_inference/lookup.rs:824-832 | crates/biome_module_graph/src/db/type_inference/resolver.rs:1063-1071 \u2014 before extracting anything, compare \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs\u0060 and \u0060crates/biome_module_graph/src/db/type_inference/lookup.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 234 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs:1211\u0060 calls \u0060Class\u0060 and \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs:1160\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"5848c20b7ed9c25560ea01ba939dc4264ed4eccd4138646d1eafd52e536c028a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 6): crates/biome_service/src/file_handlers/css.rs:840-849 | crates/biome_service/src/file_handlers/graphql.rs:674-682 | crates/biome_service/src/file_handlers/html.rs:1328-1337 | crates/biome_service/src/file_handlers/json.rs:794-803 | crates/biome_service/src/file_handlers/md.rs:707-715 | crates/biome_service/src/file_handlers/yaml.rs:569-577 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/css.rs\u0060 and \u0060crates/biome_service/src/file_handlers/graphql.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 202 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_service/src/file_handlers/css.rs:840\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_service/src/file_handlers/html.rs:1327\u0060 calls \u0060Some\u0060 and \u0060crates/biome_service/src/file_handlers/css.rs:839\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/biome_service/src/file_handlers/css.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"469fafa7a12068197e596b0d336108f2f1c0be1eeb54f86da39cece4a538775d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20139 lines \u00D7 5): crates/biome_css_formatter/src/scss/statements/forward_at_rule.rs:25-33 | crates/biome_css_formatter/src/scss/statements/include_at_rule.rs:26-34 | crates/biome_css_formatter/src/scss/statements/use_at_rule.rs:24-32 | crates/biome_html_formatter/src/svelte/auxiliary/await_opening_block.rs:31-39 | crates/biome_js_formatter/src/ts/bindings/type_parameter.rs:23-28 \u2014 before extracting anything, compare \u0060crates/biome_css_formatter/src/scss/statements/forward_at_rule.rs\u0060 and \u0060crates/biome_css_formatter/src/scss/statements/use_at_rule.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_formatter/src/scss/statements/forward_at_rule.rs:25\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060\u0026mut CssFormatter\u0060 in one and \u0060\u0026mut HtmlFormatter\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_css_formatter/src/scss/statements/include_at_rule.rs:24\u0060 calls \u0060format\u0060, \u0060with_text_case\u0060 and \u0060crates/biome_css_formatter/src/scss/statements/forward_at_rule.rs:23\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/biome_css_formatter/src/scss/statements/forward_at_rule.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"d200010962e7c55b09fdf4b5a0d50832b8e64d7fce9760ba7cfe4eaed255fe79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/biome_graphql_formatter/src/lib.rs:188-196 | crates/biome_grit_formatter/src/lib.rs:82-90 | crates/biome_json_formatter/src/lib.rs:190-198 | crates/biome_markdown_formatter/src/lib.rs:233-241 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060\u0026mut GraphqlFormatter\u0060 in one and \u0060\u0026mut GritFormatter\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/biome_graphql_formatter/src/lib.rs:198\u0060 calls \u0060fmt_fields\u0060 and \u0060crates/biome_markdown_formatter/src/lib.rs:244\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_graphql_formatter/src/lib.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a7aa7b6a4557c7dd4bfb10576e2f51534694cae368c22bdf158d63ecb1edd84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/biome_module_graph/src/db/type_inference/expressions.rs:1079-1087 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1791-1799 | crates/biome_module_graph/src/db/type_inference/expressions.rs:2356-2364 | crates/biome_module_graph/src/db/type_inference/expressions.rs:2431-2439 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs:1088\u0060 calls \u0060Union\u0060 and \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs:2365\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/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ecee321d56357012671bcf4e35a672bca048cc4cb703b00b5eb7c665fc225a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 4): crates/biome_service/src/settings.rs:1149-1156 | crates/biome_service/src/settings.rs:1171-1178 | crates/biome_service/src/settings.rs:1197-1205 | crates/biome_service/src/settings.rs:1217-1225 \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/biome_service/src/settings.rs:1149\u0060 it does not close everything it opens, so those exact 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/biome_service/src/settings.rs"},"region":{"startLine":1149}}}],"partialFingerprints":{"codehealthFindingId/v1":"be5fb25812d9edb632c70c18e724e169054400351c09fdf58ce6cf5cf641bbd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 3): crates/biome_css_analyze/src/lint/correctness/no_unknown_media_feature_name.rs:182-188 | crates/biome_css_analyze/src/lint/correctness/no_unknown_media_feature_name.rs:213-219 | crates/biome_css_analyze/src/lint/correctness/no_unknown_media_feature_name.rs:318-326 \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/biome_css_analyze/src/lint/correctness/no_unknown_media_feature_name.rs:182\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_css_analyze/src/lint/correctness/no_unknown_media_feature_name.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"0faa529ba6c34e6802d0c99e617db86303c91f11be7f2d795f5d0356cc9b42e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/biome_css_formatter/src/lib.rs:200-208 | crates/biome_html_formatter/src/lib.rs:234-242 | crates/biome_js_formatter/src/lib.rs:364-372 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060\u0026mut CssFormatter\u0060 in one and \u0060\u0026mut HtmlFormatter\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/biome_css_formatter/src/lib.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e22fc46ab276ae2d4a8ff9c98b0b17d489e3214b8c0a07f9c785021fd394a72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/biome_grit_patterns/src/pattern_compiler/function_definition_compiler.rs:14-22 | crates/biome_grit_patterns/src/pattern_compiler/pattern_definition_compiler.rs:15-23 | crates/biome_grit_patterns/src/pattern_compiler/predicate_definition_compiler.rs:15-23 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_grit_patterns/src/pattern_compiler/function_definition_compiler.rs:14\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060biome_grit_syntax::GritFunctionDefinition\u0060 in one and \u0060GritPatternDefinition\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/biome_grit_patterns/src/pattern_compiler/function_definition_compiler.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15720ba45175f2a11308b2cf5e95a2e3e2e9ea542f8461885fb6d5b11851642"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/biome_js_analyze/src/lint/nursery/use_iterator_zip.rs:401-409 | crates/biome_js_analyze/src/lint/nursery/use_iterator_zip.rs:438-446 | crates/biome_js_analyze/src/lint/nursery/use_set_size.rs:213-221 \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/biome_js_analyze/src/lint/nursery/use_iterator_zip.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"b128e6fffee00ac9211b830d2ee5623f531fe1031a3c33075c54651ef82c9660"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/biome_js_analyze/src/services/vue.rs:158-166 | crates/biome_js_analyze/src/services/vue.rs:205-213 | crates/biome_js_analyze/src/services/vue.rs:232-240 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/services/vue.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8226046f8245d870e7307065d972f4e585cdb24db8e5756e5e787dcc2867e1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/biome_module_graph/src/db/queries/css.rs:199-207 | crates/biome_module_graph/src/db/queries/css.rs:246-254 | crates/biome_module_graph/src/db/queries/css.rs:258-266 \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/biome_module_graph/src/db/queries/css.rs:199\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/biome_module_graph/src/db/queries/css.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"721b7573bb64ad373b432e51285f45673c6ac5b64dfb052867b428cf7b092ca3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/biome_react_compiler/src/convert_ast/expressions.rs:880-888 | crates/biome_react_compiler/src/convert_ast/modules.rs:392-400 | crates/biome_react_compiler/src/convert_ast/statements.rs:329-337 \u2014 before extracting anything, compare \u0060crates/biome_react_compiler/src/convert_ast/modules.rs\u0060 and \u0060crates/biome_react_compiler/src/convert_ast/statements.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_react_compiler/src/convert_ast/expressions.rs:880\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060class\u0060 to \u0060\u0026JsClassExpression\u0060 in one and \u0060\u0026JsClassExportDefaultDeclaration\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/biome_react_compiler/src/convert_ast/modules.rs:401\u0060 calls \u0060abstract_token\u0060 and \u0060crates/biome_react_compiler/src/convert_ast/expressions.rs:889\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/biome_react_compiler/src/convert_ast/expressions.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a02936cb9d0c01fe8a4b04736c668637e9980d146aab797838653737784ae6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): crates/biome_service/src/settings.rs:1144-1152 | crates/biome_service/src/settings.rs:1166-1174 | crates/biome_service/src/settings.rs:1262-1269 \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/biome_service/src/settings.rs:1144\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/settings.rs"},"region":{"startLine":1144}}}],"partialFingerprints":{"codehealthFindingId/v1":"439ac993a1bf76657b75389ac94d6ae8c7d45468305c5a9f7895d0e4bf38eb9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/biome_service/src/settings.rs:1645-1653 | crates/biome_service/src/settings.rs:1659-1667 | crates/biome_service/src/settings.rs:1695-1703 \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/biome_service/src/settings.rs"},"region":{"startLine":1645}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f15b137a6cb6c6b0aa3d47fa880a3432a10620da0c8ec31b202ba719765b3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/biome_service/src/settings.rs:2102-2110 | crates/biome_service/src/settings.rs:2361-2369 | crates/biome_service/src/settings.rs:2385-2393 \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 \u0060\u0026mut JsFormatOptions\u0060 in one and \u0060\u0026mut MdFormatOptions\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_service/src/settings.rs:2099\u0060 calls \u0060Some\u0060, \u0060set_indent_style\u0060 and \u0060crates/biome_service/src/settings.rs:2383\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/biome_service/src/settings.rs"},"region":{"startLine":2102}}}],"partialFingerprints":{"codehealthFindingId/v1":"b185362a34cea628b916cc867c2a2d30a3689ba4bff7ba64b26291188e5d26ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/biome_service/src/settings.rs:2281-2291 | crates/biome_service/src/settings.rs:2365-2373 | crates/biome_service/src/settings.rs:2389-2399 \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/biome_service/src/settings.rs:2281\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060options\u0060 to \u0060\u0026mut GritFormatOptions\u0060 in one and \u0060\u0026mut MdFormatOptions\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/biome_service/src/settings.rs"},"region":{"startLine":2281}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ec13f85cd91e89b322ff5077decebb3773e8f77341f872a3f4e6b98f3d665f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_cli/src/execute/migrate/eslint_eslint.rs:388-396 | crates/biome_package/src/node_js_package/package_json.rs:540-548 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_cli/src/execute/migrate/eslint_eslint.rs:388\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_cli/src/execute/migrate/eslint_eslint.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cb06807b92a6eeb8dce39a5023659b80955092e58a64afdd91820e08aaf8ecc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_cli/src/reporter/json.rs:333-341 | crates/biome_cli/src/reporter/rdjson.rs:117-125 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060location\u0060 to \u0060\u0026Location\u0060 in one and \u0060\u0026Location\u003C\u0027_\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/biome_cli/src/reporter/rdjson.rs:128\u0060 calls \u0060Some\u0060 and \u0060crates/biome_cli/src/reporter/json.rs:344\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/biome_cli/src/reporter/json.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac39eb64d4486157ea8d96550774d50036f06697d074fa0c03625b0dab97af0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_cli/src/runner/mod.rs:324-332 | crates/biome_cli/src/runner/mod.rs:366-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/biome_cli/src/runner/mod.rs:324\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/runner/mod.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"98377e0958421cc2f94af9c918ee5227e765b994caa7c9795022c1bdd9bda71d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/biome_cli/src/service/windows.rs:162-174 | crates/biome_cli/src/service/windows.rs:290-302 \u2014 both copies are in the same file, so extract the block 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/biome_cli/src/service/windows.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"da094e0434e9e45abab1a74b1b2e8f1e4e3384143bcf147a6136e8d3b04eb895"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_configuration/src/overrides.rs:354-362 | crates/biome_configuration/src/overrides.rs:424-432 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_configuration/src/overrides.rs:354\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_configuration/src/overrides.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b7870688e820484be85ea6fc37ada5cd4699b76dd504911f1a7c55f3af5d89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_configuration/src/overrides.rs:364-372 | crates/biome_configuration/src/overrides.rs:434-442 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_configuration/src/overrides.rs:364\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_configuration/src/overrides.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"6602a2823b15dffaa307f7d8b0fe3f4d1d306aee99f80e66648ff0757d36555f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_configuration/src/overrides.rs:374-382 | crates/biome_configuration/src/overrides.rs:444-452 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_configuration/src/overrides.rs:374\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_configuration/src/overrides.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"1209dfe9dafc6fad057b4a202a3a6e9dc05d89d5f2e4fe3813098014b1fe05ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_console/src/markup.rs:215-223 | crates/biome_console/src/markup.rs:237-245 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_console/src/markup.rs:215\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_console/src/markup.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8659b80ce1684ed7037cea9ce4d3ffa31d540d88eb06d3a68cabb1a8652d3a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_css_parser/src/lexer/mod.rs:1001-1009 | crates/biome_css_parser/src/lexer/mod.rs:1044-1052 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_parser/src/lexer/mod.rs:1001\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_parser/src/lexer/mod.rs"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"be48766d4f184e78906818d8038759b20d10600e968496661e2567e76dc27699"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_css_syntax/src/property_syntax/matcher.rs:252-260 | crates/biome_css_syntax/src/property_syntax/matcher.rs:392-401 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_css_syntax/src/property_syntax/matcher.rs:252\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060value\u0060 to \u0060\u0026StaticScssValue\u0060 in one and \u0060\u0026AnyCssGenericComponentValue\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/biome_css_syntax/src/property_syntax/matcher.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"89803d9a943fbe4b0b6817e329671678124c0bdd5723cbdab9e02b903afe1e21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_graphql_analyze/src/assist/source/use_graphql_sorted_variables.rs:228-236 | crates/biome_graphql_analyze/src/utils.rs:209-217 \u2014 before extracting anything, compare \u0060crates/biome_graphql_analyze/src/assist/source/use_graphql_sorted_variables.rs\u0060 and \u0060crates/biome_graphql_analyze/src/utils.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_graphql_analyze/src/assist/source/use_graphql_sorted_variables.rs:228\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/biome_graphql_analyze/src/assist/source/use_graphql_sorted_variables.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea00f972d844eef66080098172879c75c4215de2e42839b6d4c66f056ce4652"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_graphql_analyze/src/lint/nursery/use_consistent_unicode_bom.rs:130-138 | crates/biome_markdown_analyze/src/lint/nursery/use_consistent_unicode_bom.rs:122-130 \u2014 before extracting anything, compare \u0060crates/biome_graphql_analyze/src/lint/nursery/use_consistent_unicode_bom.rs\u0060 and \u0060crates/biome_markdown_analyze/src/lint/nursery/use_consistent_unicode_bom.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_graphql_analyze/src/lint/nursery/use_consistent_unicode_bom.rs:130\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_graphql_analyze/src/lint/nursery/use_consistent_unicode_bom.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"700bdc90b77ff2714011109a2e45d273e1ead7af2c4e3f862fd2f4ea392964d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_graphql_semantic/src/events.rs:221-230 | crates/biome_graphql_semantic/src/events.rs:252-260 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026GraphqlNameBinding\u0060 in one and \u0060\u0026GraphqlNameReference\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/biome_graphql_semantic/src/events.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"052e052d1e0bd8d28b7e5ccc80ee352f861107cbc5058c7be4990817b9c23dd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_grit_patterns/src/grit_resolved_pattern.rs:204-212 | crates/biome_grit_patterns/src/grit_resolved_pattern.rs:220-228 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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/biome_grit_patterns/src/grit_resolved_pattern.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"1664ad61b1f2462927731ee04a2c7a322bc0a7c0beb3b855bb14465c7dc70958"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_grit_patterns/src/pattern_compiler/auto_wrap.rs:81-89 | crates/biome_grit_patterns/src/pattern_compiler/auto_wrap.rs:147-155 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_grit_patterns/src/pattern_compiler/auto_wrap.rs:81\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/biome_grit_patterns/src/pattern_compiler/auto_wrap.rs:90\u0060 calls \u0060File\u0060 and \u0060crates/biome_grit_patterns/src/pattern_compiler/auto_wrap.rs:156\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_patterns/src/pattern_compiler/auto_wrap.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"69f130be39ad485d9c52af792b47803033efbc6917e87121a38724f0262fe734"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_grit_patterns/src/pattern_compiler/function_definition_compiler.rs:24-32 | crates/biome_grit_patterns/src/pattern_compiler/predicate_definition_compiler.rs:25-33 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_grit_patterns/src/pattern_compiler/function_definition_compiler.rs:24\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060biome_grit_syntax::GritFunctionDefinition\u0060 in one and \u0060GritPredicateDefinition\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/biome_grit_patterns/src/pattern_compiler/function_definition_compiler.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"c109d4cd172ba507ae36d2b305d257fd3deaf98b0d2e150d1c2653356a45d09a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_html_analyze/src/lint/a11y/no_ambiguous_anchor_text.rs:132-140 | crates/biome_js_analyze/src/lint/a11y/no_ambiguous_anchor_text.rs:143-151 \u2014 before extracting anything, compare \u0060crates/biome_html_analyze/src/lint/a11y/no_ambiguous_anchor_text.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/a11y/no_ambiguous_anchor_text.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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/biome_html_analyze/src/lint/a11y/no_ambiguous_anchor_text.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c969bc0196fcaa47cff776d4ea9050113e8f036137099b96d0dd6d64159f9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_html_analyze/src/lint/nursery/no_non_scalable_viewport.rs:63-71 | crates/biome_js_analyze/src/lint/nursery/no_non_scalable_viewport.rs:66-74 \u2014 before extracting anything, compare \u0060crates/biome_html_analyze/src/lint/nursery/no_non_scalable_viewport.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/nursery/no_non_scalable_viewport.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_analyze/src/lint/nursery/no_non_scalable_viewport.rs:63\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/biome_html_analyze/src/lint/nursery/no_non_scalable_viewport.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1645eb7c064f7e6dc06d90bcb0f5448413b56f7bf3714cb3fb027633fe2c917"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_html_analyze/src/lint/nursery/no_non_scalable_viewport.rs:93-101 | crates/biome_js_analyze/src/lint/nursery/no_non_scalable_viewport.rs:96-104 \u2014 before extracting anything, compare \u0060crates/biome_html_analyze/src/lint/nursery/no_non_scalable_viewport.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/nursery/no_non_scalable_viewport.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/nursery/no_non_scalable_viewport.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"9898a6917a60646fd50378d2d80dea3ca5a52e6ef40c72da7de613e97e3e2d28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_html_parser/src/lexer/mod.rs:124-132 | crates/biome_html_parser/src/lexer/mod.rs:240-248 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_html_parser/src/lexer/mod.rs:124\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_html_parser/src/lexer/mod.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"5161e155e241ae83db18f58f1da8351969506a33e3dd729023659c2d00a99f87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_html_parser/src/syntax/svelte.rs:101-109 | crates/biome_html_parser/src/syntax/svelte.rs:134-142 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_parser/src/syntax/svelte.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f3786a8ec442a2676a58253b5d8aa1e817a408110a0bd95b4718a9827c5bc1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_js_analyze/src/ast_utils.rs:143-151 | crates/biome_js_analyze/src/lint/nursery/no_accidental_bitwise_operators.rs:301-309 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/ast_utils.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df18bfe7a16a9ce359de0b3fd0b72539dabc47d23f1014d9614ae048b9f0277"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_js_analyze/src/lint/correctness/no_before_interactive_script_outside_document.rs:85-93 | crates/biome_js_analyze/src/lint/correctness/use_inline_script_id.rs:87-95 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/no_before_interactive_script_outside_document.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"47567f873f6ad30d386255d85fb7f5506887da610d3d1da49302ec8c0268c9c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/no_array_for_each.rs:260-268 | crates/biome_js_analyze/src/utils/indexed_collection.rs:69-77 \u2014 before extracting anything, compare \u0060crates/biome_js_analyze/src/lint/nursery/no_array_for_each.rs\u0060 and \u0060crates/biome_js_analyze/src/utils/indexed_collection.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_array_for_each.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"54dacbf537f4801eba2e6cbe2baf0e829dd76e9f256f8a0258bbdcd82e7bb2d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/no_double_comparison.rs:447-455 | crates/biome_js_analyze/src/lint/nursery/use_valid_character_comparison.rs:252-260 \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/biome_js_analyze/src/lint/nursery/no_double_comparison.rs:447\u0060 it begins part-way through the construct above it, so those exact 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/biome_js_analyze/src/lint/nursery/no_double_comparison.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"6808f1636a1b39c0b85ea8ac434b802a5fe003cf20ec050c58522395d9bb941b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/no_map_spread.rs:187-195 | crates/biome_js_analyze/src/lint/nursery/no_uninvoked_array_callback.rs:116-124 \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/biome_js_analyze/src/lint/nursery/no_map_spread.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f6321b47add20a4ce30a4af7ec860b4d67ce5a08e99986a685685482b8e873"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/no_misleading_return_type/analysis.rs:523-531 | crates/biome_js_analyze/src/lint/nursery/no_misleading_return_type/analysis.rs:545-553 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_misleading_return_type/analysis.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f3fa7956b6237de436644248d0b4eee4faa769e09316866ed4754fad9e4b207"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/no_single_promise_in_promise_methods.rs:283-291 | crates/biome_js_analyze/src/lint/nursery/no_single_promise_in_promise_methods.rs:315-325 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_js_analyze/src/lint/nursery/no_single_promise_in_promise_methods.rs:283\u0060 it begins part-way through the construct above it, so those exact 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/biome_js_analyze/src/lint/nursery/no_single_promise_in_promise_methods.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"18b7c140e13c9f4802fd8c902cf312264e4b9528b9dd33402e819c53b62b00f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/use_explicit_return_type.rs:670-678 | crates/biome_js_analyze/src/lint/nursery/use_explicit_type.rs:840-848 \u2014 before extracting anything, compare \u0060crates/biome_js_analyze/src/lint/nursery/use_explicit_return_type.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/nursery/use_explicit_type.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 80 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/nursery/use_explicit_return_type.rs:670\u0060 it does not close everything it opens, so those exact 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/biome_js_analyze/src/lint/nursery/use_explicit_return_type.rs:679\u0060 calls \u0060is_default_function_parameter_with_type_annotation\u0060, \u0060is_class_property_with_type_annotation\u0060 and \u0060crates/biome_js_analyze/src/lint/nursery/use_explicit_type.rs:849\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/biome_js_analyze/src/lint/nursery/use_explicit_return_type.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf6aa05abfc4721af328d28c47ce365fde565ee6d1971757772851caa89b486c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/use_explicit_type.rs:466-474 | crates/biome_js_analyze/src/lint/nursery/use_explicit_type.rs:477-485 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_js_analyze/src/lint/nursery/use_explicit_type.rs:466\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/biome_js_analyze/src/lint/nursery/use_explicit_type.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc62e49e02b1f3741418aa832f60e80b56cddc0036783927d6ad554eaf0ed48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_js_analyze/src/lint/style/use_consistent_object_definitions.rs:269-277 | crates/biome_js_analyze/src/lint/style/use_consistent_object_definitions.rs:311-319 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_js_analyze/src/lint/style/use_consistent_object_definitions.rs:269\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/biome_js_analyze/src/lint/style/use_consistent_object_definitions.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e291bbd5bb0363a28b782938d393e40f7a807d1dbbadbf616d8216688f49d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_js_analyze/src/lint/style/use_export_type.rs:622-630 | crates/biome_js_analyze/src/lint/style/use_import_type.rs:1056-1064 \u2014 before extracting anything, compare \u0060crates/biome_js_analyze/src/lint/style/use_export_type.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/style/use_import_type.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/style/use_export_type.rs:622\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/style/use_export_type.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"b464b6f5143bbcaa7c737f8c19f53d47f22d4d48cf453434faac1cbba9a9e4d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_js_analyze/src/lint/style/use_numeric_separators.rs:288-296 | crates/biome_js_analyze/src/lint/style/use_numeric_separators.rs:419-427 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_js_analyze/src/lint/style/use_numeric_separators.rs:288\u0060 it does not close everything it opens, so those exact 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/biome_js_analyze/src/lint/style/use_numeric_separators.rs:428\u0060 calls \u0060push\u0060, \u0060next\u0060, \u0060unwrap\u0060 and \u0060crates/biome_js_analyze/src/lint/style/use_numeric_separators.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/biome_js_analyze/src/lint/style/use_numeric_separators.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"10facda10223b91b6be22eb5d3dbf288ad2cb007a2ef4f18125414bb4206fd98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_js_analyze/src/lint/style/use_react_function_components.rs:99-110 | crates/biome_js_analyze/src/lint/style/use_react_function_components.rs:112-120 \u2014 both copies are in the same file, so extract the block 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/biome_js_analyze/src/lint/style/use_react_function_components.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"980e9c30b58d113260f379a3deaa9b482705289955be405dd1b172c17e269fa6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_js_control_flow/src/nodes/break_stmt.rs:25-35 | crates/biome_js_control_flow/src/nodes/continue_stmt.rs:22-32 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_control_flow/src/nodes/break_stmt.rs:25\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_control_flow/src/nodes/break_stmt.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d2b8feb35c315ba47c9dc3bedcb6154e6189c7203fee48ff6ceb57508a43d02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): crates/biome_js_type_info/src/format_inferred_type_info.rs:1139-1145 | crates/biome_js_type_info/src/format_type_info.rs:1037-1045 \u2014 before extracting anything, compare \u0060crates/biome_js_type_info/src/format_inferred_type_info.rs\u0060 and \u0060crates/biome_js_type_info/src/format_type_info.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 242 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_type_info/src/format_inferred_type_info.rs:1139\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060\u0026mut Formatter\u003CFormatInferredTypeContext\u003C\u0027db\u003E\u003E\u0060 in one and \u0060\u0026mut Formatter\u003CFormatTypeContext\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/format_inferred_type_info.rs"},"region":{"startLine":1139}}}],"partialFingerprints":{"codehealthFindingId/v1":"a30f13e4e671e0c50a86b3ac2b40b8cd5ce04a66dba82af75e07aac6ba5ec367"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_languages/src/javascript.rs:811-820 | crates/biome_languages/src/lib.rs:327-336 \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/biome_languages/src/lib.rs:327\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_languages/src/lib.rs:324\u0060 calls \u0060Some\u0060, \u0060Ok\u0060 and \u0060crates/biome_languages/src/javascript.rs:810\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/biome_languages/src/javascript.rs"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0de24cb80d80c6bbb743a18905572e8fec865dc4eb21e8de5e1dcadd5238e9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_lsp/src/handlers/formatting.rs:194-202 | crates/biome_lsp/src/handlers/formatting.rs:283-291 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_lsp/src/handlers/formatting.rs:194\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_lsp/src/handlers/formatting.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"221a1530d1ec2b2b114e737be757fdbcb541835ac09a4e7879ea2d160abd31b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_markdown_parser/src/syntax/list.rs:3165-3173 | crates/biome_markdown_parser/src/syntax/mod.rs:658-666 \u2014 before extracting anything, compare \u0060crates/biome_markdown_parser/src/syntax/list.rs\u0060 and \u0060crates/biome_markdown_parser/src/syntax/mod.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 59 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/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":3165}}}],"partialFingerprints":{"codehealthFindingId/v1":"bae35bb4b2eebdd0cf46cd160dcbac1405a425a11e691b48985d66d322d0568b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_markdown_parser/src/to_html.rs:1891-1899 | crates/biome_markdown_syntax/src/text_ext.rs:46-54 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_markdown_parser/src/to_html.rs:1891\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_markdown_parser/src/to_html.rs"},"region":{"startLine":1891}}}],"partialFingerprints":{"codehealthFindingId/v1":"08257a25f36b5ef56bc6004c1a790b1876b5950836060e4ba76af74fdac1386f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_migrate/src/analyzers/includes.rs:159-167 | crates/biome_migrate/src/analyzers/includes.rs:184-192 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_migrate/src/analyzers/includes.rs:159\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/biome_migrate/src/analyzers/includes.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"5283c64620ed3b63e55ea1056912fe979d345cced8ddd0762e3c177d7bea8ad5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/biome_migrate/src/analyzers/organize_imports.rs:89-96 | crates/biome_migrate/src/analyzers/organize_imports.rs:99-107 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_migrate/src/analyzers/organize_imports.rs:89\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_migrate/src/analyzers/organize_imports.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d46bce9a2c758fa2bad157b61d51d4022a7f1220739e38277b8d05e570aed06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_migrate/src/analyzers/rule_mover.rs:528-537 | crates/biome_migrate/src/analyzers/rule_mover.rs:544-552 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_migrate/src/analyzers/rule_mover.rs:528\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_migrate/src/analyzers/rule_mover.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"d138e3d9d042e9f5acc0716ee0b728e9b76e2ea83504b15df58f30f7c7e9671b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_module_graph/src/db/type_inference/expressions.rs:1797-1805 | crates/biome_module_graph/src/db/type_inference/expressions.rs:3103-3111 \u2014 both copies are in the same file, so extract the block into one function there 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/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":1797}}}],"partialFingerprints":{"codehealthFindingId/v1":"242688978f4ff697d5e29be45593914942bb7596c6068a662a14057c5d4387f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_module_graph/src/db/type_inference/expressions.rs:2060-2069 | crates/biome_module_graph/src/db/type_inference/expressions.rs:2085-2093 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_module_graph/src/db/type_inference/expressions.rs:2060\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":2060}}}],"partialFingerprints":{"codehealthFindingId/v1":"a136e4612a50273c926b57623c1bef9aabade326b278f434148d76ef51d999a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): crates/biome_module_graph/src/db/type_inference/promise_classification.rs:223-231 | crates/biome_module_graph/src/db/type_inference/promise_classification.rs:234-242 | crates/biome_module_graph/src/db/type_inference/promise_classification.rs:244-251 \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/biome_module_graph/src/db/type_inference/promise_classification.rs:244\u0060 it does not close everything it opens, so those exact 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/biome_module_graph/src/db/type_inference/promise_classification.rs:234\u0060 calls \u0060global_types\u0060, \u0060get\u0060 and \u0060crates/biome_module_graph/src/db/type_inference/promise_classification.rs:244\u0060 does not \u2014 after which the two agree again for 5 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/type_inference/promise_classification.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"6890b810218bac13934f705f83b4a422481c63eb2a6e4f897dbd3c18e0a7192e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_module_graph/src/type_inference/profiling/display/compact.rs:749-757 | crates/biome_module_graph/src/type_inference/profiling/display/compact.rs:771-779 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_module_graph/src/type_inference/profiling/display/compact.rs:749\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/biome_module_graph/src/type_inference/profiling/display/compact.rs"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac6f4da91727879c9ec8a62c8d056beccc723b0263a2eccf826a330c0b4391cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_parser/src/diagnostic.rs:175-183 | crates/biome_parser/src/diagnostic.rs:212-225 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_parser/src/diagnostic.rs:175\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_parser/src/diagnostic.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd9a6880c710b3e42911b9a08168943ec4a65efa3bf372602d7204f29dfd1fb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_project_layout/src/project_layout.rs:327-335 | crates/biome_project_layout/src/project_layout.rs:375-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/biome_project_layout/src/project_layout.rs:327\u0060 it does not close everything it opens, so those exact 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/biome_project_layout/src/project_layout.rs:336\u0060 calls \u0060default\u0060 and \u0060crates/biome_project_layout/src/project_layout.rs:384\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_project_layout/src/project_layout.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"843569186c2e102093c27ccc1fc1887e5e703d62e86ff78d9c7f2f73a94735c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): crates/biome_rowan/src/cursor.rs:325-333 | crates/biome_rowan/src/cursor.rs:369-375 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/biome_rowan/src/cursor.rs:375\u0060 calls \u0060into\u0060, \u0060Some\u0060 and \u0060crates/biome_rowan/src/cursor.rs:333\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/biome_rowan/src/cursor.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"dffa8a7903f41ea8935a8b4341b57729fea2c73dc7180f641865fe9268a37e8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_service/src/db/mod.rs:443-451 | crates/biome_service/src/db/mod.rs:1130-1138 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/db/mod.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"9746c4c34a9dd98169df00e3f529cb7027c5dd8bf598a1d31613fcdbb1abaf48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_service/src/file_handlers/javascript/go_to.rs:53-61 | crates/biome_service/src/file_handlers/javascript/go_to.rs:72-80 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_service/src/file_handlers/javascript/go_to.rs:53\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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/biome_service/src/file_handlers/javascript/go_to.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c1933ddbcd7a287be8db985b5ab908120b1cb2903cee138d721ba0610b64a18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/biome_service/src/projects.rs:168-176 | crates/biome_service/src/projects.rs:316-323 \u2014 both copies are in the same file, so extract the block into one function there 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/biome_service/src/projects.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b773db782f419bcaa35a00872865119c4258fc396fa616f5af9704d45f2433c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/biome_service/src/settings.rs:2106-2113 | crates/biome_service/src/settings.rs:2211-2219 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_service/src/settings.rs:2106\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060options\u0060 to \u0060\u0026mut JsFormatOptions\u0060 in one and \u0060\u0026mut CssFormatOptions\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/biome_service/src/settings.rs"},"region":{"startLine":2106}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e50984ac25d0584ffe74e131894dd7001283e03f02346b6ce702af31ff9b16c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_service/src/settings.rs:2588-2596 | crates/biome_service/src/settings.rs:2673-2681 \u2014 both copies are in the same file, so extract the block into one function there 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/biome_service/src/settings.rs"},"region":{"startLine":2588}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fdbcf57aaf6dfc71346ae779719850fd2c20d4c2876e30b6b996820a00e680e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): xtask/codegen/src/generate_configuration.rs:535-543 | xtask/codegen/src/generate_configuration.rs:566-574 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060xtask/codegen/src/generate_configuration.rs:535\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/generate_configuration.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"94e1744f702f852d1d9865b54973ee24b99e94e91f009228c946773b625463eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 17): crates/biome_module_graph/src/db/type_inference/expressions.rs:888-895 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1085-1092 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1168-1175 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1219-1226 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1513-1520 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1562-1569 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1725-1732 | crates/biome_module_graph/src/db/type_inference/expressions.rs:2437-2444 | crates/biome_module_graph/src/db/type_inference/expressions.rs:2501-2508 | crates/biome_module_graph/src/db/type_inference/expressions.rs:2802-2809 | crates/biome_module_graph/src/db/type_inference/expressions.rs:2927-2934 | crates/biome_module_graph/src/db/type_inference/expressions.rs:3153-3160 | crates/biome_module_graph/src/db/type_inference/expressions.rs:3204-3211 | crates/biome_module_graph/src/db/type_inference/lookup.rs:763-770 | crates/biome_module_graph/src/db/type_inference/lookup.rs:831-838 | crates/biome_module_graph/src/db/type_inference/lookup.rs:939-946 | crates/biome_module_graph/src/db/type_inference/resolver.rs:1070-1077 \u2014 before extracting anything, compare \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs\u0060 and \u0060crates/biome_module_graph/src/db/type_inference/lookup.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 234 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/biome_module_graph/src/db/type_inference/expressions.rs:897\u0060 calls \u0060InstanceOf\u0060 and \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs:1177\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/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22bc80a7780df7b428d047b3df634d7cc10ae245d71bc2317952c6ee033b4f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 15): crates/biome_module_graph/src/db/type_inference/expressions.rs:887-894 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1167-1174 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1218-1225 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1512-1519 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1561-1568 | crates/biome_module_graph/src/db/type_inference/expressions.rs:1724-1731 | crates/biome_module_graph/src/db/type_inference/expressions.rs:2500-2507 | crates/biome_module_graph/src/db/type_inference/expressions.rs:2618-2625 | crates/biome_module_graph/src/db/type_inference/expressions.rs:2865-2872 | crates/biome_module_graph/src/db/type_inference/expressions.rs:3152-3159 | crates/biome_module_graph/src/db/type_inference/expressions.rs:3203-3210 | crates/biome_module_graph/src/db/type_inference/lookup.rs:762-769 | crates/biome_module_graph/src/db/type_inference/lookup.rs:830-837 | crates/biome_module_graph/src/db/type_inference/lookup.rs:938-945 | crates/biome_module_graph/src/db/type_inference/resolver.rs:1069-1076 \u2014 before extracting anything, compare \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs\u0060 and \u0060crates/biome_module_graph/src/db/type_inference/lookup.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 234 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/biome_module_graph/src/db/type_inference/expressions.rs:897\u0060 calls \u0060InstanceOf\u0060 and \u0060crates/biome_module_graph/src/db/type_inference/expressions.rs:1177\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/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb2565f5c1243261c133c640f6d794bf4f2b112727294230de42fe02f66ac18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 9): crates/biome_configuration/src/overrides.rs:197-204 | crates/biome_configuration/src/overrides.rs:218-225 | crates/biome_configuration/src/overrides.rs:236-243 | crates/biome_configuration/src/overrides.rs:252-259 | crates/biome_configuration/src/overrides.rs:267-274 | crates/biome_configuration/src/overrides.rs:282-289 | crates/biome_configuration/src/overrides.rs:301-308 | crates/biome_configuration/src/overrides.rs:317-324 | crates/biome_configuration/src/overrides.rs:333-340 \u2014 all 9 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_configuration/src/overrides.rs:197\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_configuration/src/overrides.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6f359ad939b82f068c56732802a843ec3f1c8d361f7d762acf3a4b4affbc5d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 8): crates/biome_service/src/settings.rs:2105-2110 | crates/biome_service/src/settings.rs:2169-2174 | crates/biome_service/src/settings.rs:2210-2215 | crates/biome_service/src/settings.rs:2247-2253 | crates/biome_service/src/settings.rs:2280-2286 | crates/biome_service/src/settings.rs:2306-2313 | crates/biome_service/src/settings.rs:2364-2369 | crates/biome_service/src/settings.rs:2388-2394 \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060options\u0060 to \u0060\u0026mut JsFormatOptions\u0060 in one and \u0060\u0026mut JsonFormatOptions\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/biome_service/src/settings.rs"},"region":{"startLine":2105}}}],"partialFingerprints":{"codehealthFindingId/v1":"2090913dffea80c814e3e68dda5d88b80dc2f83f3b9e78f13176230621dbeaa7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20138 lines \u00D7 7): crates/biome_service/src/settings.rs:2098-2102 | crates/biome_service/src/settings.rs:2161-2167 | crates/biome_service/src/settings.rs:2202-2208 | crates/biome_service/src/settings.rs:2239-2245 | crates/biome_service/src/settings.rs:2272-2278 | crates/biome_service/src/settings.rs:2297-2304 | crates/biome_service/src/settings.rs:2356-2361 \u2014 all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_service/src/settings.rs:2098\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060options\u0060 to \u0060\u0026mut JsFormatOptions\u0060 in one and \u0060\u0026mut JsonFormatOptions\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/biome_service/src/settings.rs"},"region":{"startLine":2098}}}],"partialFingerprints":{"codehealthFindingId/v1":"f28c46bfbaf08eacb39da882b7ef0eeaf8dbbc8638a2b4b165d2513c017d9ee3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/biome_configuration/src/lib.rs:778-785 | crates/biome_manifest/src/lib.rs:101-109 | crates/biome_manifest/src/lib.rs:163-171 | xtask/codegen/src/promote_rules.rs:568-576 \u2014 there are 4 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_configuration/src/lib.rs:778\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_configuration/src/lib.rs"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e59d73f354cc834f20a70015331a83309449ed569b4c76dd863cdfe334305b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/biome_configuration/src/overrides.rs:351-358 | crates/biome_configuration/src/overrides.rs:361-368 | crates/biome_configuration/src/overrides.rs:371-378 | crates/biome_configuration/src/overrides.rs:398-405 \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. 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/biome_configuration/src/overrides.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc8a87887f521a1d2be81e7f7c03c3ce97549b57047fe415f5441e9249148027"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/biome_css_analyze/src/lint/nursery/use_consistent_unicode_bom.rs:91-98 | crates/biome_graphql_analyze/src/lint/nursery/use_consistent_unicode_bom.rs:87-94 | crates/biome_js_analyze/src/lint/nursery/use_consistent_unicode_bom.rs:100-107 | crates/biome_json_analyze/src/lint/nursery/use_consistent_unicode_bom.rs:87-94 \u2014 before extracting anything, compare \u0060crates/biome_css_analyze/src/lint/nursery/use_consistent_unicode_bom.rs\u0060 and \u0060crates/biome_graphql_analyze/src/lint/nursery/use_consistent_unicode_bom.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 50 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_analyze/src/lint/nursery/use_consistent_unicode_bom.rs:91\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_analyze/src/lint/nursery/use_consistent_unicode_bom.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e35e52bca85b84f448ebe4eba3028e067598c1860722c286c9307935334cce1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/biome_js_semantic/src/semantic_model/builder.rs:297-305 | crates/biome_js_semantic/src/semantic_model/builder.rs:319-327 | crates/biome_js_semantic/src/semantic_model/builder.rs:339-347 | crates/biome_js_semantic/src/semantic_model/builder.rs:357-365 \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/biome_js_semantic/src/semantic_model/builder.rs:297\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/biome_js_semantic/src/semantic_model/builder.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67e16e1b464749ec4a52fe26e3e515aec00f13623e3d549f7403e4a41978b20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 4): crates/biome_markdown_formatter/src/gfm/auxiliary/table_delimiter_row.rs:73-80 | crates/biome_markdown_formatter/src/gfm/auxiliary/table_delimiter_row.rs:99-104 | crates/biome_markdown_formatter/src/gfm/auxiliary/table_row.rs:70-77 | crates/biome_markdown_formatter/src/gfm/auxiliary/table_row.rs:140-145 \u2014 before extracting anything, compare \u0060crates/biome_markdown_formatter/src/gfm/auxiliary/table_delimiter_row.rs\u0060 and \u0060crates/biome_markdown_formatter/src/gfm/auxiliary/table_row.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_markdown_formatter/src/gfm/auxiliary/table_delimiter_row.rs:73\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_markdown_formatter/src/gfm/auxiliary/table_delimiter_row.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"3efd5b05a1aee25f33fe78a9194816f5b8e22a54a306943fec9eb26e89c3bc5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/biome_markdown_formatter/src/markdown/lists/block_list.rs:441-448 | crates/biome_markdown_formatter/src/markdown/lists/block_list.rs:463-470 | crates/biome_markdown_formatter/src/markdown/lists/block_list.rs:506-513 | crates/biome_markdown_formatter/src/markdown/lists/block_list.rs:578-585 \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/biome_markdown_formatter/src/markdown/lists/block_list.rs:441\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_markdown_formatter/src/markdown/lists/block_list.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"604d7b875492c52656ae04f1103634f971cc8492acf1250a795a6cbc9ff35882"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/biome_service/src/file_handlers/css.rs:585-592 | crates/biome_service/src/file_handlers/graphql.rs:472-479 | crates/biome_service/src/file_handlers/grit.rs:410-417 | crates/biome_service/src/file_handlers/json.rs:545-552 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/css.rs\u0060 and \u0060crates/biome_service/src/file_handlers/graphql.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 202 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_service/src/file_handlers/css.rs:585\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/biome_service/src/file_handlers/css.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a63758f88884e493ed87a9203480fa6d95f7ef91ac6465096a21f90a69d562b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/biome_configuration/src/overrides.rs:421-428 | crates/biome_configuration/src/overrides.rs:431-438 | crates/biome_configuration/src/overrides.rs:441-448 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_configuration/src/overrides.rs:418\u0060 calls \u0060Some\u0060, \u0060as_ref\u0060 and \u0060crates/biome_configuration/src/overrides.rs:428\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/biome_configuration/src/overrides.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c1e4fd4749f7b545f5ef5130ac7bed24dd14af383f6aa68823bb905fd163eac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/biome_css_analyze/src/lint/nursery/use_logical_properties.rs:1314-1321 | crates/biome_css_analyze/src/lint/nursery/use_logical_properties.rs:1332-1339 | crates/biome_css_analyze/src/lint/nursery/use_logical_properties.rs:1372-1379 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_analyze/src/lint/nursery/use_logical_properties.rs:1314\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/biome_css_analyze/src/lint/nursery/use_logical_properties.rs"},"region":{"startLine":1314}}}],"partialFingerprints":{"codehealthFindingId/v1":"696c5d7e811ae837fbdae5b2908b31df83526ed3bf3653ef65e0e1b1f74fbb92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/biome_html_parser/src/syntax/vue.rs:97-104 | crates/biome_html_parser/src/syntax/vue.rs:126-133 | crates/biome_html_parser/src/syntax/vue.rs:155-162 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/biome_html_parser/src/syntax/vue.rs:165\u0060 calls \u0060at_ts\u0060 and \u0060crates/biome_html_parser/src/syntax/vue.rs:105\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/biome_html_parser/src/syntax/vue.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6f1cd1b98ec667fba5d75626350f3972ad191075bd48528e5549b647d0a71a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/biome_js_analyze/src/lint/nursery/no_array_sort_for_min_max.rs:290-297 | crates/biome_js_analyze/src/lint/nursery/no_svelte_unnecessary_state_wrap.rs:162-170 | crates/biome_js_analyze/src/lint/nursery/no_svelte_useless_derived_by.rs:114-121 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/nursery/no_array_sort_for_min_max.rs:290\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_array_sort_for_min_max.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb0e2b99d9de557885a347c2f78ce3db9bba7bf78868322ccff5dee3f9bd0357"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/biome_js_analyze/src/lint/nursery/no_floating_promises.rs:313-320 | crates/biome_js_analyze/src/lint/nursery/no_floating_promises.rs:327-334 | crates/biome_js_analyze/src/lint/nursery/no_misused_promises.rs:217-224 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/nursery/no_floating_promises.rs:313\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/biome_js_analyze/src/lint/nursery/no_floating_promises.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e94bcf2cef33218a20e9f0a47003fc90649dec8b84facd3a3e3a8c331442ed4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/biome_js_formatter/src/js/assignments/array_assignment_pattern.rs:18-25 | crates/biome_js_formatter/src/js/bindings/array_binding_pattern.rs:18-25 | crates/biome_js_formatter/src/ts/types/tuple_type.rs:19-26 \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/biome_js_formatter/src/js/assignments/array_assignment_pattern.rs:18\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026JsArrayAssignmentPattern\u0060 in one and \u0060\u0026JsArrayBindingPattern\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_js_formatter/src/ts/types/tuple_type.rs:17\u0060 calls \u0060options\u0060, \u0060delimiter_spacing\u0060, \u0060value\u0060 and \u0060crates/biome_js_formatter/src/js/assignments/array_assignment_pattern.rs:16\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/js/assignments/array_assignment_pattern.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb71065e7f42097cf6c49330bb8e819e22eb6c7c5b75793aea729139e99b95f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/biome_js_type_info/src/local_inference.rs:95-102 | crates/biome_js_type_info/src/local_inference.rs:118-125 | crates/biome_js_type_info/src/local_inference.rs:214-221 \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/biome_js_type_info/src/local_inference.rs:95\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_js_type_info/src/local_inference.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d421cc99ed0eb354d9bf8c2a8b70c29809f20dde1b896049249d9dd72e15fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/biome_ruledoc_utils/src/lib.rs:153-160 | crates/biome_test_utils/src/lib.rs:336-343 | crates/biome_test_utils/src/lib.rs:383-390 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_ruledoc_utils/src/lib.rs:153\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_ruledoc_utils/src/lib.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"92e8f2186bdf96e65ee5b7db52a23e6514b180e15352a32569277787318ae81e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/biome_service/src/file_handlers/html.rs:774-781 | crates/biome_service/src/file_handlers/javascript.rs:1074-1081 | crates/biome_service/src/file_handlers/md.rs:519-526 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/html.rs\u0060 and \u0060crates/biome_service/src/file_handlers/javascript.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 202 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/biome_service/src/file_handlers/html.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"3698cacd7b0b7c7b257ae05a87a022b9a81741ebf6460b482c57c268b8f367a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/biome_yaml_parser/src/parser/flow.rs:150-157 | crates/biome_yaml_parser/src/parser/flow.rs:166-173 | crates/biome_yaml_parser/src/parser/flow.rs:178-185 \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/biome_yaml_parser/src/parser/flow.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf0e06c2c8a3d168653fe06224ae5d9c117d664810fcd5a8c1f8e342f1ed378b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_configuration/src/overrides.rs:392-399 | crates/biome_configuration/src/overrides.rs:462-469 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_configuration/src/overrides.rs:392\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_configuration/src/overrides.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e980429bc38bdc4dcf2d23ca84658c6a1f2e9c8ad576a5cc68a5e53a5ca5dbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_css_analyze/src/lint/nursery/use_logical_properties.rs:1104-1111 | crates/biome_css_analyze/src/lint/nursery/use_logical_properties.rs:1119-1126 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_css_analyze/src/lint/nursery/use_logical_properties.rs:1104\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_css_analyze/src/lint/nursery/use_logical_properties.rs"},"region":{"startLine":1104}}}],"partialFingerprints":{"codehealthFindingId/v1":"c10ad1a716b0be25ccc9e715e8a82919f0afe27581aa1e59c23978f2d90f12b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_deserialize_macros/src/deserializable_derive.rs:309-316 | crates/biome_deserialize_macros/src/deserializable_derive.rs:488-495 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_deserialize_macros/src/deserializable_derive.rs:309\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_deserialize_macros/src/deserializable_derive.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a219447987b8f731210a42ff950deb91ad857840f96d4d474b82bfee915589"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/biome_graphql_analyze/src/assist/source/use_graphql_sorted_variables.rs:106-113 | crates/biome_json_analyze/src/assist/source/use_sorted_package_json.rs:316-322 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_graphql_analyze/src/assist/source/use_graphql_sorted_variables.rs:106\u0060 it does not close everything it opens, so those exact 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/biome_graphql_analyze/src/assist/source/use_graphql_sorted_variables.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"a998effc6349be47e58cc9203d0687f9b9702d8a9ccbb60e49c9560902f34c59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/biome_html_analyze/src/lint/a11y/no_aria_unsupported_elements.rs:150-165 | crates/biome_js_analyze/src/lint/a11y/no_aria_unsupported_elements.rs:117-132 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/a11y/no_aria_unsupported_elements.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1312885127219652d004f6c842b309d301a1c65d35aef6ea4c6a2f3ccdc37ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_html_analyze/src/lint/nursery/no_invalid_file_input_accept.rs:107-114 | crates/biome_js_analyze/src/lint/nursery/no_invalid_file_input_accept.rs:106-113 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_analyze/src/lint/nursery/no_invalid_file_input_accept.rs:107\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/nursery/no_invalid_file_input_accept.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"67be40ef58db89451dcd973bde90c91ff1a2f32fc169b2754a0ef6f11367754f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/biome_html_analyze/src/lint/nursery/no_undeclared_custom_properties.rs:139-146 | crates/biome_js_analyze/src/lint/nursery/no_undeclared_custom_properties.rs:119-125 \u2014 before extracting anything, compare \u0060crates/biome_html_analyze/src/lint/nursery/no_undeclared_custom_properties.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/nursery/no_undeclared_custom_properties.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_analyze/src/lint/nursery/no_undeclared_custom_properties.rs:139\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_html_analyze/src/lint/nursery/no_undeclared_custom_properties.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"33ea3756e45ba34ebde920d509756472f8f2eba11c4788a2e0bf57fb280b04e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_html_parser/src/syntax/vue.rs:401-408 | crates/biome_html_parser/src/syntax/vue.rs:413-420 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_parser/src/syntax/vue.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab24d423cf120d9db618d25953483c4fd1dbf69a63d8d5899c41bbc961b89334"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_html_syntax/src/static_value.rs:53-60 | crates/biome_js_syntax/src/static_value.rs:55-62 \u2014 before extracting anything, compare \u0060crates/biome_html_syntax/src/static_value.rs\u0060 and \u0060crates/biome_js_syntax/src/static_value.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_syntax/src/static_value.rs:53\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_syntax/src/static_value.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d3b1a9f4cbcf8bc0c6970bf5da8efc195d6458ca034c89796561cd8ba9b82f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_js_analyze/src/lint/correctness/no_process_global.rs:138-145 | crates/biome_js_analyze/src/lint/style/use_single_var_declarator.rs:205-212 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/correctness/no_process_global.rs:138\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/no_process_global.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b74de5b969193f7011d63d3f44686f97709797295e68904e6a874626382ba8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/biome_js_analyze/src/lint/correctness/use_react_async_server_function.rs:198-204 | crates/biome_js_analyze/src/lint/correctness/use_react_async_server_function.rs:211-218 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/correctness/use_react_async_server_function.rs:198\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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/biome_js_analyze/src/lint/correctness/use_react_async_server_function.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a5f53aeb25790d3dc70a92b03517d46a377bd3500671f33eb04f40d6643fceb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/biome_js_analyze/src/lint/correctness/use_single_js_doc_asterisk.rs:164-171 | crates/biome_js_analyze/src/lint/suspicious/no_ts_ignore.rs:129-135 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/correctness/use_single_js_doc_asterisk.rs:164\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/correctness/use_single_js_doc_asterisk.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c9a01b03defe74a5b44a1dbe21f670d1b3c1cb05eea15fb911fd7a0a7d97ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/no_eager_array_methods_in_loops.rs:387-394 | crates/biome_js_analyze/src/lint/nursery/no_unreadable_for_of_expression.rs:351-358 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_eager_array_methods_in_loops.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d34c429d0b548a21b1ec6bc86522bc2237838166bdf92e9a8fe693fb66f9db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/use_consistent_boolean_name.rs:772-779 | crates/biome_js_analyze/src/shared/late_event_handler.rs:264-271 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_consistent_boolean_name.rs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"8caaf9c66bfcf2a2030b31137d5f86ab1330846edc423d5aeac97737267991bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/use_modern_math_apis.rs:291-298 | crates/biome_js_analyze/src/lint/nursery/use_modern_math_apis.rs:417-424 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/nursery/use_modern_math_apis.rs:291\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/nursery/use_modern_math_apis.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"6edf1e34a1ac431fce0fc60267338fa5df168e56f8ac0789fe8e162e12207548"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/use_object_from_entries.rs:389-397 | crates/biome_js_analyze/src/lint/nursery/use_object_from_entries.rs:433-440 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/nursery/use_object_from_entries.rs:389\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/biome_js_analyze/src/lint/nursery/use_object_from_entries.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e9ad3e6d76ca99e0b0023ed0158bb86d0426667bc4e9641b361307401c6e58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/use_react_function_component_definition.rs:424-431 | crates/biome_js_analyze/src/lint/nursery/use_react_function_component_definition.rs:481-488 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/biome_js_analyze/src/lint/nursery/use_react_function_component_definition.rs:432\u0060 calls \u0060Some\u0060, \u0060star_token\u0060, \u0060with_star_token\u0060 and \u0060crates/biome_js_analyze/src/lint/nursery/use_react_function_component_definition.rs:489\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/biome_js_analyze/src/lint/nursery/use_react_function_component_definition.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"a76fe6801d199b5a8d170781f86945bd870f4b4002ba687cc4c534207a207317"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_js_analyze/src/lint/style/no_playwright_element_handle.rs:74-81 | crates/biome_js_analyze/src/lint/style/no_playwright_eval.rs:59-66 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/no_playwright_element_handle.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6393baee63ab8d87a3470def404ab4e52f385239d04e15fd9367a8a842c9f44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_js_analyze/src/lint/style/use_consistent_arrow_return.rs:90-97 | crates/biome_js_analyze/src/lint/style/use_consistent_arrow_return.rs:122-129 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/style/use_consistent_arrow_return.rs:90\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/style/use_consistent_arrow_return.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c7c2e06be7b6b56cf3991e9ad2a90df1b17962f73ad813d871b8ef1452ab09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_js_analyze/src/lint/style/use_unicode_regex.rs:141-148 | crates/biome_js_analyze/src/lint/style/use_unicode_regex.rs:192-199 \u2014 both copies are in the same file, so extract the block into one function there 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/biome_js_analyze/src/lint/style/use_unicode_regex.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b07347be736713353bbd2b98d638946e20a4c8a69718c2a7e1e092dc46eac9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_js_analyze/src/lint/suspicious/no_useless_regex_backrefs.rs:218-225 | crates/biome_js_analyze/src/lint/suspicious/no_useless_regex_backrefs.rs:227-234 \u2014 both copies are in the same file, so extract the block 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/biome_js_analyze/src/lint/suspicious/no_useless_regex_backrefs.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"178e82c04f996cde5e45a363d44c6064700e4ca7ca7c5c01d4ad1608799cd9b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_js_analyze/src/lint/suspicious/no_useless_regex_backrefs.rs:343-350 | crates/biome_js_analyze/src/lint/suspicious/no_useless_regex_backrefs.rs:374-381 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/suspicious/no_useless_regex_backrefs.rs:343\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/suspicious/no_useless_regex_backrefs.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ccc223eade4ac143c90e36d7dec231f1cf77f2559197dcd94253553bc6b0f8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_js_formatter/src/js/auxiliary/case_clause.rs:33-40 | crates/biome_js_formatter/src/js/auxiliary/default_clause.rs:23-30 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/js/auxiliary/case_clause.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"fae2f4f978ea36c9df63998fecffb5e5b8ac055261d981b344216ff620675cf7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_js_semantic/src/events.rs:1209-1216 | crates/biome_js_semantic/src/events.rs:1225-1232 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_js_semantic/src/events.rs:1209\u0060 it begins part-way through the construct above it, so those exact 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/biome_js_semantic/src/events.rs"},"region":{"startLine":1209}}}],"partialFingerprints":{"codehealthFindingId/v1":"6264dd5b99c7b275e42af28f42dacb3795f107e39bd77cd4e02dec34f9ff661f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_js_syntax/src/stmt_ext.rs:95-102 | crates/biome_js_syntax/src/stmt_ext.rs:123-130 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_syntax/src/stmt_ext.rs:95\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/biome_js_syntax/src/stmt_ext.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ab56243f8f22ea74c2a55c64a493f4c68e7c6d856543af7634993ecc478ff7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_js_type_info/src/format_inferred_type_info.rs:841-848 | crates/biome_js_type_info/src/format_type_info.rs:495-502 \u2014 before extracting anything, compare \u0060crates/biome_js_type_info/src/format_inferred_type_info.rs\u0060 and \u0060crates/biome_js_type_info/src/format_type_info.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 242 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_type_info/src/format_inferred_type_info.rs:841\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060\u0026mut Formatter\u003CFormatInferredTypeContext\u003C\u0027db\u003E\u003E\u0060 in one and \u0060\u0026mut biome_formatter::formatter::Formatter\u003CFormatTypeContext\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/format_inferred_type_info.rs"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b1904505d2ceab398256efaa35858c82b9d8260be4edbbe2735314a8933a66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_js_type_info/src/inferred_type.rs:1831-1838 | crates/biome_js_type_info/src/inferred_type.rs:1966-1973 \u2014 both copies are in the same file, so extract the block into one function there 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/biome_js_type_info/src/inferred_type.rs"},"region":{"startLine":1831}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee85f174a2af62be05af342c65d609a28a382e9e349fe41f11377ebdc04280f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_json_analyze/src/lint/nursery/use_consistent_object_keys.rs:148-155 | crates/biome_json_analyze/src/lint/nursery/use_consistent_object_keys.rs:185-192 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_json_analyze/src/lint/nursery/use_consistent_object_keys.rs:148\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_json_analyze/src/lint/nursery/use_consistent_object_keys.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"3353091aabcdb0b7148a9af4cb5a9c12cdc5feabd0aadf7b6d35b02a9e8fd647"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_lsp/src/server.rs:584-591 | crates/biome_lsp/src/server.rs:599-606 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_lsp/src/server.rs:584\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_lsp/src/server.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a36d57eff5e629a42008b118b4e9bc5d0a02d03ffb158c865a1028d09dc1e40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_markdown_formatter/src/markdown/lists/inline_item_list.rs:630-637 | crates/biome_markdown_formatter/src/quote.rs:367-374 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_formatter/src/markdown/lists/inline_item_list.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd3497d9f7c2b4c0720680eefd4c92860741d01f46bfafceae50bbe7070eecb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_markdown_formatter/src/words.rs:1047-1054 | crates/biome_markdown_formatter/src/words.rs:1062-1069 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_markdown_formatter/src/words.rs:1047\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_formatter/src/words.rs"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b6e1d5ac3bd1bfac34d6aa58733733a8c7dd5f87c23cc3fc37091af5cfabc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_module_graph/src/db/queries/css.rs:402-409 | crates/biome_module_graph/src/db/queries/css.rs:716-723 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_module_graph/src/db/queries/css.rs:402\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_module_graph/src/db/queries/css.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb682f4d8934dda397fd29453c8a987302b2139be65de08cd85df0705092063"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_module_graph/src/db/queries/type_inference/calls/implementation.rs:1287-1294 | crates/biome_module_graph/src/db/queries/type_inference/calls/implementation.rs:1322-1330 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/db/queries/type_inference/calls/implementation.rs"},"region":{"startLine":1287}}}],"partialFingerprints":{"codehealthFindingId/v1":"2039fcba4a14e5ff5bfcaf5e8e09a8ac8e7fe84de89c94d5578490a4f92386d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_module_graph/src/db/type_inference/expressions.rs:251-258 | crates/biome_module_graph/src/db/type_inference/expressions.rs:261-268 \u2014 both copies are in the same file, so extract the block into one function there 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/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ceeb86b60ac1834d5ee15bf6d656705edf55093227bb9207ff705a773ecc74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/biome_module_graph/src/html_module_info/visitor.rs:217-224 | crates/biome_module_graph/src/html_module_info/visitor.rs:255-261 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_module_graph/src/html_module_info/visitor.rs:217\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_module_graph/src/html_module_info/visitor.rs:213\u0060 calls \u0060Ok\u0060, \u0060opening_element\u0060 and \u0060crates/biome_module_graph/src/html_module_info/visitor.rs:253\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/biome_module_graph/src/html_module_info/visitor.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ae962e723e8f4c2b296dcb899be35acb99a828843fc093f404a56f5a7d07f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_package/src/node_js_package/tsconfig_json.rs:56-63 | crates/biome_package/src/node_js_package/turbo_json.rs:129-136 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_package/src/node_js_package/tsconfig_json.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"81cab2069cc1d29a90502909a20d9aef185b5aeff8ff2bb972b77c5da78f7f1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_react_compiler/src/lib.rs:49-56 | crates/biome_react_compiler/src/lib.rs:80-87 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_react_compiler/src/lib.rs:49\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060input\u0060 to \u0060ConvertInput\u003C\u0027_\u003E\u0060 in one and \u0060CompileInput\u003C\u0027_\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_react_compiler/src/lib.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a60766b8f4184c56aa8b398e9353149d1a35596a459194b9cb23b67659f240"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_service/src/file_handlers/html/parse_embedded_nodes.rs:814-821 | crates/biome_service/src/file_handlers/html/parse_embedded_nodes.rs:900-907 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_service/src/file_handlers/html/parse_embedded_nodes.rs:814\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_service/src/file_handlers/html/parse_embedded_nodes.rs"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"942599d3499b4b5bfd67a9ae0764e5d8c52428745cd1ac9e05bd83fbb46bcaf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_service/src/workspace_types.rs:105-112 | crates/biome_service/src/workspace_types.rs:632-639 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/workspace_types.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa4e9bce6bd3513ba55294c38807889c6da5204499518c46f98d612e331e8cb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/biome_syntax_codegen/src/generate_syntax_kinds.rs:21-28 | xtask/codegen/src/generate_syntax_kinds.rs:24-30 \u2014 before extracting anything, compare \u0060crates/biome_syntax_codegen/src/generate_syntax_kinds.rs\u0060 and \u0060xtask/codegen/src/generate_syntax_kinds.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 50 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_syntax_codegen/src/generate_syntax_kinds.rs:21\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_syntax_codegen/src/generate_syntax_kinds.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6e413c540bfb02127dd16abe214aa47bacb2d878aeaca8bfcecfac77a6b40a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_tailwind_logic/src/syntax_service.rs:370-377 | crates/biome_tailwind_logic/src/syntax_service.rs:414-421 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_tailwind_logic/src/syntax_service.rs:370\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_tailwind_logic/src/syntax_service.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"599c9ab7602c324340419956d6a260124fd4f72ef936a177232eac6974f48693"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_tailwind_logic/src/syntax_service.rs:478-485 | crates/biome_tailwind_logic/src/syntax_service.rs:597-604 \u2014 both copies are in the same file, so extract the block into one function there 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/biome_tailwind_logic/src/syntax_service.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc20410977dd600d3d91d60c755df23e2437afbbb29fe8245cfad6166b5b909"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): xtask/codegen/src/generate_configuration.rs:669-676 | xtask/codegen/src/generate_configuration.rs:825-832 \u2014 both copies are in the same file, so extract the block 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":"xtask/codegen/src/generate_configuration.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbebca72610d01eb188e0221aab8311aec6221322a8b40122a79ea374040d168"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): xtask/codegen/src/move_rule.rs:248-255 | xtask/codegen/src/move_rule.rs:267-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060xtask/codegen/src/move_rule.rs:248\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/move_rule.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ea4d34d581efa5a13e4d016616176cd4d44f42d64abb578a147def6064efb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): crates/biome_deserialize_macros/src/deserializable_derive.rs:267-273 | crates/biome_deserialize_macros/src/deserializable_derive.rs:311-317 | crates/biome_deserialize_macros/src/deserializable_derive.rs:490-496 | crates/biome_deserialize_macros/src/deserializable_derive.rs:551-557 | crates/biome_deserialize_macros/src/deserializable_derive.rs:584-590 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_deserialize_macros/src/deserializable_derive.rs:267\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_deserialize_macros/src/deserializable_derive.rs:309\u0060 calls \u0060generate_generics_without_trait_bounds\u0060 and \u0060crates/biome_deserialize_macros/src/deserializable_derive.rs:265\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_deserialize_macros/src/deserializable_derive.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"c44efc97bbb923b607d0089f15db8d4cd4321350e57da859e8c687e29b2cafd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 4): crates/biome_cli/src/service/windows.rs:141-146 | crates/biome_cli/src/service/windows.rs:166-172 | crates/biome_cli/src/service/windows.rs:269-274 | crates/biome_cli/src/service/windows.rs:294-300 \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/biome_cli/src/service/windows.rs:141\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/service/windows.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"97cce2fd0ec5639b8db8facbe56a33d9fbc7b1773d57b9d01514cbc27e96487f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/biome_css_formatter/src/scss/auxiliary/media_query.rs:16-23 | crates/biome_html_formatter/src/svelte/auxiliary/await_catch_clause.rs:10-17 | crates/biome_html_formatter/src/svelte/auxiliary/await_then_clause.rs:10-17 | crates/biome_js_formatter/src/js/bindings/array_binding_pattern_element.rs:18-24 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_formatter/src/scss/auxiliary/media_query.rs:16\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060\u0026mut CssFormatter\u0060 in one and \u0060\u0026mut HtmlFormatter\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/biome_css_formatter/src/scss/auxiliary/media_query.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d86b3bf873346e760732707a34b741f1ea69d2381f3e1a62ef4cef8698e2d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 4): crates/biome_js_analyze/src/lint/nursery/no_tanstack_query_void_query_fn.rs:330-336 | crates/biome_js_analyze/src/lint/nursery/use_vue_render_return.rs:146-151 | crates/biome_js_analyze/src/lint/suspicious/use_iterable_callback_return.rs:381-386 | crates/biome_js_analyze/src/utils/function_return.rs:22-27 \u2014 before extracting anything, compare \u0060crates/biome_js_analyze/src/lint/nursery/no_tanstack_query_void_query_fn.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/nursery/use_vue_render_return.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/nursery/no_tanstack_query_void_query_fn.rs:330\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/nursery/no_tanstack_query_void_query_fn.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b7748391f4e55182100908dee57361f8d45519fb106ce6fddbacd5a0676114"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/biome_tailwind_parser/src/lexer/mod.rs:51-57 | crates/biome_tailwind_parser/src/lexer/mod.rs:91-97 | crates/biome_tailwind_parser/src/lexer/mod.rs:143-149 | crates/biome_tailwind_parser/src/lexer/mod.rs:162-168 \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/biome_tailwind_parser/src/lexer/mod.rs:51\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/biome_tailwind_parser/src/lexer/mod.rs:98\u0060 calls \u0060consume_bracketed_thing\u0060 and \u0060crates/biome_tailwind_parser/src/lexer/mod.rs:150\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/biome_tailwind_parser/src/lexer/mod.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b42a151f90816da8261253b8f93840370155547d22657a264ff4aa00977556"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/biome_analyze/src/utils.rs:99-105 | crates/biome_analyze/src/utils.rs:209-215 | crates/biome_analyze/src/utils.rs:222-228 \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/biome_analyze/src/utils.rs:99\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_analyze/src/utils.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4b9ea5b2f0e0451ea9493a5fe7bb9a2cd9f7ca3fdfbdc48792f4ed188aed316"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/biome_graphql_analyze/src/lib.rs:115-121 | crates/biome_json_analyze/src/lib.rs:169-175 | crates/biome_yaml_analyze/src/lib.rs:115-121 \u2014 before extracting anything, compare \u0060crates/biome_graphql_analyze/src/lib.rs\u0060 and \u0060crates/biome_yaml_analyze/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_graphql_analyze/src/lib.rs:115\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_graphql_analyze/src/lib.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a8f0ae23915231639664d99731e3ba1e3ff00bdd61a7eeeca9f77d252007d22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/biome_html_analyze/src/lint/a11y/no_interactive_element_to_noninteractive_role.rs:137-143 | crates/biome_html_analyze/src/lint/a11y/no_noninteractive_element_to_interactive_role.rs:130-136 | crates/biome_html_analyze/src/lint/a11y/no_redundant_roles.rs:153-159 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_analyze/src/lint/a11y/no_interactive_element_to_noninteractive_role.rs:137\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/biome_html_analyze/src/lint/a11y/no_interactive_element_to_noninteractive_role.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"530072412e97284f8fe804b8d5a6d29a267d9b40c38b5b042eb1a066bc5478a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/biome_html_parser/src/lexer/mod.rs:1046-1052 | crates/biome_tailwind_parser/src/lexer/mod.rs:577-583 | crates/biome_yaml_parser/src/lexer/mod.rs:1416-1422 \u2014 before extracting anything, compare \u0060crates/biome_html_parser/src/lexer/mod.rs\u0060 and \u0060crates/biome_tailwind_parser/src/lexer/mod.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_parser/src/lexer/mod.rs"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"49070e16a3a6dcf6fbe6f30fed0cec00e5abbd7e92d7fcf6cc969f3180618560"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/biome_js_analyze/src/lint/a11y/no_interactive_element_to_noninteractive_role.rs:148-154 | crates/biome_js_analyze/src/lint/a11y/no_noninteractive_element_to_interactive_role.rs:138-144 | crates/biome_js_analyze/src/lint/a11y/no_redundant_roles.rs:140-146 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/a11y/no_interactive_element_to_noninteractive_role.rs:148\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/biome_js_analyze/src/lint/a11y/no_interactive_element_to_noninteractive_role.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"1022ea6b044441413e559ead96e64467024579abda36dc9149dfa46d6993e80b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/biome_js_analyze/src/lint/nursery/use_explicit_type.rs:465-471 | crates/biome_js_analyze/src/lint/nursery/use_explicit_type.rs:476-483 | crates/biome_js_analyze/src/lint/nursery/use_explicit_type.rs:505-511 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_explicit_type.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"27602830ee690b8fdd08f6f00dbe3fc9b615deb86ed0c5521be38ab287b176fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 3): crates/biome_js_analyze/src/lint/nursery/use_iterator_zip.rs:433-439 | crates/biome_js_analyze/src/lint/nursery/use_modern_math_apis.rs:183-188 | crates/biome_js_analyze/src/lint/nursery/use_set_size.rs:208-214 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. 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/biome_js_analyze/src/lint/nursery/use_iterator_zip.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ed05fa84ff12ab08f4ebd71c0170d9e2eedeed35ea000b62c1fee0d8a51640f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/biome_js_analyze/src/lint/style/use_number_namespace.rs:201-207 | crates/biome_js_analyze/src/lint/suspicious/no_global_is_finite.rs:96-102 | crates/biome_js_analyze/src/lint/suspicious/no_global_is_nan.rs:97-103 \u2014 before extracting anything, compare \u0060crates/biome_js_analyze/src/lint/suspicious/no_global_is_finite.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/suspicious/no_global_is_nan.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 78 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/style/use_number_namespace.rs:201\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_number_namespace.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f89d10a2e8144dc8d0a8a884305bb13eca7634c99a5e18745d68251dc3b411"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/biome_markdown_formatter/src/words.rs:1010-1016 | crates/biome_markdown_formatter/src/words.rs:1047-1053 | crates/biome_markdown_formatter/src/words.rs:1062-1068 \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/biome_markdown_formatter/src/words.rs:1010\u0060 it does not close everything it opens, so those exact 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/biome_markdown_formatter/src/words.rs:1055\u0060 calls \u0060format_with\u0060, \u0060fmt_escaped\u0060 and \u0060crates/biome_markdown_formatter/src/words.rs:1018\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/biome_markdown_formatter/src/words.rs"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"a63566ff23a600188a3b42f65654f5800ed106ed2a9ca8cdd33f82837fac135e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/biome_markdown_parser/src/to_html.rs:1652-1658 | crates/biome_markdown_parser/src/to_html.rs:2090-2096 | crates/biome_markdown_syntax/src/text_ext.rs:148-156 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_markdown_parser/src/to_html.rs:1652\u0060 it does not close everything it opens, so those exact 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/biome_markdown_parser/src/to_html.rs"},"region":{"startLine":1652}}}],"partialFingerprints":{"codehealthFindingId/v1":"b077ce14721f4f9ba1c36c9fb421b0d9b7f85f8be779ebfe7978ee450567ce68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_cli/src/execute/migrate.rs:306-312 | crates/biome_cli/src/execute/migrate.rs:391-397 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/execute/migrate.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0fd01523affbbd22483ff31c80f4b8d64a1c17cdca4c293d4e2860f77262a58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_cli/src/runner/impls/process_file/lint_and_assist.rs:32-38 | crates/biome_cli/src/runner/impls/process_file/lint_and_assist.rs:173-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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/biome_cli/src/runner/impls/process_file/lint_and_assist.rs:39\u0060 calls \u0060build\u0060, \u0060analyzer_selectors\u0060 and \u0060crates/biome_cli/src/runner/impls/process_file/lint_and_assist.rs:180\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/biome_cli/src/runner/impls/process_file/lint_and_assist.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f06f3a402e2812f05ff73582c3eeab5c91fc7aefd6bb59a006c80557c16eed2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_css_analyze/src/lint/nursery/use_logical_properties.rs:1349-1355 | crates/biome_css_analyze/src/lint/nursery/use_logical_properties.rs:1385-1391 \u2014 both copies are in the same file, so extract the block into one function there 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/biome_css_analyze/src/lint/nursery/use_logical_properties.rs"},"region":{"startLine":1349}}}],"partialFingerprints":{"codehealthFindingId/v1":"833a11e2e43a1c81b9242d1d1ecb7caf2d3f3fd8361a2144ce391c0dcf5a2f23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_css_formatter/src/comments.rs:689-696 | crates/biome_css_formatter/src/comments.rs:825-832 \u2014 both copies are in the same file, so extract the block into one function there 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/biome_css_formatter/src/comments.rs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"3056b43598f22c5b2dc53a11e5eaf6a2e24c076c39238b93cc60aaa629205538"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_css_formatter/src/scss/statements/if_at_rule.rs:34-40 | crates/biome_css_formatter/src/scss/statements/while_at_rule.rs:29-39 \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/biome_css_formatter/src/scss/statements/while_at_rule.rs:29\u0060 it does not close everything it opens, so those exact 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/biome_css_formatter/src/scss/statements/if_at_rule.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d516e54fa9a7a6b84a52743ed445547224d21b85228df0ad752d42e3aaf2735"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_grit_patterns/src/grit_css_parser.rs:60-66 | crates/biome_grit_patterns/src/grit_json_parser.rs:59-65 \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/biome_grit_patterns/src/grit_css_parser.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8658e99a1fdb5322dfda22dd25905cce06072da3a5a0a1dc1b2af793d04137"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20137 lines \u00D7 3): crates/biome_grit_patterns/src/pattern_compiler/and_compiler.rs:31-34 | crates/biome_grit_patterns/src/pattern_compiler/any_compiler.rs:16-22 | crates/biome_grit_patterns/src/pattern_compiler/or_compiler.rs:16-22 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_grit_patterns/src/pattern_compiler/and_compiler.rs:31\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_patterns/src/pattern_compiler/and_compiler.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d49ef880f97e59251cdb13c281b8f7af153d1e6f6598d519ec4b6513a6d54e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20137 lines \u00D7 3): crates/biome_grit_patterns/src/pattern_compiler/and_compiler.rs:69-72 | crates/biome_grit_patterns/src/pattern_compiler/any_compiler.rs:36-42 | crates/biome_grit_patterns/src/pattern_compiler/or_compiler.rs:36-42 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_grit_patterns/src/pattern_compiler/and_compiler.rs:69\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_patterns/src/pattern_compiler/and_compiler.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e7479be8e21a57b5b4d99e8ac8c2c205c967f5bf4e773c7a52ad7ebdd57ffb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_grit_patterns/src/pattern_compiler/auto_wrap.rs:387-393 | crates/biome_grit_patterns/src/pattern_compiler/auto_wrap.rs:403-409 \u2014 both copies are in the same file, so extract the block into one function there 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/biome_grit_patterns/src/pattern_compiler/auto_wrap.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd1335b60bffd5cc6df57fb30de68fb3942a96aeadda583a1920fb44d2c99181"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_grit_patterns/src/pattern_compiler/predicate_call_compiler.rs:44-51 | crates/biome_grit_patterns/src/pattern_compiler/predicate_call_compiler.rs:78-85 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_grit_patterns/src/pattern_compiler/predicate_call_compiler.rs:44\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_grit_patterns/src/pattern_compiler/predicate_call_compiler.rs:77\u0060 calls \u0060metavariable_prefix\u0060, \u0060to_owned\u0060 and \u0060crates/biome_grit_patterns/src/pattern_compiler/predicate_call_compiler.rs:43\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_patterns/src/pattern_compiler/predicate_call_compiler.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"029f396a0d1c9123efc8a21da90d0ce213305f518db5cde9e348e48d0069ce53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_html_analyze/src/assist/source/use_sorted_attributes.rs:158-164 | crates/biome_html_analyze/src/assist/source/use_sorted_attributes.rs:224-230 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/assist/source/use_sorted_attributes.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"fefffd8f75a812101166127933e0c92a8e4148729a1bbbbacc1519bfff715ca8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_html_analyze/src/lint/a11y/no_aria_unsupported_elements.rs:186-192 | crates/biome_js_analyze/src/lint/a11y/no_aria_unsupported_elements.rs:154-160 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_analyze/src/lint/a11y/no_aria_unsupported_elements.rs:186\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/a11y/no_aria_unsupported_elements.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"55134fff1bfd08906115b1ca69cd92b67df42eb58a6e76cbd09b7b2274ecb9b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_html_analyze/src/lint/a11y/no_svg_without_title.rs:217-223 | crates/biome_js_analyze/src/lint/a11y/no_svg_without_title.rs:198-204 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_analyze/src/lint/a11y/no_svg_without_title.rs:217\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/biome_html_analyze/src/lint/a11y/no_svg_without_title.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"b71d53846242045ca8984db638bbefa4ea24282ff80fa2a6238cf6ffb2be25ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_html_analyze/src/lint/a11y/use_valid_aria_props.rs:98-104 | crates/biome_js_analyze/src/lint/a11y/use_valid_aria_props.rs:115-122 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_analyze/src/lint/a11y/use_valid_aria_props.rs:98\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/a11y/use_valid_aria_props.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b778160bfda2e9e2fc9153b4bf82675a63aeb2276391803b5f65325dc74f4f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_html_analyze/src/lint/a11y/use_valid_aria_role.rs:144-150 | crates/biome_js_analyze/src/lint/a11y/use_valid_aria_role.rs:168-174 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_analyze/src/lint/a11y/use_valid_aria_role.rs:144\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/biome_html_analyze/src/lint/a11y/use_valid_aria_role.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aca0daf5ae1d3d62f32d41348b1e02c790666c4f2ae5de4856c8d03f7710a5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_html_analyze/src/lint/nursery/use_vue_v_model.rs:229-237 | crates/biome_html_analyze/src/lint/nursery/use_vue_v_on_exact.rs:150-158 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. 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/biome_html_analyze/src/lint/nursery/use_vue_v_model.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2936ad1800e42a00ab5385ab567b89fb78a4972046770368aa4ff58367e52e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_html_formatter/src/vue/auxiliary/v_for_tuple_binding.rs:19-25 | crates/biome_js_formatter/src/js/expressions/import_call_expression.rs:22-28 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060\u0026mut HtmlFormatter\u0060 in one and \u0060\u0026mut JsFormatter\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/biome_html_formatter/src/vue/auxiliary/v_for_tuple_binding.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"d89c0b2408b6a65fb7b152bb7bbc68003af08a4ea900e59b7175d07792403c44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_html_syntax/src/attribute_ext.rs:123-129 | crates/biome_html_syntax/src/attribute_ext.rs:204-210 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_syntax/src/attribute_ext.rs:123\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_syntax/src/attribute_ext.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a1fee7a4e7951c828c47c19f0d3ddbd673987f1b26325bc408b88062a306eb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_js_analyze/src/lint/complexity/no_useless_escape_in_regex.rs:297-304 | crates/biome_js_analyze/src/lint/suspicious/no_misleading_character_class.rs:154-160 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/complexity/no_useless_escape_in_regex.rs:297\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/complexity/no_useless_escape_in_regex.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7904f67bf191410df5bcd5e1f20f3063ca060f4f5212a0388b07fc4a9572fe2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/no_disabled_attribute.rs:257-263 | crates/biome_js_analyze/src/lint/nursery/use_string_starts_ends_with.rs:143-149 \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/biome_js_analyze/src/lint/nursery/no_disabled_attribute.rs:257\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/biome_js_analyze/src/lint/nursery/no_disabled_attribute.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"6caa261d1dacba02fef585912a8c92cac52b3a68d5db9a4b4c9030b471c0750e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/no_new_array.rs:89-95 | crates/biome_js_analyze/src/lint/nursery/no_uninvoked_array_callback.rs:105-112 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/nursery/no_new_array.rs:89\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/biome_js_analyze/src/lint/nursery/no_new_array.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0017ef7342fd6d75a0da881bcc7bfaf901fc01c09f25de72505c899f7ef9ef6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/no_undeclared_custom_properties.rs:116-122 | crates/biome_service/src/file_handlers/javascript.rs:796-802 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/nursery/no_undeclared_custom_properties.rs:116\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/nursery/no_undeclared_custom_properties.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae6e75055e82af0958217fa4ce5412f7ca79dea951e3e37d4e38c8b685dcb61d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/no_unsafe_return.rs:309-315 | crates/biome_js_analyze/src/lint/nursery/no_unsafe_return.rs:320-326 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/nursery/no_unsafe_return.rs:309\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/nursery/no_unsafe_return.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b54bc4f381de7665532f318d60c1d293be109e8cfca368c19bc0a489f1911a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/use_react_function_component_definition.rs:276-283 | crates/biome_js_analyze/src/lint/nursery/use_react_function_component_definition.rs:472-479 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_react_function_component_definition.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a37bdee056f48253544fdb968ae8ab1422cc9fd10f87dd4b2bc0a46d1bf826"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_js_analyze/src/lint/style/use_node_assert_strict.rs:77-84 | crates/biome_js_analyze/src/lint/style/use_nodejs_import_protocol.rs:114-121 \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/biome_js_analyze/src/lint/style/use_node_assert_strict.rs:77\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_node_assert_strict.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a1d6c08dff50d65db69136acb582b53b07307b967a21f3441dfa75e22aced8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_js_analyze/src/lint/suspicious/no_alert.rs:134-140 | crates/biome_js_analyze/src/lint/suspicious/no_alert.rs:154-160 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_js_analyze/src/lint/suspicious/no_alert.rs:134\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/no_alert.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef35b1800bbc7a95432a8b441c273287d033ce6749b9922ee55c51f6d246be7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_js_analyze/src/lint/suspicious/no_document_import_in_page.rs:53-59 | crates/biome_js_analyze/src/lint/suspicious/no_head_import_in_document.rs:66-72 \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/biome_js_analyze/src/lint/suspicious/no_document_import_in_page.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c1c40e011d57e0474c40f8f5a72bebfb3ee5c93b15afefc1eb027ef4b2e16c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_js_analyze/src/lint/suspicious/no_unnecessary_conditions.rs:472-478 | crates/biome_js_analyze/src/lint/suspicious/no_unnecessary_conditions.rs:506-512 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_js_analyze/src/lint/suspicious/no_unnecessary_conditions.rs:472\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/biome_js_analyze/src/lint/suspicious/no_unnecessary_conditions.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"2344bc74154b88aab056baef936af5d86accd0fd111415827c547ba9448f828f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_js_formatter/src/js/assignments/array_assignment_pattern_element.rs:18-24 | crates/biome_js_formatter/src/js/assignments/object_assignment_pattern_shorthand_property.rs:19-27 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_formatter/src/js/assignments/array_assignment_pattern_element.rs:18\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/biome_js_formatter/src/js/assignments/array_assignment_pattern_element.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c77f99908d75ff0556ea86e0dfc21c7647463638711142317c11b41ef8b83f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_js_semantic/src/events.rs:646-654 | crates/biome_js_semantic/src/events.rs:657-663 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_semantic/src/events.rs:646\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/biome_js_semantic/src/events.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"a07a4784d055fdc0ed9dcf60b54b2d8d79189d22cb73cb409792d49c73bcae60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_js_type_info/src/format_inferred_type_info.rs:306-312 | crates/biome_js_type_info/src/format_inferred_type_info.rs:521-527 \u2014 both copies are in the same file, so extract the block into one function there 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/biome_js_type_info/src/format_inferred_type_info.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfacf7c433b52495354cec13b35b2a3a443fb53cbe5fb4335f7a3795227c5cdc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_json_analyze/src/assist/source/use_sorted_package_json/sorters/dependencies_meta.rs:61-67 | crates/biome_json_analyze/src/assist/source/use_sorted_package_json/sorters/helpers.rs:28-34 \u2014 before extracting anything, compare \u0060crates/biome_json_analyze/src/assist/source/use_sorted_package_json/sorters/dependencies_meta.rs\u0060 and \u0060crates/biome_json_analyze/src/assist/source/use_sorted_package_json/sorters/helpers.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_json_analyze/src/assist/source/use_sorted_package_json/sorters/dependencies_meta.rs:61\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_json_analyze/src/assist/source/use_sorted_package_json/sorters/dependencies_meta.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"9afe0b06a19609185caa2dcf87a52f0e51da99c38c1778e879d42dc42aa23d6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_json_analyze/src/lint/nursery/use_package_json_valid_cpu.rs:211-217 | crates/biome_json_analyze/src/lint/nursery/use_package_json_valid_license.rs:183-189 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_json_analyze/src/lint/nursery/use_package_json_valid_cpu.rs:211\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/biome_json_analyze/src/lint/nursery/use_package_json_valid_cpu.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb8781b6f641abf64ae7edff5a0e08e3d7b684cf1514b84d6ea8ee78e4cb8892"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_markdown_parser/src/syntax/inline/code_span.rs:108-114 | crates/biome_markdown_parser/src/syntax/mod.rs:1868-1874 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/inline/code_span.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"355c9ac3129e2a60e5034daecc5fb8fa5950c39a030b4b58a64c18cd40bdffbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_markdown_parser/src/syntax/list.rs:934-940 | crates/biome_markdown_parser/src/syntax/list.rs:1327-1333 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_markdown_parser/src/syntax/list.rs:934\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"c44abd2ad6d4f8fe2a9fcdd21f6a4ded8424cef5531ba072432b35e5bb150587"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_markdown_parser/src/syntax/mod.rs:1049-1055 | crates/biome_markdown_parser/src/syntax/mod.rs:1118-1124 \u2014 both copies are in the same file, so extract the block into one function there 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/biome_markdown_parser/src/syntax/mod.rs"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c16405f8cc3febfcadc6a9869878fc86e202a4cf1be941e3cd76a79089ceca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_module_graph/src/css_module_info/traverse.rs:738-744 | crates/biome_module_graph/src/css_module_info/traverse.rs:795-801 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_module_graph/src/css_module_info/traverse.rs:738\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_module_graph/src/css_module_info/traverse.rs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba2d1b988a27e4b039ea70cec4f96ae13fa1e7ddfda52354a3fa52a5f567622"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_module_graph/src/db/queries.rs:41-47 | crates/biome_module_graph/src/db/queries.rs:131-137 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_module_graph/src/db/queries.rs:41\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_module_graph/src/db/queries.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f22922a56816f0e2ac74af95ac9a2c9d405ef362edb18c66a7b38f9643bc09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_module_graph/src/db/queries/css.rs:118-124 | crates/biome_module_graph/src/db/queries/css.rs:193-199 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_module_graph/src/db/queries/css.rs:118\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_module_graph/src/db/queries/css.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"f819964f1ec533ede0c898b3ea1c1d308df2ff26f52c50e0f63302832eea90d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_react_compiler/src/prefilter.rs:74-80 | crates/biome_react_compiler/src/prefilter.rs:84-90 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_react_compiler/src/prefilter.rs:74\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_react_compiler/src/prefilter.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"6149d35a4acc3ae8078cf432c27b00efd355a514c88d06b67c78d38bac9974cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_resolver/src/lib.rs:104-110 | crates/biome_resolver/src/lib.rs:832-838 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_resolver/src/lib.rs:104\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_resolver/src/lib.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d7e188497262e45ce481afb53c8406cecd918be5de86c37fc4094a7b9307b62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_rowan/src/cursor/node.rs:913-919 | crates/biome_rowan/src/cursor/node.rs:1113-1119 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_rowan/src/cursor/node.rs:913\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_rowan/src/cursor/node.rs"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d6d21bf0d5af4b492982ddb9ec3699196a3e507db64385c851cdc18205c91b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_service/src/file_handlers/html/go_to.rs:28-34 | crates/biome_service/src/file_handlers/javascript/go_to.rs:30-36 \u2014 \u0060crates/biome_service/src/file_handlers/html/go_to.rs\u0060 and \u0060crates/biome_service/src/file_handlers/javascript/go_to.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 42 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_service/src/file_handlers/html/go_to.rs:28\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/html/go_to.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"687e2eb0e74d2c9e6c4b46486942d58f5596905e8145f006706143eb3679f209"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_service/src/file_handlers/javascript.rs:1499-1505 | crates/biome_service/src/file_handlers/javascript.rs:2052-2058 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_service/src/file_handlers/javascript.rs:1499\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_service/src/file_handlers/javascript.rs"},"region":{"startLine":1499}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d6d2923e60f7e322ca5c11e39f95ec1d5e451b68f7c1802d5fffbaa730e4a29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_service/src/settings.rs:1122-1128 | crates/biome_service/src/settings.rs:1174-1180 \u2014 both copies are in the same file, so extract the block into one function there 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/biome_service/src/settings.rs"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f049a696cf42a81444a8dce7bff601b320a7d49363c2d8eab820873781e835e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_syntax_codegen/src/ast.rs:531-538 | xtask/codegen/src/js_kinds_src.rs:569-576 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_syntax_codegen/src/ast.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca143ac50a7a71459486a9ed28291873377923aaba74bdc9b68e5179d53a9e44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_syntax_codegen/src/generate_nodes.rs:418-424 | xtask/codegen/src/generate_nodes.rs:450-456 \u2014 before extracting anything, compare \u0060crates/biome_syntax_codegen/src/generate_nodes.rs\u0060 and \u0060xtask/codegen/src/generate_nodes.rs\u0060 as WHOLE FILES: this scan already matched 26 separate duplicated blocks between them, totalling at least 933 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_syntax_codegen/src/generate_nodes.rs:418\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_syntax_codegen/src/generate_nodes.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"754ca2e9d30a3be9515bdda50985919895bb8ca94df9ca6fae1a0452789699fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_yaml_parser/src/lexer/mod.rs:902-908 | crates/biome_yaml_parser/src/lexer/mod.rs:925-931 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_yaml_parser/src/lexer/mod.rs"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ef4bc3d4a9dfa081b398714b3ef185ce682dd089a2c805a35719c01cddee77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): crates/biome_css_analyze/src/lint/nursery/use_consistent_unicode_bom.rs:94-99 | crates/biome_graphql_analyze/src/lint/nursery/use_consistent_unicode_bom.rs:90-95 | crates/biome_html_analyze/src/lint/nursery/use_consistent_unicode_bom.rs:82-87 | crates/biome_js_analyze/src/lint/nursery/use_consistent_unicode_bom.rs:103-108 | crates/biome_json_analyze/src/lint/nursery/use_consistent_unicode_bom.rs:90-95 | crates/biome_markdown_analyze/src/lint/nursery/use_consistent_unicode_bom.rs:82-87 \u2014 before extracting anything, compare \u0060crates/biome_css_analyze/src/lint/nursery/use_consistent_unicode_bom.rs\u0060 and \u0060crates/biome_graphql_analyze/src/lint/nursery/use_consistent_unicode_bom.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 50 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_analyze/src/lint/nursery/use_consistent_unicode_bom.rs:94\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/biome_css_analyze/src/lint/nursery/use_consistent_unicode_bom.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"5975985700b5a0213e450ab090d0d1fcc129c825ab446e5a88d49251430c7237"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6): crates/biome_css_analyze/src/lint/nursery/use_consistent_unicode_bom.rs:135-141 | crates/biome_graphql_analyze/src/lint/nursery/use_consistent_unicode_bom.rs:135-141 | crates/biome_html_analyze/src/lint/nursery/use_consistent_unicode_bom.rs:123-129 | crates/biome_js_analyze/src/lint/nursery/use_consistent_unicode_bom.rs:144-150 | crates/biome_json_analyze/src/lint/nursery/use_consistent_unicode_bom.rs:131-137 | crates/biome_markdown_analyze/src/lint/nursery/use_consistent_unicode_bom.rs:127-133 \u2014 before extracting anything, compare \u0060crates/biome_css_analyze/src/lint/nursery/use_consistent_unicode_bom.rs\u0060 and \u0060crates/biome_graphql_analyze/src/lint/nursery/use_consistent_unicode_bom.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 50 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_analyze/src/lint/nursery/use_consistent_unicode_bom.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/biome_css_analyze/src/lint/nursery/use_consistent_unicode_bom.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"732e248ae7e8c815d7ae6e48bf29629ecdbfce1067d27d5c392b3e6d12143046"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): crates/biome_graphql_formatter/src/verbatim.rs:57-62 | crates/biome_grit_formatter/src/verbatim.rs:57-62 | crates/biome_html_formatter/src/verbatim.rs:70-75 | crates/biome_js_formatter/src/verbatim.rs:57-62 | crates/biome_json_formatter/src/verbatim.rs:56-61 | crates/biome_yaml_formatter/src/verbatim.rs:80-85 \u2014 before extracting anything, compare \u0060crates/biome_graphql_formatter/src/verbatim.rs\u0060 and \u0060crates/biome_grit_formatter/src/verbatim.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 199 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_graphql_formatter/src/verbatim.rs:57\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060\u0026mut Formatter\u003CGraphqlFormatContext\u003E\u0060 in one and \u0060\u0026mut Formatter\u003CGritFormatContext\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_graphql_formatter/src/verbatim.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5cbc6c3c099a4b5c469a32453c61c492bbc2529976b786a20518ec79753907"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/biome_cli/src/execute/migrate.rs:227-232 | crates/biome_cli/src/execute/migrate.rs:306-311 | crates/biome_cli/src/execute/migrate.rs:391-396 \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/biome_cli/src/execute/migrate.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5564a084e2ec769995c5f320259ad2a2dc3cc96988c31a5a6c2523d8c6773e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/biome_html_syntax/src/attribute_ext.rs:125-130 | crates/biome_html_syntax/src/attribute_ext.rs:206-211 | crates/biome_html_syntax/src/attribute_ext.rs:455-460 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_syntax/src/attribute_ext.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a7096e3fecc0f82a82f013152611a9fcfb055275eebae0bfd38ceb7d5a37e95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/biome_js_type_info/src/format_inferred_type_info.rs:1134-1139 | crates/biome_js_type_info/src/format_inferred_type_info.rs:1154-1159 | crates/biome_js_type_info/src/format_type_info.rs:1032-1037 \u2014 before extracting anything, compare \u0060crates/biome_js_type_info/src/format_inferred_type_info.rs\u0060 and \u0060crates/biome_js_type_info/src/format_type_info.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 242 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_type_info/src/format_inferred_type_info.rs:1134\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060\u0026mut Formatter\u003CFormatInferredTypeContext\u003C\u0027db\u003E\u003E\u0060 in one and \u0060\u0026mut Formatter\u003CFormatTypeContext\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/format_inferred_type_info.rs"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8aa8aa0a87a83f56fa46770e0b71c3234b1136afbdc82324012ba3bd79ceb06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/biome_lsp/src/server.rs:532-537 | crates/biome_lsp/src/server.rs:558-563 | crates/biome_lsp/src/server.rs:571-576 \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/biome_lsp/src/server.rs:532\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/biome_lsp/src/server.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6007eac449fc70bea6ad72722e7b9259bfc7d1a64bd2a96f2d56c1e36515e58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/biome_module_graph/src/js_module_info/collector.rs:206-211 | crates/biome_module_graph/src/js_module_info/collector.rs:238-243 | crates/biome_module_graph/src/js_module_info/collector.rs:299-304 \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/biome_module_graph/src/js_module_info/collector.rs:206\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/js_module_info/collector.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"597d362ec40c2d4a4bc32e56a64489bf6df321165f7009d1afc8229fcbdf53df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/biome_module_graph/src/js_module_info/collector.rs:239-244 | crates/biome_module_graph/src/js_module_info/collector.rs:258-263 | crates/biome_module_graph/src/js_module_info/collector.rs:300-305 \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/biome_module_graph/src/js_module_info/collector.rs:239\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/js_module_info/collector.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c4efdb8e1e1f82dc161a81dc914af28a28d7f301ddd4835767e0846c862118"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/biome_yaml_parser/src/parser/block.rs:219-224 | crates/biome_yaml_parser/src/parser/block.rs:228-233 | crates/biome_yaml_parser/src/parser/block.rs:237-242 \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/biome_yaml_parser/src/parser/block.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"29caea9f216bbfe99bd6db84a31f3898837b2fe4e7e2195d38364388459da85b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_cli/src/commands/inspect/config/configuration.rs:422-427 | crates/biome_cli/src/commands/inspect/config/configuration.rs:448-453 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_cli/src/commands/inspect/config/configuration.rs:422\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_cli/src/commands/inspect/config/configuration.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a1c3d7db9df9f6fa3f05b6af64a131bcfe44425611a5ea61032ea66a65d5422"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/biome_cli/src/execute/migrate/eslint_to_biome.rs:114-130 | crates/biome_cli/src/execute/migrate/stylelint_to_biome.rs:106-122 \u2014 before extracting anything, compare \u0060crates/biome_cli/src/execute/migrate/eslint_to_biome.rs\u0060 and \u0060crates/biome_cli/src/execute/migrate/stylelint_to_biome.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_cli/src/execute/migrate/eslint_to_biome.rs:114\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_cli/src/execute/migrate/eslint_to_biome.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"8daac2631dd0017d506c8444b737eb5bcec67a379b78b7e61a6c0bb69643b8d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_css_formatter/src/css/auxiliary/legacy_filter_value.rs:31-38 | crates/biome_css_formatter/src/css/lists/custom_property_component_list.rs:19-26 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_formatter/src/css/auxiliary/legacy_filter_value.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"7993fa5658f1a725630c02ec655a50bfc8b0be7842732df675d64079f67b48fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_formatter_test/src/snapshot_builder.rs:51-56 | crates/biome_formatter_test/src/snapshot_builder.rs:200-205 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/biome_formatter_test/src/snapshot_builder.rs:57\u0060 calls \u0060unwrap\u0060 and \u0060crates/biome_formatter_test/src/snapshot_builder.rs:207\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/biome_formatter_test/src/snapshot_builder.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"c20fdd473f592b1e13054f717f265006a0f41c3c95f4dd1f9384aa6541990665"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_glob/src/lib.rs:375-380 | crates/biome_rule_options/src/shared/restricted_regex.rs:84-89 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_glob/src/lib.rs:375\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_glob/src/lib.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"09c4bdd2d184b4b3e939a77d9ded048a49904ece254a80a80f9f3a1891e0f177"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_html_analyze/src/lint/nursery/no_disabled_attribute.rs:352-357 | crates/biome_html_analyze/src/lint/nursery/use_vue_consistent_v_for_delimiter.rs:134-139 \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/biome_html_analyze/src/lint/nursery/no_disabled_attribute.rs:352\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/biome_html_analyze/src/lint/nursery/no_disabled_attribute.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"512cf6ac00c6f08c8fe749a14ddb9ac666e3e74fed32f5792f60bfc4f2ce2247"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_html_analyze/src/lint/nursery/no_invalid_file_input_accept.rs:157-162 | crates/biome_js_analyze/src/lint/nursery/no_invalid_file_input_accept.rs:147-152 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/nursery/no_invalid_file_input_accept.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c0407dcba786b14780dfede653587d8040b05577c2e95119c4cf1f04ee32c80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_html_analyze/src/lint/nursery/no_tailwind_restricted_classes.rs:244-249 | crates/biome_js_analyze/src/lint/nursery/no_tailwind_restricted_classes.rs:249-254 \u2014 before extracting anything, compare \u0060crates/biome_html_analyze/src/lint/nursery/no_tailwind_restricted_classes.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/nursery/no_tailwind_restricted_classes.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_analyze/src/lint/nursery/no_tailwind_restricted_classes.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/nursery/no_tailwind_restricted_classes.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6465f7c99e6d41109b84995c5380b9483eda8894bfb21c0253c2cd42ffb75c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_html_parser/src/syntax/svelte.rs:512-519 | crates/biome_html_parser/src/syntax/svelte.rs:782-787 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_parser/src/syntax/svelte.rs:512\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_parser/src/syntax/svelte.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd1e0e7a3f81a766003e05c252fc7df9df7b49d38a7f208a81ec710cf0d82754"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_html_syntax/src/attribute_ext.rs:210-215 | crates/biome_html_syntax/src/attribute_ext.rs:421-426 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_html_syntax/src/attribute_ext.rs:210\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_html_syntax/src/attribute_ext.rs:209\u0060 calls \u0060and_then\u0060, \u0060arg\u0060 and \u0060crates/biome_html_syntax/src/attribute_ext.rs:420\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/biome_html_syntax/src/attribute_ext.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c1ceb6375a533b08c8d3ffdf5f771bf2fd4cf87c993481c050583b0608407f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_html_syntax/src/attribute_ext.rs:219-224 | crates/biome_html_syntax/src/attribute_ext.rs:430-435 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_html_syntax/src/attribute_ext.rs:219\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_html_syntax/src/attribute_ext.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"a39acaf67498549b36b3e1a252dbdc0b94679c481336c9609266770b37f5dbfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_html_syntax/src/attribute_ext.rs:215-220 | crates/biome_html_syntax/src/attribute_ext.rs:464-469 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_syntax/src/attribute_ext.rs:215\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_html_syntax/src/attribute_ext.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"40351de8ffa37a870017bda54ce6c02fe5007607dfa52f83a792795f5c2bb5ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_html_syntax/src/attribute_ext.rs:265-270 | crates/biome_html_syntax/src/attribute_ext.rs:426-431 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_html_syntax/src/attribute_ext.rs:265\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_html_syntax/src/attribute_ext.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"851a9ebf7273c013372e0d9188cda9bb0199ac9061be5490fe6bc673d9c2abcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_js_analyze/src/ast_utils.rs:41-46 | crates/biome_js_analyze/src/ast_utils.rs:61-66 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_js_analyze/src/ast_utils.rs:41\u0060 it begins part-way through the construct above it, so those exact 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/biome_js_analyze/src/ast_utils.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"95bc54d11dcfd797bdfc499f768f8f47325ce2af1f3ceeb6909e2a4d96993763"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_js_analyze/src/frameworks/mod.rs:114-120 | crates/biome_js_analyze/src/react.rs:302-308 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/frameworks/mod.rs:114\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_js_analyze/src/frameworks/mod.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc4895dde81181f266ca8da2d1d30f9fc266b6805ca6fa59f93123edd9c8b84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_js_analyze/src/frameworks/playwright.rs:423-429 | crates/biome_js_analyze/src/frameworks/playwright.rs:445-451 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/frameworks/playwright.rs:423\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060value\u0060 to \u0060bool\u0060 in one and \u0060\u0026str\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/biome_js_analyze/src/frameworks/playwright.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb47c8bb1c54038ffdd6b748afaa96b870452be9b3381b8f967158715efe92a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_js_analyze/src/lint/complexity/use_regex_literals.rs:131-136 | crates/biome_js_analyze/src/lint/nursery/no_null.rs:146-152 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/complexity/use_regex_literals.rs:131\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/complexity/use_regex_literals.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd441e5046e9ffcb7392ae53cb77ee4d4704dd3b1dc8e0bcc7433ece06fcdc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_js_analyze/src/lint/correctness/no_playwright_missing_await.rs:250-255 | crates/biome_js_analyze/src/lint/correctness/no_playwright_missing_await.rs:281-288 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/no_playwright_missing_await.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d357722726ff94d1c7310a1a23751baff1f31e1862b16b945afae8eafeaa3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_js_analyze/src/lint/correctness/use_is_nan.rs:189-195 | crates/biome_js_analyze/src/lint/suspicious/use_is_array.rs:106-111 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/correctness/use_is_nan.rs:189\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/biome_js_analyze/src/lint/correctness/use_is_nan.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"160475e0aac72d23489a1b22e954965fbdf09e41a4e72a05adc61a2b246d47b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/no_array_sort_for_min_max.rs:379-385 | crates/biome_js_analyze/src/lint/nursery/use_string_starts_ends_with.rs:1084-1089 \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/biome_js_analyze/src/lint/nursery/no_array_sort_for_min_max.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ab9b62f5060acbe879f75921bd1943c08122cf5565867c1dcb00a8f3dc15de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/no_await_in_promise_methods.rs:134-139 | crates/biome_js_analyze/src/lint/nursery/no_useless_date_get_time.rs:141-146 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/nursery/no_await_in_promise_methods.rs:134\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_await_in_promise_methods.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c40e5e1754f5dc8161a8d3e3fc753958e3c81da5ceb7be69c1cb42bb5329e4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/use_iterator_zip.rs:687-692 | crates/biome_js_analyze/src/utils/indexed_collection.rs:61-66 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/nursery/use_iterator_zip.rs:687\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/nursery/use_iterator_zip.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"281ff69a62cbfdd58feaf2665cc3b38ebe332f0c8fa0a08b139313c909f7f391"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/use_react_function_component_definition.rs:587-592 | crates/biome_js_analyze/src/lint/style/use_consistent_arrow_return.rs:181-189 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_react_function_component_definition.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ffdfaf5ee76fdd18fb0a2a1645e93aeeeb7d9d552d86725d4aa1c4284f6247c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_js_analyze/src/lint/style/use_naming_convention.rs:1123-1128 | crates/biome_js_analyze/src/lint/style/use_naming_convention.rs:1239-1244 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_js_analyze/src/lint/style/use_naming_convention.rs:1123\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/style/use_naming_convention.rs"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a190895cbbe6d1fc99e89c2a656055f2ef2d1e1d1da989175508c50d737731e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_js_analyze/src/lint/suspicious/no_loop_func.rs:206-211 | crates/biome_js_analyze/src/react/hooks.rs:56-61 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/suspicious/no_loop_func.rs:206\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060closure\u0060 to \u0060\u0026biome_js_semantic::Closure\u0060 in one and \u0060\u0026Closure\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/biome_js_analyze/src/lint/suspicious/no_loop_func.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"de18fa37dfdf6b9016e806cd12ee90f6e8cabb9e6957de56528fcb04a5d203cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_js_type_info/src/local_inference.rs:337-342 | crates/biome_js_type_info/src/local_inference.rs:1017-1022 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_type_info/src/local_inference.rs:337\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060decl\u0060 to \u0060\u0026AnyJsExportDefaultDeclaration\u0060 in one and \u0060\u0026JsClassExpression\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_js_type_info/src/local_inference.rs:336\u0060 calls \u0060JsClassExportDefaultDeclaration\u0060 and \u0060crates/biome_js_type_info/src/local_inference.rs:1016\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/biome_js_type_info/src/local_inference.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a62bdf60ca997df15db50561b70e1f7c9fc2c006c7cc1525e4fbe20f40a7f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_js_type_info/src/return_type_relation.rs:577-582 | crates/biome_js_type_info/src/return_type_relation.rs:584-589 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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/biome_js_type_info/src/return_type_relation.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"d01f4785222bd7ed0237bcaf87cc15c639104a05fb98774a7da5f7bbb0d96a6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_markdown_parser/src/syntax/list.rs:312-317 | crates/biome_markdown_parser/src/syntax/list.rs:3396-3402 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_markdown_parser/src/syntax/list.rs:312\u0060 it begins part-way through the construct above it, so those exact 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/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"6755c85463edb978b8852d03af0345b80f5f82d272790cd7041d7735fde83762"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_module_graph/src/db/type_inference/expressions.rs:2195-2200 | crates/biome_module_graph/src/db/type_inference/expressions.rs:2335-2340 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_module_graph/src/db/type_inference/expressions.rs:2195\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":2195}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca32ce984b8a97e5012c88d063a8a0f05594e27e3864bb2c19aaed14d7ff46f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_project_layout/src/project_layout.rs:121-126 | crates/biome_project_layout/src/project_layout.rs:478-483 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_project_layout/src/project_layout.rs:121\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_project_layout/src/project_layout.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b8367277c0fc46b7538532e25fe55eca93cf0aca5d671e3e770461c88ff818"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_rowan/src/cursor.rs:237-243 | crates/biome_rowan/src/cursor.rs:247-253 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_rowan/src/cursor.rs:237\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/biome_rowan/src/cursor.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b589f4cd1a045e7bcb3acbbffc1ff122876e3e9d05978c76a76dee783bc2cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_service/src/file_handlers/html/go_to.rs:52-59 | crates/biome_service/src/file_handlers/javascript/go_to.rs:323-328 \u2014 \u0060crates/biome_service/src/file_handlers/html/go_to.rs\u0060 and \u0060crates/biome_service/src/file_handlers/javascript/go_to.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 42 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_service/src/file_handlers/html/go_to.rs:52\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/html/go_to.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad0e08b5e628f64662f2e2e063a91b13a69705789c07d5eb585dfb692839857"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_service/src/file_handlers/mod.rs:790-795 | crates/biome_service/src/file_handlers/mod.rs:808-813 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_service/src/file_handlers/mod.rs:790\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_service/src/file_handlers/mod.rs"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"a63da60c40951fe142bdd3c82e7451b636657536cd676d6cf360e809d8083ed9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_service/src/settings.rs:2616-2621 | crates/biome_service/src/settings.rs:2643-2648 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060parent_settings\u0060 to \u0060\u0026LanguageSettings\u003CJsonLanguage\u003E\u0060 in one and \u0060\u0026LanguageSettings\u003CCssLanguage\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/settings.rs"},"region":{"startLine":2616}}}],"partialFingerprints":{"codehealthFindingId/v1":"677758887b3a42a19ddd26f42146f08d76daa189ce12eb9a783f21da1baada1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_yaml_parser/src/lexer/mod.rs:913-918 | crates/biome_yaml_parser/src/lexer/mod.rs:936-941 \u2014 both copies are in the same file, so extract the block into one function there 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/biome_yaml_parser/src/lexer/mod.rs"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"5255c89a3a291f649d9481956bcfff3688c0e56d473b9e3b11a1ec39912ecb72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): xtask/codegen/src/generate_global_types/lower/generic.rs:781-786 | xtask/codegen/src/generate_global_types/lower/generic.rs:798-803 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060xtask/codegen/src/generate_global_types/lower/generic.rs:781\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/generate_global_types/lower/generic.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ac1bf016506b8a7613381b3be91de9f0961d9153e70457c6ff94c9e596a174"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20136 lines \u00D7 2): xtask/codegen/src/generate_migrate_eslint.rs:47-52 | xtask/codegen/src/generate_migrate_eslint.rs:55-59 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060xtask/codegen/src/generate_migrate_eslint.rs:47\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":"xtask/codegen/src/generate_migrate_eslint.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a872024824aa4ebe01cec4a14e8f36bb916d3d0d1e3213c0f1b51ac246fc29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 7): crates/biome_js_analyze/src/lint/style/no_playwright_element_handle.rs:71-77 | crates/biome_js_analyze/src/lint/style/no_playwright_eval.rs:56-62 | crates/biome_js_analyze/src/lint/style/no_playwright_wait_for_selector.rs:68-73 | crates/biome_js_analyze/src/lint/suspicious/no_playwright_networkidle.rs:59-63 | crates/biome_js_analyze/src/lint/suspicious/no_playwright_page_pause.rs:61-68 | crates/biome_js_analyze/src/lint/suspicious/no_playwright_wait_for_navigation.rs:63-68 | crates/biome_js_analyze/src/lint/suspicious/no_playwright_wait_for_timeout.rs:63-68 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 7 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 7 times. 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/biome_js_analyze/src/lint/style/no_playwright_element_handle.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe261bf85d645e1572bdb567a31ab3635e74836e48cbff6d7e487fe28b502f61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 7): crates/biome_js_type_info/src/format_inferred_type_info.rs:1090-1094 | crates/biome_js_type_info/src/format_inferred_type_info.rs:1111-1115 | crates/biome_js_type_info/src/format_inferred_type_info.rs:1180-1184 | crates/biome_js_type_info/src/format_inferred_type_info.rs:1202-1206 | crates/biome_js_type_info/src/format_type_info.rs:1058-1062 | crates/biome_js_type_info/src/format_type_info.rs:1077-1081 | crates/biome_js_type_info/src/format_type_info.rs:1099-1103 \u2014 before extracting anything, compare \u0060crates/biome_js_type_info/src/format_inferred_type_info.rs\u0060 and \u0060crates/biome_js_type_info/src/format_type_info.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 242 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_type_info/src/format_inferred_type_info.rs:1090\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060\u0026mut Formatter\u003CFormatInferredTypeContext\u003C\u0027db\u003E\u003E\u0060 in one and \u0060\u0026mut Formatter\u003CFormatTypeContext\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_js_type_info/src/format_inferred_type_info.rs:1089\u0060 calls \u0060token\u0060 and \u0060crates/biome_js_type_info/src/format_inferred_type_info.rs:1201\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/format_inferred_type_info.rs"},"region":{"startLine":1090}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a02d9b591085c784e6c6a3ec8acb082e4367b7b56f95b996e7572db69e0488"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): crates/biome_js_analyze/src/lint/complexity/use_optional_chain.rs:320-324 | crates/biome_js_analyze/src/lint/complexity/use_regex_literals.rs:132-137 | crates/biome_js_analyze/src/lint/nursery/no_null.rs:148-153 | crates/biome_js_analyze/src/lint/nursery/no_useless_fallback_in_spread.rs:116-121 | crates/biome_js_analyze/src/lint/nursery/use_flat_math_min_max.rs:131-136 | crates/biome_js_analyze/src/lint/style/use_trim_start_end.rs:233-238 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 6 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 6 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/complexity/use_optional_chain.rs:320\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/complexity/use_optional_chain.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1c634a4c9913a0634dc1dedc21ed7b5d47aeee7c66aaba3a0f955bba957dfe1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): crates/biome_js_analyze/src/lint/a11y/no_distracting_elements.rs:94-99 | crates/biome_js_analyze/src/lint/a11y/no_header_scope.rs:99-104 | crates/biome_js_analyze/src/lint/a11y/no_interactive_element_to_noninteractive_role.rs:146-150 | crates/biome_js_analyze/src/lint/a11y/no_noninteractive_element_to_interactive_role.rs:136-140 | crates/biome_js_analyze/src/lint/a11y/no_noninteractive_tabindex.rs:138-143 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 5 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/a11y/no_distracting_elements.rs:94\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/a11y/no_distracting_elements.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e168b796f51d1af2e8a0ffd1b999ac716b982dce01f0c80dfbe386f60bcd106"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): crates/biome_analyze/src/profiling.rs:534-538 | crates/biome_analyze/src/profiling.rs:541-545 | crates/biome_analyze/src/profiling.rs:548-552 | crates/biome_analyze/src/profiling.rs:555-559 | crates/biome_analyze/src/profiling.rs:561-566 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_analyze/src/profiling.rs:534\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_analyze/src/profiling.rs:534\u0060 calls \u0060write_markup\u0060 and \u0060crates/biome_analyze/src/profiling.rs:561\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_analyze/src/profiling.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"a71be7254202572cb293ab11b8b58e7445ef426d12054918bb51a769beb388fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 5): crates/biome_graphql_analyze/src/lint/correctness/no_duplicate_argument_names.rs:52-56 | crates/biome_graphql_analyze/src/lint/correctness/no_duplicate_field_definition_names.rs:144-148 | crates/biome_graphql_analyze/src/lint/correctness/no_duplicate_field_definition_names.rs:152-156 | crates/biome_graphql_analyze/src/lint/correctness/no_duplicate_input_field_names.rs:52-56 | crates/biome_graphql_analyze/src/lint/suspicious/no_duplicate_fields.rs:213-215 \u2014 there are 5 copies across 4 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_graphql_analyze/src/lint/correctness/no_duplicate_argument_names.rs:52\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_graphql_analyze/src/lint/correctness/no_duplicate_argument_names.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb12447ce32efec035bb58b2b03aeaa0befd9b229ead3938f91804cc188a3d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/biome_js_analyze/src/lint/complexity/no_adjacent_spaces_in_regex.rs:194-198 | crates/biome_js_analyze/src/lint/complexity/no_useless_escape_in_regex.rs:301-305 | crates/biome_js_analyze/src/lint/nursery/use_vue_base_import.rs:101-106 | crates/biome_js_analyze/src/lint/suspicious/no_misleading_character_class.rs:157-161 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/complexity/no_adjacent_spaces_in_regex.rs:194\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/complexity/no_adjacent_spaces_in_regex.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e8bcbc34a23458e1c6e4c498fda508de34bf7083f3276a5db0113ce5848fad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/biome_js_analyze/src/lint/complexity/no_useless_lone_block_statements.rs:136-141 | crates/biome_js_analyze/src/lint/complexity/no_useless_undefined_initialization.rs:212-217 | crates/biome_js_analyze/src/lint/nursery/no_useless_await.rs:171-175 | crates/biome_js_analyze/src/lint/nursery/use_unary_minus.rs:148-153 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/complexity/no_useless_lone_block_statements.rs:136\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/complexity/no_useless_lone_block_statements.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"06794925097dcfd9c3265e4ea6130f88e60fc5ae65efdf1bd9f99a5f89fb83b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/biome_cli/src/execute/migrate/eslint_to_biome.rs:1070-1074 | crates/biome_cli/src/execute/migrate/eslint_to_biome.rs:1177-1181 | crates/biome_cli/src/execute/migrate/eslint_to_biome.rs:1257-1262 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_cli/src/execute/migrate/eslint_to_biome.rs:1070\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_cli/src/execute/migrate/eslint_to_biome.rs"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d59953b0f8114086183d317cd1aa7f1a9381cd7c99ba24e99023c1500b1b92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/biome_cli/src/execute/migrate/eslint_to_biome.rs:1128-1132 | crates/biome_cli/src/execute/migrate/eslint_to_biome.rs:1145-1149 | crates/biome_cli/src/execute/migrate/eslint_to_biome.rs:1161-1165 \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/biome_cli/src/execute/migrate/eslint_to_biome.rs:1128\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_cli/src/execute/migrate/eslint_to_biome.rs"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"8325a84434e56acab14e121f4522ee179e13c9fa0f37d1c59159f4fe7f95db94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/biome_configuration_macros/src/visitors.rs:52-56 | xtask/codegen/src/generate_configuration.rs:42-48 | xtask/codegen/src/generate_configuration.rs:125-131 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_configuration_macros/src/visitors.rs:52\u0060 it begins part-way through the construct above it, so those exact 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/biome_configuration_macros/src/visitors.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff6e7c06aeb01c2fe348d5a1b4948a2aca81f0814eb60dbf5cbdbe369dfbbbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/biome_html_analyze/src/lint/nursery/no_undeclared_custom_properties.rs:139-144 | crates/biome_js_analyze/src/lint/nursery/no_undeclared_custom_properties.rs:119-123 | crates/biome_service/src/file_handlers/javascript.rs:799-803 \u2014 before extracting anything, compare \u0060crates/biome_html_analyze/src/lint/nursery/no_undeclared_custom_properties.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/nursery/no_undeclared_custom_properties.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_analyze/src/lint/nursery/no_undeclared_custom_properties.rs:139\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_html_analyze/src/lint/nursery/no_undeclared_custom_properties.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0720387bb26c61adf5b50b0320c5f11145267bd23f93229d48c7215d3e5719d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/biome_js_analyze/src/lint/nursery/no_new_array.rs:88-93 | crates/biome_js_analyze/src/lint/nursery/no_uninvoked_array_callback.rs:104-109 | crates/biome_js_analyze/src/lint/style/use_array_literals.rs:78-83 \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. 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/biome_js_analyze/src/lint/nursery/no_new_array.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4954f732c2ecf3348d57ec69881606523a4cc9eb8a17508a8e1511fc4b9c9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/biome_js_analyze/src/lint/nursery/no_undeclared_classes.rs:244-249 | crates/biome_js_analyze/src/lint/nursery/no_undeclared_classes.rs:356-360 | crates/biome_js_analyze/src/lint/nursery/no_undeclared_classes.rs:476-481 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_undeclared_classes.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd2c0af82247afc6f377e8bc331ab1546a352fc163e99246cf40fae5c5491e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/biome_js_formatter/src/js/auxiliary/default_clause.rs:32-36 | crates/biome_yaml_formatter/src/yaml/auxiliary/folded_scalar.rs:16-21 | crates/biome_yaml_formatter/src/yaml/auxiliary/literal_scalar.rs:16-21 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060\u0026mut JsFormatter\u0060 in one and \u0060\u0026mut YamlFormatter\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/biome_js_formatter/src/js/auxiliary/default_clause.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"849b3fa68e8f4e51725d806f0127114c0f080febc701329c30e9c732f9fc497d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/biome_module_graph/src/js_module_info/flow/builder.rs:430-434 | crates/biome_module_graph/src/js_module_info/flow/builder.rs:448-452 | crates/biome_module_graph/src/js_module_info/flow/builder.rs:492-496 \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/biome_module_graph/src/js_module_info/flow/builder.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e4051df5df781feaa7560d00836f43423eaa0c3963b4e0fc162aba7dba1158f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/biome_syntax_codegen/src/generate_node_factory.rs:145-149 | crates/biome_syntax_codegen/src/generate_nodes.rs:711-715 | xtask/codegen/src/generate_node_factory.rs:138-142 \u2014 before extracting anything, compare \u0060crates/biome_syntax_codegen/src/generate_node_factory.rs\u0060 and \u0060xtask/codegen/src/generate_node_factory.rs\u0060 as WHOLE FILES: 92% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_syntax_codegen/src/generate_node_factory.rs:145\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_syntax_codegen/src/generate_node_factory.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee11442d7b75ba03fccda0a652e47b40125665758682f922b04d71440e70e25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_analyze/src/categories.rs:342-348 | crates/biome_analyze/src/categories.rs:353-359 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060input\u0060 to \u0060RuleCategory\u0060 in one and \u0060\u0026RuleCategory\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/biome_analyze/src/categories.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"11efa965d07abfa3752227d55cf4454a49b955e056681d5a51014a6af011c7ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/biome_cli/src/execute/migrate/eslint_to_biome.rs:795-799 | crates/biome_cli/src/execute/migrate/eslint_to_biome.rs:1309-1313 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_cli/src/execute/migrate/eslint_to_biome.rs:795\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_cli/src/execute/migrate/eslint_to_biome.rs"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75d9efbaf779ed8032712ddbf717085815332f715ee3b365d0f39e1c55b277d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/biome_configuration/src/overrides.rs:261-267 | crates/biome_configuration/src/overrides.rs:341-348 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_configuration/src/overrides.rs:261\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_configuration/src/overrides.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd08498a70358c587db3151cc3c9bbe0088d922893901818b64a6df6ed9dd69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/biome_deserialize/src/json.rs:332-336 | crates/biome_js_syntax/src/unescape.rs:108-112 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_deserialize/src/json.rs:332\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_deserialize/src/json.rs:329\u0060 calls \u0060EscapedUnicode\u0060 and \u0060crates/biome_js_syntax/src/unescape.rs:105\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/biome_deserialize/src/json.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac900d7f6b07160457a7488decdcfe46c76643229c6e8cd69ebbedabeb6cb59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_graphql_analyze/src/assist/source/use_graphql_sorted_variables.rs:255-261 | crates/biome_graphql_analyze/src/utils.rs:52-58 \u2014 before extracting anything, compare \u0060crates/biome_graphql_analyze/src/assist/source/use_graphql_sorted_variables.rs\u0060 and \u0060crates/biome_graphql_analyze/src/utils.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_graphql_analyze/src/assist/source/use_graphql_sorted_variables.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ba363b78b5cc4deeeb84772da4e06ca213d223826887dcb9b1e98cfe13cd0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_grit_patterns/src/grit_query.rs:753-758 | crates/biome_grit_patterns/src/grit_query.rs:760-765 \u2014 both copies are in the same file, so extract the block 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/biome_grit_patterns/src/grit_query.rs"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"85af8aff9a1d233ad50c64cb1e9cc76016b83883adc35a07c0686552ac847e63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/biome_html_analyze/src/lint/nursery/no_astro_set_html_directive.rs:54-59 | crates/biome_html_analyze/src/lint/nursery/use_astro_client_only_directive_value.rs:57-61 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/nursery/no_astro_set_html_directive.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb33d198d9cf2dc80c471161e50154fcd81012ac97e9e377a3e717f81063665e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/biome_html_analyze/src/lint/nursery/use_tailwind_shorthand_classes.rs:138-142 | crates/biome_js_analyze/src/lint/nursery/use_tailwind_shorthand_classes.rs:140-145 \u2014 before extracting anything, compare \u0060crates/biome_html_analyze/src/lint/nursery/use_tailwind_shorthand_classes.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/nursery/use_tailwind_shorthand_classes.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/nursery/use_tailwind_shorthand_classes.rs:140\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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/biome_html_analyze/src/lint/nursery/use_tailwind_shorthand_classes.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac4c0626268e4704f11bd36d0ff2d034449b4808a4f9666049e5d66c75134da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/biome_js_analyze/src/lint/complexity/no_implicit_coercions.rs:404-408 | crates/biome_js_analyze/src/lint/nursery/use_modern_math_apis.rs:131-136 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/complexity/no_implicit_coercions.rs:404\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/complexity/no_implicit_coercions.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"243c2991dd846199f1cd0aa345fc811af62c5b2131a9c3641202d551266311b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/biome_js_analyze/src/lint/complexity/use_array_find.rs:62-66 | crates/biome_js_analyze/src/lint/correctness/no_playwright_missing_await.rs:251-256 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/complexity/use_array_find.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"b64d51afce89eb977a7c5aef3f9be5b6b9e549f52bec975d3743652a6ce340b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/biome_js_analyze/src/lint/complexity/use_math_min_max.rs:895-899 | crates/biome_js_analyze/src/lint/complexity/use_math_min_max.rs:906-911 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/complexity/use_math_min_max.rs"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"587fced2115295dbb2b4aca8f7d24764a5f10a55a8e4d29a8253a782f58ee198"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/biome_js_analyze/src/lint/correctness/use_qwik_method_usage.rs:175-179 | crates/biome_js_analyze/src/lint/suspicious/no_parameters_only_used_in_recursion.rs:224-228 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/correctness/use_qwik_method_usage.rs:175\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/use_qwik_method_usage.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"674e13e049d2bbe335330ea09935c5ea6d61ae14dfeb178f24fc28f739c13b81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/no_floating_promises.rs:377-381 | crates/biome_js_analyze/src/lint/suspicious/use_array_sort_compare.rs:62-67 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_floating_promises.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"56928ee9a6b2e2a68554f864690aee3c7e76224da60c9ad69061c3564d518b32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/no_object_constructor.rs:149-153 | crates/biome_js_analyze/src/lint/nursery/no_zero_fractions.rs:266-270 \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/biome_js_analyze/src/lint/nursery/no_object_constructor.rs:149\u0060 it does not close everything it opens, so those exact 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/biome_js_analyze/src/lint/nursery/no_object_constructor.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe0ee2ea33fc62a60869a9f3482eb95ed5d39cafbefb4d8e0c6b94cd790c511"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/no_unsafe_return.rs:291-295 | crates/biome_js_analyze/src/lint/nursery/no_unsafe_return.rs:300-304 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_js_analyze/src/lint/nursery/no_unsafe_return.rs:291\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/nursery/no_unsafe_return.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"e623b7845ab7a7d06ac4ae910cc6ddfc47b0942b381d43f46211cfdae9332be7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/use_string_starts_ends_with.rs:797-804 | crates/biome_js_analyze/src/lint/nursery/use_string_starts_ends_with.rs:1010-1017 \u2014 both copies are in the same file, so extract the block into one function there 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/biome_js_analyze/src/lint/nursery/use_string_starts_ends_with.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd1ad88bd6444d9daf3b5552c6af5cab6ef0c14ef70db3525139810bdf85220"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 4): crates/biome_js_analyze/src/lint/nursery/no_console_spaces.rs:127-130 | crates/biome_js_analyze/src/lint/nursery/use_vue_matching_component_file_name.rs:206-210 | crates/biome_js_analyze/src/lint/style/use_numeric_separators.rs:231-234 | crates/biome_js_analyze/src/lint/suspicious/no_octal_escape.rs:117-121 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/nursery/no_console_spaces.rs:127\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/nursery/no_console_spaces.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"903665d98167e00a681d967f7e18a972b203a47fcab0f96a54837057984e0fdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/biome_js_analyze/src/lint/style/use_shorthand_assign.rs:156-160 | crates/biome_js_analyze/src/lint/suspicious/no_misrefactored_shorthand_assign.rs:142-146 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/style/use_shorthand_assign.rs:156\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_shorthand_assign.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbde2e61324fbcaa4113d34634c7e0a31d9b23cab017e7d8cfea7a2072c94fab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/biome_js_analyze/src/lint/suspicious/no_parameters_only_used_in_recursion.rs:235-239 | crates/biome_js_analyze/src/lint/suspicious/no_parameters_only_used_in_recursion.rs:241-245 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/suspicious/no_parameters_only_used_in_recursion.rs:235\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/no_parameters_only_used_in_recursion.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"a61af0e6b4ec963d980a9bab01e57af7cf39d3d0e36ebd7a3449e20325e690bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/biome_js_formatter/src/js/module/export_from_clause.rs:28-32 | crates/biome_js_formatter/src/ts/declarations/import_equals_declaration.rs:26-34 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_formatter/src/ts/declarations/import_equals_declaration.rs:26\u0060 it does not close everything it opens, so those exact 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/biome_js_formatter/src/js/module/export_from_clause.rs:24\u0060 calls \u0060Some\u0060, \u0060format\u0060, \u0060space\u0060 and \u0060crates/biome_js_formatter/src/ts/declarations/import_equals_declaration.rs:24\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/biome_js_formatter/src/js/module/export_from_clause.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"2441374ed1e64115a8b59e80523d179925f42757ca2ca37fc76c673f774f51ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/biome_js_formatter/src/js/module/export_named_from_specifier.rs:23-28 | crates/biome_js_formatter/src/ts/bindings/type_parameter.rs:19-23 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_formatter/src/js/module/export_named_from_specifier.rs:23\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/js/module/export_named_from_specifier.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"db9f5f9806d25fa49eab520edf7120fad77eeee6a5616e8ef8885e89995de639"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_js_type_info/src/format_inferred_type_info.rs:204-211 | crates/biome_js_type_info/src/format_type_info.rs:132-139 \u2014 before extracting anything, compare \u0060crates/biome_js_type_info/src/format_inferred_type_info.rs\u0060 and \u0060crates/biome_js_type_info/src/format_type_info.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 242 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_type_info/src/format_inferred_type_info.rs:204\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/biome_js_type_info/src/format_inferred_type_info.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9ab709f06c2bf55ead9e5cd029b7a58664846ff4468555a0056a7392c0e2a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/biome_markdown_formatter/src/markdown/lists/block_list.rs:146-152 | crates/biome_markdown_formatter/src/quote.rs:245-249 \u2014 before extracting anything, compare \u0060crates/biome_markdown_formatter/src/markdown/lists/block_list.rs\u0060 and \u0060crates/biome_markdown_formatter/src/quote.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_markdown_formatter/src/markdown/lists/block_list.rs:146\u0060 it does not close everything it opens, so those exact 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/biome_markdown_formatter/src/markdown/lists/block_list.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"847c11dba8f6a21b2a5060e510bcd2cd11444f5a7d1ee30a24fafa4a4fc4e471"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/biome_migrate/src/analyzers/includes.rs:31-39 | crates/biome_migrate/src/analyzers/organize_imports.rs:29-33 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_migrate/src/analyzers/includes.rs:31\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_migrate/src/analyzers/includes.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"8450e513ec50b583034727218544a55717960b952672a4d8f3fe4bec19c867c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/biome_module_graph/src/db/type_inference/imports.rs:146-150 | crates/biome_module_graph/src/db/type_inference/imports.rs:926-930 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_module_graph/src/db/type_inference/imports.rs:146\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_module_graph/src/db/type_inference/imports.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"130662df841626701c8279ebf0b9cd4e0416ec12da3c2c5f8c18185e98a90631"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/biome_module_graph/src/type_inference/profiling/display/verbose.rs:249-253 | crates/biome_module_graph/src/type_inference/profiling/display/verbose.rs:302-306 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_module_graph/src/type_inference/profiling/display/verbose.rs:249\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/biome_module_graph/src/type_inference/profiling/display/verbose.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe91d2aae8ac05cb673071b1546223cd06e14eac2079dd2c2eb832a158b8c4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/biome_rowan/src/syntax/token.rs:296-300 | crates/biome_rowan/src/syntax/token.rs:327-331 \u2014 both copies are in the same file, so extract the block into one function there 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/biome_rowan/src/syntax/token.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d2d70cc564733e8b2c5bfed3020b89b37fc95d869ff27d0c71fdcedcb294cc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/biome_service/src/file_handlers/html/parse_embedded_nodes.rs:136-140 | crates/biome_service/src/file_handlers/html/parse_embedded_nodes.rs:442-451 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_service/src/file_handlers/html/parse_embedded_nodes.rs:442\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/html/parse_embedded_nodes.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6911594165421c7d0b9f8bb67db710b11c7a0b82092cc565e9999e56f03fd1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (45 lines \u00D7 2): crates/biome_configuration/src/css.rs:163-215 | crates/biome_configuration/src/graphql.rs:115-159 \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/biome_configuration/src/css.rs:163\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/biome_configuration/src/css.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"be04bffde667a034464280976c6a2132ed1b07e609666609f49ae8c92cb1e0ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 7): crates/biome_css_formatter/src/css/auxiliary/declaration_block.rs:10-24 | crates/biome_css_formatter/src/css/auxiliary/declaration_or_at_rule_block.rs:14-28 | crates/biome_css_formatter/src/css/auxiliary/declaration_or_rule_block.rs:14-28 | crates/biome_css_formatter/src/css/auxiliary/font_feature_values_block.rs:14-28 | crates/biome_css_formatter/src/css/auxiliary/keyframes_block.rs:10-24 | crates/biome_css_formatter/src/css/auxiliary/page_at_rule_block.rs:10-24 | crates/biome_css_formatter/src/css/auxiliary/rule_block.rs:10-20 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 7 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_formatter/src/css/auxiliary/declaration_or_at_rule_block.rs:14\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026CssDeclarationBlock\u0060 in one and \u0060\u0026CssDeclarationOrAtRuleBlock\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/biome_css_formatter/src/css/auxiliary/declaration_block.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd9ac637a07bc5d9d9fe2b9e4f216479cbfc87e7f6d9a3d1d47e467356b61e2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/biome_html_analyze/src/lint/nursery/no_tailwind_arbitrary_value.rs:120-142 | crates/biome_js_analyze/src/lint/nursery/no_tailwind_arbitrary_value.rs:119-141 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/nursery/no_tailwind_arbitrary_value.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f00023e6a12387c681c2396d672a2fd1f3890b8f344226b94b37ce465bd9c7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (50 lines \u00D7 2): crates/biome_html_analyze/src/services/aria.rs:16-65 | crates/biome_js_analyze/src/services/aria.rs:16-66 \u2014 before extracting anything, compare \u0060crates/biome_html_analyze/src/services/aria.rs\u0060 and \u0060crates/biome_js_analyze/src/services/aria.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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_analyze/src/services/aria.rs:16\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/services/aria.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b0e95a7acb36cbdc28122a5ebb44ef8867690ff5f20d56845ea3a249dfb85e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_rule_options/src/no_unknown_attribute.rs:14-24 | crates/biome_rule_options/src/no_vue_undeclared_properties.rs:17-30 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_rule_options/src/no_unknown_attribute.rs:14\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/biome_rule_options/src/no_unknown_attribute.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"aacb1e06d509dbda796ee4dcc2ed97bc8015d469fb1f5ad07504129334223c5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_cli/src/commands/check.rs:102-107 | crates/biome_cli/src/commands/ci.rs:79-84 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/commands/check.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91751197aefda8a7fcc72ac7c1f352e16480d0bd5efad4e043ec61a7cb90856"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/biome_cli/src/commands/check.rs:322-333 | crates/biome_cli/src/commands/format.rs:244-254 | crates/biome_cli/src/commands/lint.rs:333-344 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_cli/src/commands/check.rs:322\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_cli/src/commands/check.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0462f11abb07f45ee6d64544eec4b4cbd1a6f1d654a17b0a513e8cb5351ac79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/biome_cli/src/commands/check.rs:335-355 | crates/biome_cli/src/commands/format.rs:256-276 \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/biome_cli/src/commands/check.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"57fb00912d73ee09875bbca22b2029987af243ce03fe472ae9c2b8273f7a8f50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_cli/src/commands/inspect.rs:26-32 | crates/biome_service/src/configuration.rs:69-75 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/commands/inspect.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e46350698f7fff8b63b3feb834a78f547e98251fb9e1b80d6cb4d1f61709767"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/biome_cli/src/execute/migrate/eslint_react.rs:45-51 | crates/biome_cli/src/execute/migrate/eslint_svelte.rs:52-58 | crates/biome_cli/src/execute/migrate/eslint_vue.rs:55-61 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_cli/src/execute/migrate/eslint_react.rs:45\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/execute/migrate/eslint_react.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"1afc773b101da2fba6c46f0db3bd87769e3fd1386f71ab415ae4468ae762bd32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/biome_cli/src/reporter/checkstyle.rs:24-34 | crates/biome_cli/src/reporter/json.rs:244-255 | crates/biome_cli/src/reporter/junit.rs:26-36 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_cli/src/reporter/checkstyle.rs:24\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/reporter/checkstyle.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"16b82e281c42cfea8a01ca143b18bccac9aacfbae398b77065eef51346c5db3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): crates/biome_cli/src/reporter/github.rs:22-31 | crates/biome_cli/src/reporter/gitlab.rs:32-41 | crates/biome_cli/src/reporter/rdjson.rs:24-33 | crates/biome_cli/src/reporter/sarif.rs:30-39 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_cli/src/reporter/github.rs:22\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/reporter/github.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed4299096d70b8eadad8f829463dbef86cfbb885852747d75033cca88ee6cb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_cli/src/reporter/terminal.rs:166-173 | crates/biome_cli/src/runner/impls/executions/summary_verb.rs:23-30 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/reporter/terminal.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"44fdb26601447d1e05299df56344e9ab3af65eef847019e44482ed6295ceb811"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_configuration_macros/src/lib.rs:117-123 | xtask/codegen/src/lib.rs:85-91 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_configuration_macros/src/lib.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"8525b74af56a295ef04c640e19ce4d608db0722022b05a8ef27886dac4bcabbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/biome_css_analyze/src/lint/suspicious/no_empty_source.rs:94-108 | crates/biome_graphql_analyze/src/lint/suspicious/no_empty_source.rs:95-109 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_analyze/src/lint/suspicious/no_empty_source.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ace83487d3325925dc06070ef71ef220f2b6b48d3d7447171168cf98513a91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_css_analyze/src/lint/suspicious/no_irregular_whitespace.rs:76-82 | crates/biome_js_analyze/src/lint/suspicious/no_irregular_whitespace.rs:79-94 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/biome_js_analyze/src/lint/suspicious/no_irregular_whitespace.rs:102\u0060 calls \u0060is_irregular_whitespace_lead_byte\u0060 and \u0060crates/biome_css_analyze/src/lint/suspicious/no_irregular_whitespace.rs:84\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/biome_css_analyze/src/lint/suspicious/no_irregular_whitespace.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8547403143a7a0e1e79415798224db9113f5d010e9e03fe6c34a8a3ec553069"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_css_analyze/src/services/semantic.rs:35-43 | crates/biome_js_analyze/src/services/semantic.rs:35-42 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_analyze/src/services/semantic.rs:35\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_css_analyze/src/services/semantic.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"5038128b1b1e66473060e09cd9ce803a07b1c31aa843c39f9f1c369ac2c10f32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_css_formatter/src/comments.rs:91-97 | crates/biome_js_formatter/src/comments.rs:79-85 \u2014 before extracting anything, compare \u0060crates/biome_css_formatter/src/comments.rs\u0060 and \u0060crates/biome_js_formatter/src/comments.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_formatter/src/comments.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"c772f55c2193a432945251a5f111f407568ea5454c795708f2415acb09de76b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/biome_css_formatter/src/comments.rs:103-113 | crates/biome_js_formatter/src/comments.rs:91-101 | crates/biome_json_formatter/src/comments.rs:66-76 \u2014 before extracting anything, compare \u0060crates/biome_css_formatter/src/comments.rs\u0060 and \u0060crates/biome_js_formatter/src/comments.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060comment\u0060 to \u0060\u0026SyntaxTriviaPieceComments\u003CSelf::Language\u003E\u0060 in one and \u0060\u0026SyntaxTriviaPieceComments\u003CJsLanguage\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_formatter/src/comments.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d42dce35966c36697029e9822b545c90cebb277d17429fd5ed357fbb1ad7c2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 3): crates/biome_css_formatter/src/css/lists/compound_selector_list.rs:7-29 | crates/biome_css_formatter/src/css/lists/keyframes_selector_list.rs:7-40 | crates/biome_css_formatter/src/css/lists/page_selector_list.rs:7-29 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026CssCompoundSelectorList\u0060 in one and \u0060\u0026CssKeyframesSelectorList\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/biome_css_formatter/src/css/lists/compound_selector_list.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e56731e7db3eb13fa7070b3743958e87c631a80eb5ab3b2f26250c40e2e334"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 8): crates/biome_css_formatter/src/css/lists/declaration_list.rs:8-21 | crates/biome_css_formatter/src/css/lists/declaration_or_at_rule_list.rs:8-21 | crates/biome_graphql_formatter/src/graphql/lists/definition_list.rs:8-19 | crates/biome_graphql_formatter/src/graphql/lists/enum_value_list.rs:7-18 | crates/biome_graphql_formatter/src/graphql/lists/field_definition_list.rs:7-18 | crates/biome_graphql_formatter/src/graphql/lists/input_field_list.rs:7-18 | crates/biome_graphql_formatter/src/graphql/lists/root_operation_type_definition_list.rs:13-24 | crates/biome_graphql_formatter/src/graphql/lists/selection_list.rs:7-18 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 8 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 8 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_graphql_formatter/src/graphql/lists/root_operation_type_definition_list.rs:13\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026CssDeclarationList\u0060 in one and \u0060\u0026CssDeclarationOrAtRuleList\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/biome_css_formatter/src/css/lists/declaration_list.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"8174afe239aa12451874026ee404ec73985a678db86cf5d06643947335d8ab43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6): crates/biome_css_formatter/src/css/lists/document_matcher_list.rs:7-16 | crates/biome_css_formatter/src/css/lists/font_family_name_list.rs:7-16 | crates/biome_css_formatter/src/css/lists/value_at_rule_import_specifier_list.rs:12-21 | crates/biome_css_formatter/src/css/lists/value_at_rule_property_list.rs:7-16 | crates/biome_html_formatter/src/svelte/lists/binding_list.rs:9-18 | crates/biome_html_formatter/src/vue/lists/v_for_binding_list.rs:9-18 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 6 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 6 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_formatter/src/css/lists/value_at_rule_import_specifier_list.rs:12\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026CssDocumentMatcherList\u0060 in one and \u0060\u0026CssFontFamilyNameList\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/biome_css_formatter/src/css/lists/document_matcher_list.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b6586dbc2cc1c785898cc8a22749aee5b4f50248cf37d4cbc35264a0dccd58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): crates/biome_css_formatter/src/css/lists/font_feature_values_item_list.rs:7-17 | crates/biome_css_formatter/src/css/lists/root_item_list.rs:7-17 | crates/biome_css_formatter/src/css/lists/rule_list.rs:7-17 | crates/biome_js_formatter/src/js/lists/class_member_list.rs:10-18 | crates/biome_js_formatter/src/js/lists/switch_case_list.rs:10-18 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 5 times. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026CssFontFeatureValuesItemList\u0060 in one and \u0060\u0026CssRootItemList\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/biome_css_formatter/src/css/lists/font_feature_values_item_list.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"583466d39e1501fcdeb6360c20202ffacfaec20d3a4f43ebac30d45047931162"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5): crates/biome_css_formatter/src/css/lists/function_parameter_list.rs:11-20 | crates/biome_css_formatter/src/css/lists/layer_reference_list.rs:7-19 | crates/biome_css_formatter/src/scss/lists/each_binding_list.rs:10-19 | crates/biome_css_formatter/src/scss/lists/module_configuration_item_list.rs:14-23 | crates/biome_css_formatter/src/scss/lists/parameter_item_list.rs:11-20 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 5 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_formatter/src/scss/lists/module_configuration_item_list.rs:14\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026CssFunctionParameterList\u0060 in one and \u0060\u0026CssLayerReferenceList\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/biome_css_formatter/src/css/lists/function_parameter_list.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a380305a9a23aa98ba1eae0d0c96ccc9670e16fac79069f18b72067b6e5f6b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_css_formatter/src/css/lists/keyframes_item_list.rs:8-18 | crates/biome_css_formatter/src/css/lists/page_at_rule_item_list.rs:7-17 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026CssKeyframesItemList\u0060 in one and \u0060\u0026CssPageAtRuleItemList\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/biome_css_formatter/src/css/lists/keyframes_item_list.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b91500a1ab7d292b5f0f44e884b52ae20dc84fb1ac71eaa1e9f975f586ef81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_css_formatter/src/css/lists/pseudo_value_list.rs:9-18 | crates/biome_css_formatter/src/scss/lists/module_member_list.rs:11-20 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026CssPseudoValueList\u0060 in one and \u0060\u0026ScssModuleMemberList\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/biome_css_formatter/src/css/lists/pseudo_value_list.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"900948eb5265e2d3c41e615da4c4e4b926dc36c2585baa115840b5db5e9e7af1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_css_formatter/src/scss/lists/import_item_list.rs:55-61 | crates/biome_css_formatter/src/utils/media_query_comments.rs:102-109 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_formatter/src/scss/lists/import_item_list.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"557c5c00321e6ee197e4b2f69b00c77c776de9f7762a6d9f20cbc5c51a4cd2b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/biome_css_formatter/src/scss/lists/interpolated_identifier_part_list.rs:11-17 | crates/biome_css_formatter/src/scss/lists/interpolated_value_part_list.rs:7-13 | crates/biome_css_formatter/src/scss/lists/parent_selector_suffix_part_list.rs:11-17 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_formatter/src/scss/lists/interpolated_identifier_part_list.rs:11\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026ScssInterpolatedIdentifierPartList\u0060 in one and \u0060\u0026ScssInterpolatedValuePartList\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/biome_css_formatter/src/scss/lists/interpolated_identifier_part_list.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c21942065fc97f53a5b081d383c32deca691a11d1106eea9823d51c87f6e6de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_css_formatter/src/scss/pseudo/interpolated_pseudo_class_function.rs:48-56 | crates/biome_css_formatter/src/scss/pseudo/interpolated_pseudo_element_function.rs:48-56 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_formatter/src/scss/pseudo/interpolated_pseudo_class_function.rs:48\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026ScssInterpolatedPseudoClassFunction\u0060 in one and \u0060\u0026ScssInterpolatedPseudoElementFunction\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/biome_css_formatter/src/scss/pseudo/interpolated_pseudo_class_function.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a34deb890dd42a7fb7ee6bdc0720da151e750cd141b001328cacaf19cf6a30d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/biome_css_formatter/src/trivia.rs:59-69 | crates/biome_js_formatter/src/trivia.rs:59-69 | crates/biome_json_formatter/src/trivia.rs:59-69 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060\u0026mut CssFormatter\u0060 in one and \u0060\u0026mut JsFormatter\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/biome_css_formatter/src/trivia.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f2d80274cf3f9a6bd634d95e7c42557664474dbc97b0d79d0865b09ba0874f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_css_formatter/src/utils/string_utils.rs:292-303 | crates/biome_js_formatter/src/utils/string_utils.rs:370-381 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_formatter/src/utils/string_utils.rs:292\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_css_formatter/src/utils/string_utils.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"01e881a274bb147eed9e467e01bea5130d9d2d8d7467f73f409ea302e991df31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6): crates/biome_css_parser/src/lib.rs:138-147 | crates/biome_graphql_parser/src/lib.rs:103-112 | crates/biome_html_parser/src/lib.rs:105-114 | crates/biome_js_parser/src/parse.rs:117-126 | crates/biome_json_parser/src/lib.rs:234-243 | crates/biome_yaml_parser/src/lib.rs:97-106 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 6 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 6 times. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060parse\u0060 to \u0060CssParse\u0060 in one and \u0060GraphqlParse\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/biome_css_parser/src/lib.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"87731e9291f0e3a738eeb8709446b05ce3547e94d37c31f14e9e6636ebd6d593"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): crates/biome_css_parser/src/lib.rs:204-213 | crates/biome_graphql_parser/src/lib.rs:225-234 | crates/biome_js_parser/src/parse.rs:130-139 | crates/biome_json_parser/src/lib.rs:127-136 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060parse\u0060 to \u0060CssOffsetParse\u0060 in one and \u0060GraphqlOffsetParse\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/biome_css_parser/src/lib.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"a04f11bef109280074c4c2e0c6f49dbd0261b0879670ccfd691b2b87f5aafacb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 8): crates/biome_css_parser/src/parser.rs:167-174 | crates/biome_graphql_parser/src/parser/mod.rs:83-90 | crates/biome_grit_parser/src/parser/mod.rs:52-59 | crates/biome_html_parser/src/parser.rs:55-62 | crates/biome_js_parser/src/parser.rs:153-160 | crates/biome_json_parser/src/parser.rs:74-81 | crates/biome_tailwind_parser/src/parser.rs:33-40 | crates/biome_yaml_parser/src/parser/mod.rs:56-63 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 8 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 8 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_graphql_parser/src/parser/mod.rs:83\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_js_parser/src/parser.rs:150\u0060 calls \u0060restore\u0060 and \u0060crates/biome_css_parser/src/parser.rs:161\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_parser/src/parser.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"47767752fd504da32903581df91da6d631995dc754a142abf088eb6d99194ac5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_css_parser/src/syntax/scss/identifiers/interpolated_dashed.rs:110-118 | crates/biome_css_parser/src/syntax/scss/identifiers/interpolated_regular.rs:312-320 \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/biome_css_parser/src/syntax/scss/identifiers/interpolated_dashed.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"83acfa0a71ee5e716f09c156b241a7421f68dfb4041304288df33720e27e8b1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 5): crates/biome_css_parser/src/token_source.rs:299-309 | crates/biome_html_parser/src/token_source.rs:390-400 | crates/biome_js_parser/src/token_source.rs:196-206 | crates/biome_markdown_parser/src/token_source.rs:337-347 | crates/biome_tailwind_parser/src/token_source.rs:143-153 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 5 times. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060context\u0060 to \u0060Self::Context\u0060 in one and \u0060JsLexContext\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/biome_css_parser/src/token_source.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d1e6012fa7580a4ef7ff477307f73dde47e46c946912c1b7f2ea5bdfe5fc3a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/biome_css_semantic/src/format_semantic_model.rs:35-43 | crates/biome_js_semantic/src/format_semantic_model.rs:33-41 | crates/biome_js_type_info/src/format_type_info.rs:44-52 | crates/biome_jsdoc_comment/src/format_jsdoc_comment.rs:48-56 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_semantic/src/format_semantic_model.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c03def9fe021248f720f2ebe05100386288e591c83b90cab6d03da7f32408ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_glob/src/editorconfig.rs:175-180 | crates/biome_glob/src/lib.rs:596-601 \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/biome_glob/src/editorconfig.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cfee9a24edb9cdc28c1a30962174ed993d9bc80b2776ac5a4122a7803fef4c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_glob/src/editorconfig.rs:184-189 | crates/biome_glob/src/lib.rs:605-610 \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/biome_glob/src/editorconfig.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"b28440866d2c9bb5ff1d628b84a33cf15c3d27b5f99d0212da685149266d332d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/biome_graphql_analyze/src/assist/source/use_sorted_selection_set.rs:155-161 | crates/biome_graphql_analyze/src/assist/source/use_sorted_type_fields.rs:170-176 | crates/biome_graphql_analyze/src/assist/source/use_sorted_type_fields.rs:178-184 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026GraphqlFragmentSpread\u0060 in one and \u0060\u0026GraphqlFieldDefinition\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/biome_graphql_analyze/src/assist/source/use_sorted_selection_set.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba9c4723a64463c506476ef4fc56e6e9ee30b06997147ff25c2ae0d2b565f83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/biome_graphql_formatter/src/graphql/lists/list_value_element_list.rs:13-20 | crates/biome_graphql_formatter/src/graphql/lists/object_value_member_list.rs:13-20 | crates/biome_graphql_formatter/src/graphql/lists/variable_definition_list.rs:12-19 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_graphql_formatter/src/graphql/lists/list_value_element_list.rs:13\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026GraphqlListValueElementList\u0060 in one and \u0060\u0026GraphqlObjectValueMemberList\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/biome_graphql_formatter/src/graphql/lists/list_value_element_list.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e759d646a54edc090e3bec9bc3afd20512f71b570d358dd387ed17bda997bf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6): crates/biome_graphql_formatter/src/lib.rs:261-268 | crates/biome_grit_formatter/src/cst.rs:41-48 | crates/biome_html_formatter/src/lib.rs:208-215 | crates/biome_js_formatter/src/lib.rs:480-487 | crates/biome_json_formatter/src/lib.rs:295-302 | crates/biome_yaml_formatter/src/lib.rs:298-305 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 6 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 6 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_graphql_formatter/src/lib.rs:261\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060token\u0060 to \u0060\u0026GraphqlSyntaxToken\u0060 in one and \u0060\u0026GritSyntaxToken\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/biome_graphql_formatter/src/lib.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"80cb93344e2d9494c06e61c732c73c50c9d2c1812b79c86ea9c181e096b2d5ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_graphql_formatter/src/verbatim.rs:27-35 | crates/biome_grit_formatter/src/verbatim.rs:27-35 \u2014 before extracting anything, compare \u0060crates/biome_graphql_formatter/src/verbatim.rs\u0060 and \u0060crates/biome_grit_formatter/src/verbatim.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 199 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026GraphqlSyntaxNode\u0060 in one and \u0060\u0026GritSyntaxNode\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/biome_graphql_formatter/src/verbatim.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"675208c6c0d10e21b673a20d17b1edc29d1f4604b9754160eb6424ec92968be6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_grit_formatter/src/grit/lists/map_element_list.rs:8-15 | crates/biome_grit_formatter/src/grit/lists/predicate_list.rs:9-16 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026GritMapElementList\u0060 in one and \u0060\u0026GritPredicateList\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/biome_grit_formatter/src/grit/lists/map_element_list.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c7db7881de64b9e909c880b22af382ddb6cb18b67382cc5827025b866ad68f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/biome_grit_parser/src/lib.rs:107-111 | crates/biome_markdown_parser/src/lib.rs:167-171 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060parse\u0060 to \u0060GritParse\u0060 in one and \u0060MarkdownParse\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/biome_grit_parser/src/lib.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"66699da7af8c99aa61d76f0507f8cbb8331f85aca59494a8f388a2586057c3a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/biome_grit_parser/src/lib.rs:195-199 | crates/biome_html_parser/src/lib.rs:203-207 | crates/biome_markdown_parser/src/lib.rs:297-301 | crates/biome_yaml_parser/src/lib.rs:190-194 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060parse\u0060 to \u0060GritOffsetParse\u0060 in one and \u0060HtmlOffsetParse\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/biome_grit_parser/src/lib.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f9190eee88726a4830f672b4e91e826e3cce4efaaa6e1b6268188f0523fb90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_grit_patterns/src/grit_node.rs:140-147 | crates/biome_grit_patterns/src/grit_target_node.rs:491-498 \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/biome_grit_patterns/src/grit_node.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"48f2b4c278c2d2ab7fce53183d64f33961c25b3cb4a0113b40eaa82e8f3eba08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/biome_grit_patterns/src/grit_target_language/css_target_language.rs:112-121 | crates/biome_grit_patterns/src/grit_target_language/js_target_language.rs:166-175 | crates/biome_grit_patterns/src/grit_target_language/json_target_language.rs:125-134 \u2014 before extracting anything, compare \u0060crates/biome_grit_patterns/src/grit_target_language/js_target_language.rs\u0060 and \u0060crates/biome_grit_patterns/src/grit_target_language/json_target_language.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_grit_patterns/src/grit_target_language/css_target_language.rs:112\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_grit_patterns/src/grit_target_language/css_target_language.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"5099b57c933994f0f15f957d92c1d31329e42d6afbfcfea57bb177e34e83fd13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/biome_html_analyze/src/lint/a11y/no_interactive_element_to_noninteractive_role.rs:112-129 | crates/biome_js_analyze/src/lint/a11y/no_interactive_element_to_noninteractive_role.rs:123-140 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/a11y/no_interactive_element_to_noninteractive_role.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2eb1080fecb99b08cbd5cd0e695a961e7ed847215e225f5a1dfc269d27db761"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_html_analyze/src/lint/a11y/no_positive_tabindex.rs:123-130 | crates/biome_js_analyze/src/lint/a11y/no_positive_tabindex.rs:251-258 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/a11y/no_positive_tabindex.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd6ff726123a61dbdbcebaeb8a4afaff61fd87a1e571430f2161fc0687bdb6ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/biome_html_analyze/src/lint/a11y/no_static_element_interactions.rs:96-109 | crates/biome_js_analyze/src/lint/a11y/no_static_element_interactions.rs:95-108 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/a11y/no_static_element_interactions.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a78ef9c89c9256bcad9a607a0f6e0718df921a5a8dc4c9f6a1cc6ddeea0b2f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_html_analyze/src/lint/a11y/use_alt_text.rs:102-107 | crates/biome_js_analyze/src/lint/a11y/use_alt_text.rs:80-85 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/a11y/use_alt_text.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"0433fc825d9ec116e72694a1101dd270580e6bd9baa1dced7e7f7f2231e35559"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/biome_html_analyze/src/lint/a11y/use_anchor_content.rs:239-249 | crates/biome_html_analyze/src/lint/a11y/use_heading_content.rs:275-285 | crates/biome_html_analyze/src/lint/nursery/use_control_label.rs:219-227 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/a11y/use_anchor_content.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e624e9c47fee1b569f2d2924a46d3a9e6c5b9681e76b357228e48ba44fee449"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_html_analyze/src/lint/correctness/use_vue_valid_v_else.rs:216-226 | crates/biome_html_analyze/src/lint/correctness/use_vue_valid_v_else_if.rs:233-242 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/correctness/use_vue_valid_v_else.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"34309ed16b902b34591b2b5fae437789855149d2134b4decd18742718ca46043"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/biome_html_analyze/src/lint/nursery/no_non_scalable_viewport.rs:73-89 | crates/biome_js_analyze/src/lint/nursery/no_non_scalable_viewport.rs:76-92 \u2014 before extracting anything, compare \u0060crates/biome_html_analyze/src/lint/nursery/no_non_scalable_viewport.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/nursery/no_non_scalable_viewport.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/nursery/no_non_scalable_viewport.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"34c58a2ed0143873b729375b9da37b713679f117aaf69391b939098bc1ee69f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_html_analyze/src/lint/nursery/no_tailwind_raw_colors.rs:131-137 | crates/biome_js_analyze/src/lint/nursery/no_tailwind_raw_colors.rs:130-136 \u2014 before extracting anything, compare \u0060crates/biome_html_analyze/src/lint/nursery/no_tailwind_raw_colors.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/nursery/no_tailwind_raw_colors.rs\u0060 as WHOLE FILES: 85% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/nursery/no_tailwind_raw_colors.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0341296306a422837db1c5963b526858675f8d85a570131a3e8a7be97dc7d4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/biome_html_analyze/src/lint/nursery/no_undeclared_custom_properties.rs:107-119 | crates/biome_js_analyze/src/lint/nursery/no_undeclared_custom_properties.rs:92-104 \u2014 before extracting anything, compare \u0060crates/biome_html_analyze/src/lint/nursery/no_undeclared_custom_properties.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/nursery/no_undeclared_custom_properties.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/nursery/no_undeclared_custom_properties.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"f37e174c1e1f41186bcca94d94a774921d980297e5acc0c261af34963c1d4917"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_html_analyze/src/lint/nursery/use_tailwind_static_class_strings.rs:81-88 | crates/biome_js_analyze/src/lint/nursery/use_tailwind_static_class_strings.rs:98-105 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/nursery/use_tailwind_static_class_strings.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"2acba225d12af23dce2abd4208bea7f57663b9e838d42c1ecf5abae72f9f7ee4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/biome_html_analyze/src/lint/style/no_inline_styles.rs:93-106 | crates/biome_js_analyze/src/lint/style/no_inline_styles.rs:87-100 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/style/no_inline_styles.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"62fff32136da5c27e0ab8cb5aec42694724243a08b9b6f6f7907ad4448b8351f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/biome_html_formatter/src/context.rs:445-449 | crates/biome_markdown_formatter/src/context.rs:222-226 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_formatter/src/context.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"2004f54ae0fcb63c11eb03f0a68cfd37137b8c835a0639f912a546aed9a1b666"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_html_formatter/src/context.rs:461-467 | crates/biome_markdown_formatter/src/context.rs:234-240 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_formatter/src/context.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"42cfa23db6d020c97aa32692989f90d2a04b5b7dc579d433519a828bd8dc67d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_html_formatter/src/html/auxiliary/string.rs:67-75 | crates/biome_html_syntax/src/lib.rs:133-139 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_formatter/src/html/auxiliary/string.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"467e73b773eeb60b940f13b1db035ec65d496f880d5f972631d67841eef3b901"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_html_formatter/src/utils/children.rs:921-931 | crates/biome_js_formatter/src/utils/jsx.rs:544-554 \u2014 before extracting anything, compare \u0060crates/biome_html_formatter/src/utils/children.rs\u0060 and \u0060crates/biome_js_formatter/src/utils/jsx.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_formatter/src/utils/children.rs"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a4267b8fab9015ab8e610a1efd28e39663c4183bbeda42dfe0c813fa59f7aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_html_formatter/src/utils/children.rs:951-960 | crates/biome_js_formatter/src/utils/jsx.rs:574-583 \u2014 before extracting anything, compare \u0060crates/biome_html_formatter/src/utils/children.rs\u0060 and \u0060crates/biome_js_formatter/src/utils/jsx.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_formatter/src/utils/children.rs"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f08b819104486ac38caa645598c7bb7c602960da9663e26b77fdf1df1e65f04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/biome_html_parser/src/token_source.rs:332-336 | crates/biome_js_parser/src/token_source.rs:133-137 | crates/biome_markdown_parser/src/token_source.rs:289-293 | crates/biome_tailwind_parser/src/token_source.rs:92-96 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060checkpoint\u0060 to \u0060HtmlTokenSourceCheckpoint\u0060 in one and \u0060JsTokenSourceCheckpoint\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/biome_tailwind_parser/src/token_source.rs:98\u0060 calls \u0060re_lex_current_in_context\u0060, \u0060force_relex_in_context\u0060 and \u0060crates/biome_markdown_parser/src/token_source.rs:294\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/biome_html_parser/src/token_source.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"a839e37caea6b2927f06e60d67876f5f2d549121da9dfbcbc4568fc9bb43005b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_html_syntax/src/static_value.rs:114-119 | crates/biome_js_syntax/src/static_value.rs:114-119 \u2014 before extracting anything, compare \u0060crates/biome_html_syntax/src/static_value.rs\u0060 and \u0060crates/biome_js_syntax/src/static_value.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_syntax/src/static_value.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de6627e41757326faed60867ffcf3ed6864e6c9e00cd27b71ebe5b121f3c86c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_html_syntax/src/static_value.rs:135-140 | crates/biome_js_syntax/src/static_value.rs:135-140 \u2014 before extracting anything, compare \u0060crates/biome_html_syntax/src/static_value.rs\u0060 and \u0060crates/biome_js_syntax/src/static_value.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/biome_js_syntax/src/static_value.rs:153\u0060 calls \u0060is_null_or_undefined\u0060, \u0060Null\u0060, \u0060Undefined\u0060 and \u0060crates/biome_html_syntax/src/static_value.rs:141\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/biome_html_syntax/src/static_value.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3583dd93750feac92caea0ae2925111c08c3aac5acfefcddf70f466ebca6037"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_js_analyze/src/lint/correctness/no_invalid_builtin_instantiation.rs:221-228 | crates/biome_js_analyze/src/lint/style/use_consistent_builtin_instantiation.rs:220-228 \u2014 before extracting anything, compare \u0060crates/biome_js_analyze/src/lint/correctness/no_invalid_builtin_instantiation.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/style/use_consistent_builtin_instantiation.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/correctness/no_invalid_builtin_instantiation.rs:221\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/correctness/no_invalid_builtin_instantiation.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a3ab73308a05cdeefcd113e1ad9816ccd71b5a977a97f4dee3f6efb2de67e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_js_analyze/src/lint/correctness/use_yield.rs:138-145 | crates/biome_js_analyze/src/lint/suspicious/use_await.rs:83-89 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/use_yield.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db78ff375776e7dd3a41d811ab647b2589e68b764367bc798c65176bedacd7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/no_array_sort_for_min_max.rs:644-649 | crates/biome_js_analyze/src/lint/nursery/use_math_abs.rs:541-546 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026AnyArrayEndAccess\u0060 in one and \u0060\u0026AnyUseMathAbsQuery\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/biome_js_analyze/src/lint/nursery/no_array_sort_for_min_max.rs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b63a98c7b6e00ce762d81b8885cafe18e468cd0f15991cef33e94d03801f57d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/no_async_promise_finally.rs:149-157 | crates/biome_js_analyze/src/lint/nursery/use_string_starts_ends_with.rs:760-768 \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/biome_js_analyze/src/lint/nursery/no_async_promise_finally.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd0cb6f86bb025278bfe61aceca5e56728da9643e52cb25b8059fc0af4fe5dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/no_base_to_string.rs:276-284 | crates/biome_js_analyze/src/lint/nursery/no_unsafe_plus_operands.rs:198-206 \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/biome_js_analyze/src/lint/nursery/no_base_to_string.rs:276\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060ctx\u0060 to \u0060\u0026RuleContext\u003CNoBaseToString\u003E\u0060 in one and \u0060\u0026RuleContext\u003CNoUnsafePlusOperands\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_base_to_string.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"edcb2b3bdcc19b4579e14fec07c8fe6f3c9987492331ed9392fa7f9f65df78f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/use_explicit_return_type.rs:636-643 | crates/biome_js_analyze/src/lint/nursery/use_explicit_type.rs:770-777 \u2014 before extracting anything, compare \u0060crates/biome_js_analyze/src/lint/nursery/use_explicit_return_type.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/nursery/use_explicit_type.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 80 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/biome_js_analyze/src/lint/nursery/use_explicit_return_type.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f06b53e583eb18434148523c6c63ae3d8ed5abcd5dc69b39741473e9e5bb30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/use_explicit_return_type.rs:645-651 | crates/biome_js_analyze/src/lint/nursery/use_explicit_type.rs:787-793 \u2014 before extracting anything, compare \u0060crates/biome_js_analyze/src/lint/nursery/use_explicit_return_type.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/nursery/use_explicit_type.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 80 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/biome_js_analyze/src/lint/nursery/use_explicit_return_type.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c99e882015b2bfa22fde57c05da486926e881ddfcd6f0934f6a76e366eca2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/use_explicit_return_type.rs:653-659 | crates/biome_js_analyze/src/lint/nursery/use_explicit_type.rs:803-809 \u2014 before extracting anything, compare \u0060crates/biome_js_analyze/src/lint/nursery/use_explicit_return_type.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/nursery/use_explicit_type.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 80 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/biome_js_analyze/src/lint/nursery/use_explicit_return_type.rs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e62ed4f8547b378d24590e1b0edf8af0b87f684bc649b47ea3ea60b571def6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/use_explicit_return_type.rs:661-667 | crates/biome_js_analyze/src/lint/nursery/use_explicit_type.rs:821-827 \u2014 before extracting anything, compare \u0060crates/biome_js_analyze/src/lint/nursery/use_explicit_return_type.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/nursery/use_explicit_type.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 80 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/biome_js_analyze/src/lint/nursery/use_explicit_return_type.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"83c4990303b3c1dfe1ecb8c23bb3b65e488a32d462f99fdc759aa36b4eeb242d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_js_analyze/src/nextjs.rs:21-27 | crates/biome_js_analyze/src/react.rs:293-299 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060lib\u0060 to \u0060NextUtility\u0060 in one and \u0060ReactLibrary\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/biome_js_analyze/src/nextjs.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"157592dba18c16f436f8c36cb374ade75c946f66e37ab8a5ceab246762a267a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_js_analyze/src/shared/any_class_string_like.rs:75-85 | crates/biome_tailwind_logic/src/class_context.rs:213-223 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/shared/any_class_string_like.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3ed1ce56310af978f9ca2299187ea5ae7a9554b31db03478672a84546d955e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/biome_js_control_flow/src/nodes/for_in.rs:61-73 | crates/biome_js_control_flow/src/nodes/for_of.rs:61-73 \u2014 before extracting anything, compare \u0060crates/biome_js_control_flow/src/nodes/for_in.rs\u0060 and \u0060crates/biome_js_control_flow/src/nodes/for_of.rs\u0060 as WHOLE FILES: 90% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_control_flow/src/nodes/for_in.rs:61\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_js_control_flow/src/nodes/for_in.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"a358eb24876e93749771b16bdb31045f9a7a4ed884110edadcf404cb640197f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_js_formatter/src/js/classes/constructor_class_member.rs:11-20 | crates/biome_js_formatter/src/js/classes/method_class_member.rs:18-27 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026JsConstructorClassMember\u0060 in one and \u0060\u0026JsMethodClassMember\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/biome_js_formatter/src/js/classes/constructor_class_member.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"1452b131ae28177db6924a487e424892c0b21edb4da283e8a4b46d3004ac60ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): crates/biome_js_formatter/src/js/lists/export_named_from_specifier_list.rs:11-20 | crates/biome_js_formatter/src/js/lists/export_named_specifier_list.rs:11-20 | crates/biome_js_formatter/src/js/lists/import_assertion_entry_list.rs:11-20 | crates/biome_js_formatter/src/js/lists/named_import_specifier_list.rs:11-20 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026JsExportNamedFromSpecifierList\u0060 in one and \u0060\u0026JsExportNamedSpecifierList\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/biome_js_formatter/src/js/lists/export_named_from_specifier_list.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5043a1909306922bd381b17337bd9c198d3b3749f7a6869cf4ca2624c80313d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/biome_js_formatter/src/ts/classes/initialized_property_signature_class_member.rs:17-30 | crates/biome_js_formatter/src/ts/classes/property_signature_class_member.rs:17-30 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_formatter/src/ts/classes/initialized_property_signature_class_member.rs:17\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026TsInitializedPropertySignatureClassMember\u0060 in one and \u0060\u0026TsPropertySignatureClassMember\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/biome_js_formatter/src/ts/classes/initialized_property_signature_class_member.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ff2962c303d730cd4c212d9c2b121d0ac1f7720c97ed36b4b12f3d6f8fb117a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/biome_js_formatter/src/ts/lists/index_signature_modifier_list.rs:12-16 | crates/biome_js_formatter/src/ts/lists/property_parameter_modifier_list.rs:11-15 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026TsIndexSignatureModifierList\u0060 in one and \u0060\u0026TsPropertyParameterModifierList\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/biome_js_formatter/src/ts/lists/index_signature_modifier_list.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"82750347f631777da7e46c36a2f8ac8a70bf58052ca52e4043f05e90aba80b38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_js_formatter/src/ts/lists/type_argument_list.rs:10-17 | crates/biome_js_formatter/src/ts/lists/type_list.rs:10-18 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026TsTypeArgumentList\u0060 in one and \u0060\u0026TsTypeList\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/biome_js_formatter/src/ts/lists/type_argument_list.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"068ac6eb5ef4284ce4a7467fb01797b532db461fda188cad3801be0311cf4f47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): crates/biome_js_runtime/src/ast.rs:234-243 | crates/biome_js_runtime/src/kind_set.rs:245-251 | crates/biome_js_runtime/src/kind_set.rs:318-324 | crates/biome_js_runtime/src/mutation.rs:30-36 | crates/biome_js_runtime/src/token.rs:25-31 \u2014 there are 5 copies across 4 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_runtime/src/ast.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d18b7f64bb3ec2760ad969467f931736c0e406261f6e10ce2bca435523a79d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/biome_js_runtime/src/ast.rs:266-271 | crates/biome_js_runtime/src/token.rs:41-45 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_runtime/src/ast.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee40aa53db62d45ab0d45033455d6a32ab402b733718b3671d71b46af0e606f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_js_semantic/src/format_semantic_model.rs:60-69 | crates/biome_js_semantic/src/semantic_model/binding.rs:521-530 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060\u0026mut std::fmt::Formatter\u003C\u0027_\u003E\u0060 in one and \u0060\u0026mut Formatter\u003C\u0027_\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_semantic/src/format_semantic_model.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f7e9e88654616be4f8af2f8f0270b46b6fd35687473a38dc1f879469cc33ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_js_type_info/src/format_inferred_type_info.rs:381-386 | crates/biome_js_type_info/src/format_type_info.rs:290-295 \u2014 before extracting anything, compare \u0060crates/biome_js_type_info/src/format_inferred_type_info.rs\u0060 and \u0060crates/biome_js_type_info/src/format_type_info.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 242 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060\u0026mut Formatter\u003CFormatInferredTypeContext\u003C\u0027db\u003E\u003E\u0060 in one and \u0060\u0026mut Formatter\u003CFormatTypeContext\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/format_inferred_type_info.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"42efee1753db193a8afbf6faccbb6916538d223db8ba02f2901c3c4e780692c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_js_type_info/src/format_inferred_type_info.rs:459-469 | crates/biome_js_type_info/src/format_type_info.rs:374-384 \u2014 before extracting anything, compare \u0060crates/biome_js_type_info/src/format_inferred_type_info.rs\u0060 and \u0060crates/biome_js_type_info/src/format_type_info.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 242 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060\u0026mut Formatter\u003CFormatInferredTypeContext\u003C\u0027db\u003E\u003E\u0060 in one and \u0060\u0026mut Formatter\u003CFormatTypeContext\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/format_inferred_type_info.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd5651756e1e65d311378c9ba64e20af8721e91dccedfa7cdddbfeae20ca4d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/biome_js_type_info/src/format_type_info.rs:71-80 | crates/biome_module_graph/src/format_module_graph.rs:17-26 | crates/biome_module_graph/src/format_module_graph.rs:200-209 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060\u0026mut std::fmt::Formatter\u003C\u0027_\u003E\u0060 in one and \u0060\u0026mut Formatter\u003C\u0027_\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/format_type_info.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"94fab87b03ca303cc84f5acf2bfbb2e8400d06826a5bb53042d90a2f88c8d076"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_js_type_info/src/inferred_type.rs:291-301 | crates/biome_js_type_info/src/inferred_type/boolean_coercion.rs:75-80 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/inferred_type.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee53be466ec884171c2056ee9cac3e157edb7740f33bda95a8afd14d72e8df05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_js_type_info/src/interned_types.rs:2400-2406 | crates/biome_js_type_info/src/type_data.rs:1307-1313 \u2014 before extracting anything, compare \u0060crates/biome_js_type_info/src/interned_types.rs\u0060 and \u0060crates/biome_js_type_info/src/type_data.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/interned_types.rs"},"region":{"startLine":2400}}}],"partialFingerprints":{"codehealthFindingId/v1":"a915219b70308e9046217433aa8cf5810767cfdedf59832342063ab30b5bb08c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_js_type_info/src/interned_types.rs:2408-2414 | crates/biome_js_type_info/src/type_data.rs:1316-1322 \u2014 before extracting anything, compare \u0060crates/biome_js_type_info/src/interned_types.rs\u0060 and \u0060crates/biome_js_type_info/src/type_data.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/biome_js_type_info/src/interned_types.rs:2416\u0060 calls \u0060is_call_signature\u0060 and \u0060crates/biome_js_type_info/src/type_data.rs:1324\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/biome_js_type_info/src/interned_types.rs"},"region":{"startLine":2408}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5db86c8fee010108c6b3239802750e83683ef0cdd2dad8b132f19203467cb59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 7): crates/biome_languages/src/css.rs:322-333 | crates/biome_languages/src/graphql.rs:76-87 | crates/biome_languages/src/grit.rs:62-73 | crates/biome_languages/src/html.rs:222-233 | crates/biome_languages/src/json.rs:410-421 | crates/biome_languages/src/md.rs:81-92 | crates/biome_languages/src/yaml.rs:83-94 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 7 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_languages/src/css.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a4baebe879126228b5635c0171265eef3115ba2b0714b1a63594e0e47c95b9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_markdown_analyze/src/suppression.rs:84-92 | crates/biome_markdown_formatter/src/comments.rs:153-161 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_analyze/src/suppression.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef7195f02fa3159b436c3e89fc7b51b673adc9335aa247c456366d46074c1d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/biome_markdown_parser/src/syntax/inline/links.rs:587-591 | crates/biome_markdown_parser/src/syntax/link_block.rs:574-578 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/inline/links.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c2bf641f93f57beadf71a7b0bc143d004c7f83e23624d2e0b794c4949d4c5e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_markdown_parser/src/syntax/mod.rs:310-315 | crates/biome_markdown_parser/src/syntax/quote.rs:616-622 \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/biome_markdown_parser/src/syntax/mod.rs:310\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/mod.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"b40f98e0bfcf0978f37330ed02b4558a1396cf2712f7f6a6351cb12b83c0cf89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/biome_plugin_loader/src/lib.rs:509-513 | crates/biome_service/src/configuration.rs:1118-1122 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_plugin_loader/src/lib.rs:509\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_plugin_loader/src/lib.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f4be29b59d08f667a8f11ed2a7b80aa76316fffd62a274c374d748edcb4d40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_resolver/src/lib.rs:132-138 | xtask/codegen/src/generate_global_types/source.rs:892-898 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_resolver/src/lib.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"326e05d3046baed009e0b38f34b756a02fbd6e88c7ef4c87061bdb486ff5480c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_rule_options/src/no_restricted_imports.rs:76-82 | crates/biome_rule_options/src/no_restricted_types.rs:49-55 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_rule_options/src/no_restricted_imports.rs:76\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_rule_options/src/no_restricted_imports.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e74b1e0152281eb62016695cfa93e651e16793c207b10634a11cf7e2c7a4d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_rule_options/src/no_tailwind_restyled_components.rs:63-69 | crates/biome_rule_options/src/no_vue_restricted_call_after_await.rs:75-81 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_rule_options/src/no_tailwind_restyled_components.rs:63\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_rule_options/src/no_tailwind_restyled_components.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"2df6c69576d89cc48789b21a49489dd51c77a870cd4029901ba501f0649f8bfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/biome_service/src/file_handlers/css.rs:555-563 | crates/biome_service/src/file_handlers/graphql.rs:452-460 | crates/biome_service/src/file_handlers/grit.rs:390-398 | crates/biome_service/src/file_handlers/yaml.rs:428-436 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/css.rs\u0060 and \u0060crates/biome_service/src/file_handlers/graphql.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 202 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_service/src/file_handlers/css.rs:555\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/css.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e52a89370d0cf5f5044ef44b2ab8a7e5136c47ea1754dbd70100827e7418cf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/biome_service/src/file_handlers/graphql.rs:267-271 | crates/biome_service/src/file_handlers/md.rs:200-205 | crates/biome_service/src/file_handlers/yaml.rs:155-160 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/graphql.rs\u0060 and \u0060crates/biome_service/src/file_handlers/md.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 181 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_service/src/file_handlers/graphql.rs:267\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_service/src/file_handlers/graphql.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9019c82b4a025eb8dacdb2d80b317c3402995de97a3bc2e5ae125492fde872"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_service/src/file_handlers/svelte.rs:40-45 | crates/biome_service/src/file_handlers/vue.rs:40-45 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/svelte.rs\u0060 and \u0060crates/biome_service/src/file_handlers/vue.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 105 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/biome_service/src/file_handlers/svelte.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3859230e8da1bdb5f6ae983ada4ae4ab6d8d44575935b52c3dcb1af9702ff12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_service/src/file_handlers/svelte.rs:49-60 | crates/biome_service/src/file_handlers/vue.rs:49-60 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/svelte.rs\u0060 and \u0060crates/biome_service/src/file_handlers/vue.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 105 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/biome_service/src/file_handlers/svelte.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"2478e973a68b849ed394b866a0c10e5953a1fc03e670e553645a5784de0f49b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_syntax_codegen/src/ast.rs:313-323 | xtask/codegen/src/ast.rs:351-361 \u2014 before extracting anything, compare \u0060crates/biome_syntax_codegen/src/ast.rs\u0060 and \u0060xtask/codegen/src/ast.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 344 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_syntax_codegen/src/ast.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"c661aae27a164f9c4f0f2ee6971e8e54371048f642c771d630317ff3e9d07024"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_syntax_codegen/src/ast.rs:634-639 | xtask/codegen/src/js_kinds_src.rs:752-757 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_syntax_codegen/src/ast.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"71eb24e3faeb7a35504e5a3d4f1cc18cd36fab72364531c091c353bdb296fb05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/biome_syntax_codegen/src/ast.rs:641-646 | crates/biome_syntax_codegen/src/ast.rs:648-653 | xtask/codegen/src/js_kinds_src.rs:759-764 | xtask/codegen/src/js_kinds_src.rs:766-771 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_syntax_codegen/src/ast.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f95adbe15f709be838f01d59597ecf7160aadad024b21851504fcf33239914"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_cli/src/execute/migrate/eslint_to_biome.rs:79-85 | crates/biome_cli/src/execute/migrate/stylelint_to_biome.rs:69-75 \u2014 before extracting anything, compare \u0060crates/biome_cli/src/execute/migrate/eslint_to_biome.rs\u0060 and \u0060crates/biome_cli/src/execute/migrate/stylelint_to_biome.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/execute/migrate/eslint_to_biome.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e21372b33ab8455eca83aa488245e022338c624705e29836521fb8db12d70ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 18): crates/biome_css_formatter/src/css/auxiliary/at_rule_declarator.rs:8-15 | crates/biome_css_formatter/src/css/auxiliary/namespace.rs:8-15 | crates/biome_css_formatter/src/css/auxiliary/unicode_range.rs:8-15 | crates/biome_css_formatter/src/css/selectors/pseudo_element_selector.rs:12-19 | crates/biome_css_formatter/src/css/selectors/universal_selector.rs:8-15 | crates/biome_css_formatter/src/css/statements/custom_media_at_rule.rs:9-16 | crates/biome_css_formatter/src/css/value/percentage.rs:7-14 | crates/biome_css_formatter/src/scss/selectors/keyframes_selector.rs:8-15 | crates/biome_css_formatter/src/scss/selectors/placeholder_selector.rs:8-15 | crates/biome_grit_formatter/src/grit/auxiliary/language_specific_snippet.rs:11-18 | crates/biome_html_formatter/src/astro/auxiliary/opening_fragment.rs:7-14 | crates/biome_html_formatter/src/svelte/auxiliary/rest_binding.rs:7-14 | crates/biome_html_formatter/src/svelte/auxiliary/snippet_block.rs:7-14 | crates/biome_html_formatter/src/vue/auxiliary/modifier.rs:8-15 | crates/biome_html_formatter/src/vue/auxiliary/v_for_rest_binding.rs:8-15 | crates/biome_js_formatter/src/js/assignments/array_assignment_pattern_rest_element.rs:17-24 | crates/biome_js_formatter/src/js/assignments/object_assignment_pattern_rest.rs:15-22 | crates/biome_js_formatter/src/js/auxiliary/expression_template_root.rs:8-15 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 18 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 18 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_formatter/src/css/selectors/pseudo_element_selector.rs:12\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026CssAtRuleDeclarator\u0060 in one and \u0060\u0026CssNamespace\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/biome_css_formatter/src/css/auxiliary/at_rule_declarator.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5386e47240d87cf08fe47fa70436117565cb861e05c97a3da143cab8cf04077"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 19): crates/biome_css_formatter/src/css/auxiliary/attr_fallback_value.rs:9-20 | crates/biome_css_formatter/src/css/auxiliary/nth_offset.rs:8-12 | crates/biome_css_formatter/src/css/statements/color_profile_at_rule.rs:9-13 | crates/biome_css_formatter/src/css/statements/container_at_rule.rs:9-13 | crates/biome_css_formatter/src/css/statements/counter_style_at_rule.rs:9-13 | crates/biome_css_formatter/src/css/statements/font_face_at_rule.rs:9-13 | crates/biome_css_formatter/src/css/statements/font_palette_values_at_rule.rs:13-17 | crates/biome_css_formatter/src/css/statements/function_at_rule.rs:10-14 | crates/biome_css_formatter/src/css/statements/media_at_rule.rs:9-13 | crates/biome_css_formatter/src/css/statements/position_try_at_rule.rs:8-12 | crates/biome_css_formatter/src/css/statements/property_at_rule.rs:9-13 | crates/biome_css_formatter/src/css/statements/scope_at_rule.rs:9-13 | crates/biome_css_formatter/src/css/statements/starting_style_at_rule.rs:9-13 | crates/biome_css_formatter/src/css/statements/supports_at_rule.rs:10-14 | crates/biome_css_formatter/src/css/statements/view_transition_at_rule.rs:8-12 | crates/biome_css_formatter/src/scss/auxiliary/parameter_default_value.rs:14-18 | crates/biome_graphql_formatter/src/graphql/auxiliary/type_condition.rs:11-15 | crates/biome_grit_formatter/src/grit/patterns/pattern_until_clause.rs:8-12 | crates/biome_html_formatter/src/svelte/auxiliary/each_index.rs:7-11 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 19 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 19 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_formatter/src/css/statements/font_palette_values_at_rule.rs:13\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026CssAttrFallbackValue\u0060 in one and \u0060\u0026CssNthOffset\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/biome_css_formatter/src/css/auxiliary/attr_fallback_value.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"643b6e3c077079703ab8c1a4c28aed404ddd348d338ea5a4afc463f1d120fced"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 8): crates/biome_css_formatter/src/css/auxiliary/attribute_modifier.rs:8-12 | crates/biome_css_formatter/src/css/auxiliary/else_keyword.rs:9-13 | crates/biome_css_formatter/src/css/auxiliary/font_face_at_rule_declarator.rs:13-20 | crates/biome_css_formatter/src/css/auxiliary/import_anonymous_layer.rs:8-12 | crates/biome_css_formatter/src/css/auxiliary/number_declarator.rs:9-15 | crates/biome_css_formatter/src/css/auxiliary/raw_string_declarator.rs:9-15 | crates/biome_css_formatter/src/css/pseudo/pseudo_class_nth_identifier.rs:12-16 | crates/biome_css_formatter/src/css/selectors/keyframes_ident_selector.rs:12-16 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 8 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 8 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_formatter/src/css/auxiliary/font_face_at_rule_declarator.rs:13\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026CssAttributeModifier\u0060 in one and \u0060\u0026CssElseKeyword\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/biome_css_formatter/src/css/auxiliary/attribute_modifier.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"906ea3e2eff0dacd0ef800dd5284a87176488770b7a3ebe11715800277254c70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/biome_css_formatter/src/css/auxiliary/attribute_name.rs:8-18 | crates/biome_css_formatter/src/css/selectors/type_selector.rs:8-18 | crates/biome_css_formatter/src/scss/auxiliary/variable.rs:9-19 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026CssAttributeName\u0060 in one and \u0060\u0026CssTypeSelector\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/biome_css_formatter/src/css/auxiliary/attribute_name.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"706ad68ece708d5e8b0042f1079183df714de35187eb5e703444b1c14a030b0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 4): crates/biome_css_formatter/src/css/auxiliary/color_profile_at_rule_declarator.rs:13-29 | crates/biome_css_formatter/src/css/auxiliary/counter_style_at_rule_declarator.rs:13-29 | crates/biome_css_formatter/src/css/auxiliary/font_palette_values_at_rule_declarator.rs:17-33 | crates/biome_css_formatter/src/css/auxiliary/position_try_at_rule_declarator.rs:13-29 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_formatter/src/css/auxiliary/color_profile_at_rule_declarator.rs:13\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026CssColorProfileAtRuleDeclarator\u0060 in one and \u0060\u0026CssCounterStyleAtRuleDeclarator\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/biome_css_formatter/src/css/auxiliary/color_profile_at_rule_declarator.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"037559d33bace79ab6238490fd5f323f62e1c374a3d3a823637a512642180cf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/biome_css_formatter/src/css/auxiliary/comma_separated_value.rs:10-25 | crates/biome_css_formatter/src/scss/auxiliary/parameter_list.rs:10-25 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026CssCommaSeparatedValue\u0060 in one and \u0060\u0026ScssParameterList\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/biome_css_formatter/src/css/auxiliary/comma_separated_value.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e76950f57bceef95db8ee51825e3629f98772f46f4c93e9c1772a5e130b42a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/biome_css_formatter/src/css/auxiliary/composes_property_value.rs:12-16 | crates/biome_js_formatter/src/jsx/attribute/attribute.rs:10-14 | crates/biome_js_formatter/src/jsx/attribute/attribute_initializer_clause.rs:14-18 | crates/biome_js_formatter/src/ts/module/import_type_qualifier.rs:11-15 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_formatter/src/css/auxiliary/composes_property_value.rs:12\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060\u0026mut CssFormatter\u0060 in one and \u0060\u0026mut JsFormatter\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/biome_css_formatter/src/css/auxiliary/composes_property_value.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"804fb38685ba334af30063c855ebaaf88726867964d0c0b9cc4bab1186d3c51f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 12): crates/biome_css_formatter/src/css/auxiliary/container_and_query.rs:8-25 | crates/biome_css_formatter/src/css/auxiliary/container_or_query.rs:8-25 | crates/biome_css_formatter/src/css/auxiliary/container_scroll_state_and_query.rs:11-28 | crates/biome_css_formatter/src/css/auxiliary/container_scroll_state_or_query.rs:11-28 | crates/biome_css_formatter/src/css/auxiliary/container_style_and_query.rs:12-29 | crates/biome_css_formatter/src/css/auxiliary/container_style_or_query.rs:12-29 | crates/biome_css_formatter/src/css/auxiliary/if_test_boolean_and_expr.rs:9-26 | crates/biome_css_formatter/src/css/auxiliary/if_test_boolean_or_expr.rs:9-26 | crates/biome_css_formatter/src/css/auxiliary/media_and_condition.rs:8-25 | crates/biome_css_formatter/src/css/auxiliary/media_and_type_query.rs:13-30 | crates/biome_css_formatter/src/css/auxiliary/media_or_condition.rs:8-25 | crates/biome_css_formatter/src/css/auxiliary/scope_range_interval.rs:8-25 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 12 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_formatter/src/css/auxiliary/container_scroll_state_and_query.rs:11\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026CssContainerAndQuery\u0060 in one and \u0060\u0026CssContainerOrQuery\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_css_formatter/src/css/auxiliary/media_and_type_query.rs:9\u0060 calls \u0060fmt_node\u0060, \u0060fmt_media_query_node\u0060, \u0060syntax\u0060 and \u0060crates/biome_css_formatter/src/css/auxiliary/container_and_query.rs:7\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/biome_css_formatter/src/css/auxiliary/container_and_query.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8572144e0445d7cf5bda62ff354f3ba85190f79b616e0d98db1fb65bf1401d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 6): crates/biome_css_formatter/src/css/auxiliary/container_not_query.rs:8-19 | crates/biome_css_formatter/src/css/auxiliary/container_scroll_state_not_query.rs:11-22 | crates/biome_css_formatter/src/css/auxiliary/container_style_not_query.rs:11-22 | crates/biome_css_formatter/src/css/auxiliary/scope_range_end.rs:8-19 | crates/biome_css_formatter/src/css/selectors/keyframes_range_selector.rs:12-23 | crates/biome_css_formatter/src/css/statements/layer_at_rule.rs:8-19 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 6 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 6 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_formatter/src/css/auxiliary/container_scroll_state_not_query.rs:11\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026CssContainerNotQuery\u0060 in one and \u0060\u0026CssContainerScrollStateNotQuery\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/biome_css_formatter/src/css/auxiliary/container_not_query.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b201014c4fc15a820ffcc51758995360e04d5730a2c8b89cb3efdde5be39938"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): crates/biome_css_formatter/src/css/auxiliary/declaration_important.rs:8-21 | crates/biome_css_formatter/src/css/value/color.rs:8-21 | crates/biome_css_formatter/src/scss/auxiliary/extend_optional_modifier.rs:12-25 | crates/biome_css_formatter/src/scss/value/hash_value.rs:9-22 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_formatter/src/scss/auxiliary/extend_optional_modifier.rs:12\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026CssDeclarationImportant\u0060 in one and \u0060\u0026CssColor\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/biome_css_formatter/src/css/auxiliary/declaration_important.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f6c1a12bde016ea49653d601083b33e9337fcfc0e8a0d76122a113be54ca0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_css_formatter/src/css/auxiliary/declaration_snippet_root.rs:13-20 | crates/biome_js_formatter/src/js/auxiliary/svelte_legacy_const_root.rs:7-14 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_formatter/src/css/auxiliary/declaration_snippet_root.rs:13\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060\u0026mut CssFormatter\u0060 in one and \u0060\u0026mut JsFormatter\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/biome_css_formatter/src/css/auxiliary/declaration_snippet_root.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"f73bba803617093aeafb8183758d524545ee54a8b13b8cbea7c29290d78f3b66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): crates/biome_css_formatter/src/css/auxiliary/font_feature_values_item.rs:12-28 | crates/biome_css_formatter/src/css/statements/margin_at_rule.rs:8-24 | crates/biome_css_formatter/src/scss/auxiliary/else_clause.rs:9-25 \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/biome_css_formatter/src/css/auxiliary/font_feature_values_item.rs:12\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026CssFontFeatureValuesItem\u0060 in one and \u0060\u0026CssMarginAtRule\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/biome_css_formatter/src/css/auxiliary/font_feature_values_item.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f019e969b4785feddad97187ef3886bca6d11251820aac3c712c869688a8ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 5): crates/biome_css_formatter/src/css/auxiliary/if_branch.rs:9-25 | crates/biome_graphql_formatter/src/graphql/auxiliary/object_field.rs:8-19 | crates/biome_grit_formatter/src/grit/auxiliary/bubble.rs:7-23 | crates/biome_html_formatter/src/svelte/auxiliary/rename_binding.rs:7-18 | crates/biome_html_formatter/src/vue/auxiliary/v_for_object_property_binding.rs:12-28 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 5 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_formatter/src/vue/auxiliary/v_for_object_property_binding.rs:12\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060\u0026mut CssFormatter\u0060 in one and \u0060\u0026mut GraphqlFormatter\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/biome_css_formatter/src/css/auxiliary/if_branch.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f6dc45173119aedd792772aceb9685fc398cce6ccbac69d3c63a208e906185"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 5): crates/biome_css_formatter/src/css/auxiliary/if_test_boolean_not_expr.rs:9-23 | crates/biome_css_formatter/src/css/auxiliary/media_not_condition.rs:8-22 | crates/biome_css_formatter/src/css/auxiliary/property_at_rule_declarator.rs:13-27 | crates/biome_css_formatter/src/css/selectors/pseudo_class_of_nth_selector.rs:12-26 | crates/biome_css_formatter/src/scss/auxiliary/include_using_clause.rs:9-23 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 5 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_formatter/src/css/auxiliary/property_at_rule_declarator.rs:13\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026CssIfTestBooleanNotExpr\u0060 in one and \u0060\u0026CssMediaNotCondition\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/biome_css_formatter/src/css/auxiliary/if_test_boolean_not_expr.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"854550f45098e3032d414aa43771194ca999333735098908cbca8f9125a71f10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_css_formatter/src/css/auxiliary/keyframes_scope_prefix.rs:8-19 | crates/biome_css_formatter/src/css/auxiliary/returns_statement.rs:10-21 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026CssKeyframesScopePrefix\u0060 in one and \u0060\u0026CssReturnsStatement\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/biome_css_formatter/src/css/auxiliary/keyframes_scope_prefix.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"94422381cc032b8ae48f898a0e31ca61d335d4a7dd07364017e264b7a611aa94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/biome_css_formatter/src/css/auxiliary/media_type.rs:8-12 | crates/biome_css_formatter/src/css/auxiliary/named_namespace_prefix.rs:8-12 | crates/biome_css_formatter/src/css/auxiliary/value_at_rule_import_specifier.rs:12-16 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_formatter/src/css/auxiliary/value_at_rule_import_specifier.rs:12\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026CssMediaType\u0060 in one and \u0060\u0026CssNamedNamespacePrefix\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/biome_css_formatter/src/css/auxiliary/media_type.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d0b6e2b37d9d6308992c751468c51f299e7ea5018648f26fb757c1a46ea0b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/biome_css_formatter/src/css/auxiliary/query_feature_boolean.rs:9-15 | crates/biome_css_formatter/src/css/pseudo/pseudo_class_identifier.rs:13-19 | crates/biome_css_formatter/src/css/pseudo/pseudo_element_identifier.rs:13-19 \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/biome_css_formatter/src/css/pseudo/pseudo_class_identifier.rs:13\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026CssQueryFeatureBoolean\u0060 in one and \u0060\u0026CssPseudoClassIdentifier\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/biome_css_formatter/src/css/auxiliary/query_feature_boolean.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d4e143eedf0aa64b59764ff39dd3b7c51db8752574a3c261a41a0d13f60118f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_css_formatter/src/css/auxiliary/starting_style_at_rule_declarator.rs:13-24 | crates/biome_css_formatter/src/css/auxiliary/view_transition_at_rule_declarator.rs:15-26 \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/biome_css_formatter/src/css/auxiliary/starting_style_at_rule_declarator.rs:13\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026CssStartingStyleAtRuleDeclarator\u0060 in one and \u0060\u0026CssViewTransitionAtRuleDeclarator\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/biome_css_formatter/src/css/auxiliary/starting_style_at_rule_declarator.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca510cb74b0d20fbdfc1cc908903748dfed6627f183879bfdf9d4e4506e1efe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/biome_css_formatter/src/css/auxiliary/syntax_component.rs:9-22 | crates/biome_css_formatter/src/tailwind/statements/slot_at_rule.rs:8-21 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026CssSyntaxComponent\u0060 in one and \u0060\u0026TwSlotAtRule\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/biome_css_formatter/src/css/auxiliary/syntax_component.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"93704512164c7c4165a10339e104b45c344393535d577ebeb051162a402a38ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 31): crates/biome_css_formatter/src/css/auxiliary/syntax_component_without_multiplier.rs:17-32 | crates/biome_css_formatter/src/css/auxiliary/unicode_range_interval.rs:8-15 | crates/biome_css_formatter/src/scss/auxiliary/parameter.rs:10-25 | crates/biome_css_formatter/src/tailwind/auxiliary/value_theme_reference.rs:7-22 | crates/biome_graphql_formatter/src/graphql/auxiliary/list_type.rs:8-23 | crates/biome_grit_formatter/src/grit/auxiliary/bubble_scope.rs:7-22 | crates/biome_grit_formatter/src/grit/auxiliary/language_flavor.rs:7-22 | crates/biome_grit_formatter/src/grit/auxiliary/like_threshold.rs:7-22 | crates/biome_grit_formatter/src/grit/auxiliary/map_accessor.rs:7-15 | crates/biome_grit_formatter/src/grit/auxiliary/named_arg.rs:7-15 | crates/biome_grit_formatter/src/grit/patterns/bracketed_pattern.rs:7-22 | crates/biome_grit_formatter/src/grit/patterns/regex_pattern_variables.rs:11-26 | crates/biome_html_formatter/src/angular/auxiliary/structural_directive.rs:11-21 | crates/biome_html_formatter/src/angular/auxiliary/template_ref_variable.rs:11-21 | crates/biome_html_formatter/src/astro/auxiliary/closing_fragment.rs:7-22 | crates/biome_html_formatter/src/astro/auxiliary/expression.rs:8-23 | crates/biome_html_formatter/src/astro/auxiliary/fragment.rs:7-22 | crates/biome_html_formatter/src/html/auxiliary/cdata_section.rs:7-22 | crates/biome_html_formatter/src/html/auxiliary/member_name.rs:7-15 | crates/biome_html_formatter/src/svelte/auxiliary/await_closing_block.rs:11-26 | crates/biome_html_formatter/src/svelte/auxiliary/declaration_block.rs:7-22 | crates/biome_html_formatter/src/svelte/auxiliary/each_closing_block.rs:7-22 | crates/biome_html_formatter/src/svelte/auxiliary/each_key.rs:7-22 | crates/biome_html_formatter/src/svelte/auxiliary/member_property.rs:7-15 | crates/biome_html_formatter/src/svelte/auxiliary/snippet_closing_block.rs:11-26 | crates/biome_html_formatter/src/svelte/value/template_attribute_value.rs:11-18 | crates/biome_html_formatter/src/vue/auxiliary/dynamic_argument.rs:8-23 | crates/biome_html_formatter/src/vue/auxiliary/v_bind_shorthand_directive.rs:12-20 | crates/biome_markdown_formatter/src/gfm/auxiliary/strikethrough.rs:8-23 | crates/biome_markdown_formatter/src/markdown/auxiliary/frontmatter.rs:7-22 | crates/biome_markdown_formatter/src/markdown/auxiliary/reference_link_label.rs:11-26 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 31 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 31 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_formatter/src/css/auxiliary/syntax_component_without_multiplier.rs:17\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026CssSyntaxComponentWithoutMultiplier\u0060 in one and \u0060\u0026CssUnicodeRangeInterval\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/biome_css_formatter/src/css/auxiliary/syntax_component_without_multiplier.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2f8fb98921b525c317c5c39c7af0aa4a66092081727eb2a8f7de95a93ecb5e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 7): crates/biome_css_formatter/src/css/auxiliary/syntax_type.rs:9-24 | crates/biome_grit_formatter/src/grit/predicates/bracketed_predicate.rs:7-21 | crates/biome_html_formatter/src/svelte/auxiliary/await_block.rs:7-22 | crates/biome_html_formatter/src/svelte/auxiliary/if_closing_block.rs:8-23 | crates/biome_html_formatter/src/svelte/auxiliary/key_closing_block.rs:8-23 | crates/biome_html_formatter/src/svelte/auxiliary/square_destructured_name.rs:11-26 | crates/biome_js_formatter/src/ts/module/import_type_assertion_block.rs:12-27 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 7 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 7 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_formatter/src/svelte/auxiliary/square_destructured_name.rs:11\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060\u0026mut CssFormatter\u0060 in one and \u0060\u0026mut GritFormatter\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/biome_css_formatter/src/css/auxiliary/syntax_type.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"df9ca37e525d060994c016b127d6eff3b0f9d146470d47f20dcc738b35b3b760"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): crates/biome_css_formatter/src/css/statements/charset_at_rule.rs:8-24 | crates/biome_css_formatter/src/tailwind/statements/config_at_rule.rs:8-24 | crates/biome_css_formatter/src/tailwind/statements/reference_at_rule.rs:8-24 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026CssCharsetAtRule\u0060 in one and \u0060\u0026TwConfigAtRule\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/biome_css_formatter/src/css/statements/charset_at_rule.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d29984e3faab182e38211f468df4824030e661dc5f1d7851ffa4ac01450a265"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/biome_css_formatter/src/css/statements/document_at_rule.rs:7-24 | crates/biome_css_formatter/src/css/statements/keyframes_at_rule.rs:8-25 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026CssDocumentAtRule\u0060 in one and \u0060\u0026CssKeyframesAtRule\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/biome_css_formatter/src/css/statements/document_at_rule.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c684601c4939d96e04929afe8d34cb22aeb47bdb53977dab4d7e6336af0f9fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/biome_css_formatter/src/scss/auxiliary/hide_clause.rs:9-23 | crates/biome_css_formatter/src/scss/auxiliary/show_clause.rs:9-23 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026ScssHideClause\u0060 in one and \u0060\u0026ScssShowClause\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/biome_css_formatter/src/scss/auxiliary/hide_clause.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ce0a49ddabff903ba0501ce72d5c4c9a687e8fdaa4d08d082c56f366259d98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/biome_css_formatter/src/scss/auxiliary/namespaced_variable.rs:9-24 | crates/biome_css_formatter/src/tailwind/auxiliary/functional_utility_name.rs:8-23 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026ScssNamespacedVariable\u0060 in one and \u0060\u0026TwFunctionalUtilityName\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/biome_css_formatter/src/scss/auxiliary/namespaced_variable.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"c38074dc13bcfab669111e564476e9b44b8d731abd22c1aba8a12323732a3c60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 4): crates/biome_css_formatter/src/scss/statements/debug_at_rule.rs:10-26 | crates/biome_css_formatter/src/scss/statements/error_at_rule.rs:10-26 | crates/biome_css_formatter/src/scss/statements/return_at_rule.rs:10-26 | crates/biome_css_formatter/src/scss/statements/warn_at_rule.rs:10-26 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026ScssDebugAtRule\u0060 in one and \u0060\u0026ScssErrorAtRule\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/biome_css_formatter/src/scss/statements/debug_at_rule.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d3b7ae041d471ae04c0f3f46e9a3ba09aac149c3af53b33fe134d9d5854401"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_css_formatter/src/separated.rs:56-65 | crates/biome_html_formatter/src/separated.rs:53-62 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_formatter/src/separated.rs:56\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_css_formatter/src/separated.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b599ff99e4f6430ee91cc48d76bf32d550ccb2ef45c243e0486a59a5689ae3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_css_formatter/src/separated.rs:125-134 | crates/biome_html_formatter/src/separated.rs:125-134 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_formatter/src/separated.rs:125\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_css_formatter/src/separated.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"db103853e89035cc8260067e1291a85619f7b2c2fdbf6b27c918232482e9329f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_css_parser/src/parser.rs:157-165 | crates/biome_html_parser/src/parser.rs:74-82 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060checkpoint\u0060 to \u0060CssParserCheckpoint\u0060 in one and \u0060HtmlParserCheckpoint\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/biome_css_parser/src/parser.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a59c30a8d3ef166c6076f393fa8d7d9087645e6308bbca99c5952fdae89c64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 12): crates/biome_css_parser/src/syntax/at_rule/color_profile.rs:18-29 | crates/biome_css_parser/src/syntax/at_rule/container/mod.rs:88-99 | crates/biome_css_parser/src/syntax/at_rule/counter_style.rs:18-29 | crates/biome_css_parser/src/syntax/at_rule/font_face.rs:15-26 | crates/biome_css_parser/src/syntax/at_rule/font_palette_values.rs:22-33 | crates/biome_css_parser/src/syntax/at_rule/function.rs:44-55 | crates/biome_css_parser/src/syntax/at_rule/position_try.rs:22-33 | crates/biome_css_parser/src/syntax/at_rule/property.rs:21-32 | crates/biome_css_parser/src/syntax/at_rule/scope.rs:19-30 | crates/biome_css_parser/src/syntax/at_rule/starting_style.rs:43-54 | crates/biome_css_parser/src/syntax/at_rule/supports/mod.rs:97-108 | crates/biome_css_parser/src/syntax/at_rule/view_transition.rs:16-27 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 12 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 12 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_parser/src/syntax/at_rule/color_profile.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"a406b44eea1a05a6fcc2b433cb0784ca439af6e16a7a73fce6385a4e950c60b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_css_parser/src/syntax/at_rule/container/mod.rs:192-198 | crates/biome_css_parser/src/syntax/scss/at_rule/media.rs:208-214 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_parser/src/syntax/at_rule/container/mod.rs:192\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_css_parser/src/syntax/at_rule/container/mod.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"4abf6b33bc226643479eccaf9aa873fff15de9bb4fd3392ea055de5983498b2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): crates/biome_css_parser/src/syntax/at_rule/document.rs:141-151 | crates/biome_css_parser/src/syntax/at_rule/import.rs:75-85 | crates/biome_css_parser/src/syntax/at_rule/namespace.rs:97-107 | crates/biome_tailwind_parser/src/syntax/css_value.rs:196-206 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_parser/src/syntax/at_rule/document.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac8b8d18b1fdffcd5219a0779ae21943888fac26ba2e6ac6533b398bc9972afe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_css_parser/src/syntax/at_rule/media.rs:134-143 | crates/biome_css_parser/src/syntax/scss/at_rule/container.rs:88-97 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_parser/src/syntax/at_rule/media.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bbf30e95bb5e83a1dbc44fb53b0fa1da5ab722223940ad77cfe55520c0877c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_css_parser/src/syntax/at_rule/value.rs:187-195 | crates/biome_tailwind_parser/src/syntax/css_value.rs:400-408 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060p\u0060 to \u0060\u0026mut CssParser\u0060 in one and \u0060\u0026mut TailwindParser\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/biome_css_parser/src/syntax/at_rule/value.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"61fcaa50125167de9b55eaee10572e3d747f9f21f68cc48723855f396401fa51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_css_parser/src/syntax/mod.rs:851-861 | crates/biome_css_parser/src/syntax/property/custom.rs:340-348 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_parser/src/syntax/mod.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"90036052dee79474a257deae6c0228db3cddb459cf709b37aefb5ea04eb10a05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_css_parser/src/syntax/scss/selector/pseudo_class_nth.rs:116-127 | crates/biome_css_parser/src/syntax/selector/pseudo_class/function_nth.rs:200-211 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_parser/src/syntax/scss/selector/pseudo_class_nth.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e2d74ffb6a624cc4bb013b3f91b48869a05052b5b6ab526a9db23ea12944868"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_css_parser/src/syntax/selector/pseudo_class/function_compound_selector_list.rs:74-80 | crates/biome_css_parser/src/syntax/selector/pseudo_class/function_value_list.rs:74-80 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_parser/src/syntax/selector/pseudo_class/function_compound_selector_list.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e5abfc97475a9a18fc17279f75997c411ed0c53e8b8c4d3545c0ddaccf8f3af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/biome_css_semantic/src/semantic_model/db.rs:162-169 | crates/biome_js_control_flow/src/db.rs:29-36 | crates/biome_js_semantic/src/db.rs:44-51 \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/biome_css_semantic/src/semantic_model/db.rs:162\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060db\u0060 to \u0060\u0026dyn ParseDb\u0060 in one and \u0060\u0026dyn LanguageDb\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/biome_css_semantic/src/semantic_model/db.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d4b959440214ca49e2f1697bf804542873739a4cd03e40e05d0909da810788e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/biome_css_syntax/src/scss_ext/expression.rs:154-159 | crates/biome_js_analyze/src/lint/suspicious/no_unassigned_variables.rs:136-141 | crates/biome_markdown_formatter/src/markdown/auxiliary/inline_italic.rs:69-74 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026JsVariableDeclaration\u0060 in one and \u0060\u0026MdInlineItalic\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/biome_css_syntax/src/scss_ext/expression.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb959df7383d0b967d6793d1f4a7ddd2c8e9d4c94794c0553ab64a807bbaae5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_graphql_formatter/src/graphql/auxiliary/argument.rs:8-19 | crates/biome_graphql_formatter/src/graphql/definitions/root_operation_type_definition.rs:16-32 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_graphql_formatter/src/graphql/definitions/root_operation_type_definition.rs:16\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026GraphqlArgument\u0060 in one and \u0060\u0026GraphqlRootOperationTypeDefinition\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/biome_graphql_formatter/src/graphql/auxiliary/argument.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"92453adad1149a3050c508f60c2ed5c5361fb273bd6e3eda442f332606fcf1ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): crates/biome_graphql_formatter/src/graphql/auxiliary/arguments.rs:8-23 | crates/biome_graphql_formatter/src/graphql/auxiliary/variable_definitions.rs:12-27 | crates/biome_graphql_formatter/src/graphql/definitions/arguments_definition.rs:12-27 \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/biome_graphql_formatter/src/graphql/auxiliary/variable_definitions.rs:12\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026GraphqlArguments\u0060 in one and \u0060\u0026GraphqlVariableDefinitions\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/biome_graphql_formatter/src/graphql/auxiliary/arguments.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc861755ef62cf3bf0be13962ba72b68564dfee478e06af6f1bb27ee7527e8b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/biome_graphql_formatter/src/graphql/auxiliary/directive.rs:8-16 | crates/biome_graphql_formatter/src/graphql/auxiliary/fragment_spread.rs:12-23 | crates/biome_js_formatter/src/jsx/attribute/shorthand_attribute.rs:9-24 | crates/biome_js_formatter/src/jsx/auxiliary/namespace_name.rs:10-18 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_graphql_formatter/src/graphql/auxiliary/fragment_spread.rs:12\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026GraphqlDirective\u0060 in one and \u0060\u0026GraphqlFragmentSpread\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/biome_graphql_formatter/src/graphql/auxiliary/directive.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a31752b4a7b39504753ae2a44c15d41b3e54d41041ec7a8ff3680a68e02156"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 4): crates/biome_graphql_formatter/src/graphql/auxiliary/root_operation_types.rs:12-27 | crates/biome_graphql_formatter/src/graphql/auxiliary/selection_set.rs:8-23 | crates/biome_graphql_formatter/src/graphql/definitions/enum_values_definition.rs:12-27 | crates/biome_graphql_formatter/src/graphql/definitions/fields_definition.rs:12-27 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_graphql_formatter/src/graphql/auxiliary/root_operation_types.rs:12\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026GraphqlRootOperationTypes\u0060 in one and \u0060\u0026GraphqlSelectionSet\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/biome_graphql_formatter/src/graphql/auxiliary/root_operation_types.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53f5ea35281c18c331fcf4e63bd63a85b15505a9ce17235f55282b337cfde1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_graphql_semantic/src/semantic_model/binding.rs:43-48 | crates/biome_graphql_semantic/src/semantic_model/reference.rs:46-52 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_graphql_semantic/src/semantic_model/binding.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8afa8d67f1ea67ff07b782956f89dba60a5564730266ca1b7d0c6e01c46d059"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 11): crates/biome_grit_formatter/src/grit/auxiliary/every.rs:7-14 | crates/biome_grit_formatter/src/grit/auxiliary/some.rs:7-14 | crates/biome_grit_formatter/src/grit/patterns/pattern_after.rs:7-14 | crates/biome_grit_formatter/src/grit/patterns/pattern_before.rs:7-14 | crates/biome_grit_formatter/src/grit/patterns/pattern_else_clause.rs:7-14 | crates/biome_grit_formatter/src/grit/patterns/pattern_includes.rs:7-14 | crates/biome_grit_formatter/src/grit/patterns/pattern_maybe.rs:7-14 | crates/biome_grit_formatter/src/grit/predicates/predicate_else_clause.rs:11-18 | crates/biome_grit_formatter/src/grit/predicates/predicate_maybe.rs:8-14 | crates/biome_grit_formatter/src/grit/predicates/predicate_return.rs:7-14 | crates/biome_html_formatter/src/vue/auxiliary/v_for_tuple_element.rs:8-15 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 11 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 11 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_grit_formatter/src/grit/predicates/predicate_else_clause.rs:11\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026GritEvery\u0060 in one and \u0060\u0026GritSome\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/biome_grit_formatter/src/grit/auxiliary/every.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a01ea7340defbfb056b9f0c25c5b36f50fbef5a96599c073e33e218edcf482"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 11): crates/biome_grit_formatter/src/grit/auxiliary/list_accessor.rs:8-25 | crates/biome_grit_formatter/src/grit/auxiliary/node_like.rs:7-24 | crates/biome_grit_formatter/src/grit/predicates/predicate_call.rs:8-24 | crates/biome_html_formatter/src/angular/auxiliary/event_binding.rs:7-23 | crates/biome_html_formatter/src/angular/auxiliary/property_binding.rs:7-23 | crates/biome_html_formatter/src/angular/auxiliary/two_way_binding.rs:7-23 | crates/biome_html_formatter/src/html/auxiliary/spread_attribute.rs:7-24 | crates/biome_html_formatter/src/svelte/auxiliary/if_block.rs:7-24 | crates/biome_html_formatter/src/vue/auxiliary/directive.rs:8-25 | crates/biome_html_formatter/src/vue/auxiliary/v_on_shorthand_directive.rs:12-29 | crates/biome_html_formatter/src/vue/auxiliary/v_slot_shorthand_directive.rs:12-29 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 11 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 11 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_formatter/src/vue/auxiliary/v_on_shorthand_directive.rs:12\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026GritListAccessor\u0060 in one and \u0060\u0026GritNodeLike\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/biome_grit_formatter/src/grit/auxiliary/list_accessor.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"d28914dcd8628e3b79c01f06acba6a82230dee48f5cf94b142d6d3172a9b3aea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 21): crates/biome_grit_formatter/src/grit/patterns/add_operation.rs:7-24 | crates/biome_grit_formatter/src/grit/patterns/assignment_as_pattern.rs:11-28 | crates/biome_grit_formatter/src/grit/patterns/div_operation.rs:7-24 | crates/biome_grit_formatter/src/grit/patterns/mod_operation.rs:7-24 | crates/biome_grit_formatter/src/grit/patterns/mul_operation.rs:7-24 | crates/biome_grit_formatter/src/grit/patterns/pattern_accumulate.rs:7-23 | crates/biome_grit_formatter/src/grit/patterns/pattern_as.rs:7-24 | crates/biome_grit_formatter/src/grit/patterns/pattern_limit.rs:7-24 | crates/biome_grit_formatter/src/grit/patterns/sub_operation.rs:7-24 | crates/biome_grit_formatter/src/grit/predicates/predicate_accumulate.rs:12-29 | crates/biome_grit_formatter/src/grit/predicates/predicate_assignment.rs:12-29 | crates/biome_grit_formatter/src/grit/predicates/predicate_equal.rs:8-25 | crates/biome_grit_formatter/src/grit/predicates/predicate_greater.rs:7-24 | crates/biome_grit_formatter/src/grit/predicates/predicate_greater_equal.rs:11-28 | crates/biome_grit_formatter/src/grit/predicates/predicate_less.rs:7-24 | crates/biome_grit_formatter/src/grit/predicates/predicate_less_equal.rs:7-24 | crates/biome_grit_formatter/src/grit/predicates/predicate_match.rs:7-24 | crates/biome_grit_formatter/src/grit/predicates/predicate_not_equal.rs:7-24 | crates/biome_html_formatter/src/svelte/auxiliary/curly_destructured_name.rs:12-29 | crates/biome_html_formatter/src/vue/auxiliary/v_for_array_binding.rs:8-25 | crates/biome_html_formatter/src/vue/auxiliary/v_for_object_binding.rs:8-25 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 21 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 21 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_grit_formatter/src/grit/patterns/assignment_as_pattern.rs:11\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026GritAddOperation\u0060 in one and \u0060\u0026GritAssignmentAsPattern\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/biome_grit_formatter/src/grit/patterns/add_operation.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e49e851d3648c655d79b96a04387fab6b9060bc95ab21dbfbd896834104ad7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/biome_grit_patterns/src/grit_css_parser.rs:22-28 | crates/biome_grit_patterns/src/grit_js_parser.rs:22-28 | crates/biome_grit_patterns/src/grit_json_parser.rs:21-27 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_grit_patterns/src/grit_css_parser.rs:22\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_patterns/src/grit_css_parser.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c0a749b60deab34821f6ef9fbcbbcc24708a00c4042b46dc1403a7e978c044"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/biome_grit_patterns/src/grit_node.rs:178-190 | crates/biome_grit_patterns/src/grit_node.rs:192-204 | crates/biome_grit_patterns/src/grit_target_node.rs:636-647 \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/biome_grit_patterns/src/grit_node.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"543a518af02e10766bb8b3f766cf181e65b9dd156a807fb03a3350d9f14cbe1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_grit_patterns/src/grit_target_language/js_target_language.rs:82-91 | crates/biome_grit_patterns/src/grit_target_language/json_target_language.rs:73-82 \u2014 before extracting anything, compare \u0060crates/biome_grit_patterns/src/grit_target_language/js_target_language.rs\u0060 and \u0060crates/biome_grit_patterns/src/grit_target_language/json_target_language.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_grit_patterns/src/grit_target_language/js_target_language.rs:82\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_patterns/src/grit_target_language/js_target_language.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e94f24d52d5908ef60728062000b5c7e6436c800932b040bced3bcd45f8b50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): crates/biome_grit_patterns/src/pattern_compiler/add_compiler.rs:12-17 | crates/biome_grit_patterns/src/pattern_compiler/divide_compiler.rs:12-17 | crates/biome_grit_patterns/src/pattern_compiler/modulo_compiler.rs:12-17 | crates/biome_grit_patterns/src/pattern_compiler/multiply_compiler.rs:12-17 | crates/biome_grit_patterns/src/pattern_compiler/subtract_compiler.rs:12-17 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 5 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_grit_patterns/src/pattern_compiler/add_compiler.rs:12\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_grit_patterns/src/pattern_compiler/add_compiler.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"625901c7566d3905ff4330ad63fb5df4a59608a7634d2672bb29674c86915bf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_html_analyze/src/lint/nursery/no_astro_conflicting_set_directives.rs:137-144 | crates/biome_js_analyze/src/assist/source/use_sorted_keys.rs:240-247 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/nursery/no_astro_conflicting_set_directives.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"f047030951ab4c28d04d1a31d8cb6ae59b34140efc20018fbf44f9f879c2ece8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/biome_html_analyze/src/lint/nursery/no_astro_set_html_directive.rs:63-69 | crates/biome_js_analyze/src/lint/nursery/no_astro_conflicting_set_directives.rs:131-137 | crates/biome_json_analyze/src/assist/source/use_sorted_keys.rs:260-266 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/nursery/no_astro_set_html_directive.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"3387e419fb898b8c0d1ebb68f709ce654f9bbfa911794001628800b812384a8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/biome_html_factory/src/make.rs:30-36 | crates/biome_js_factory/src/make.rs:81-87 | crates/biome_json_factory/src/make.rs:10-16 | crates/biome_markdown_factory/src/make.rs:5-11 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060kind\u0060 to \u0060HtmlSyntaxKind\u0060 in one and \u0060JsSyntaxKind\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/biome_html_factory/src/make.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"91fc9a37e65c48ee77c4c7ae453114ac649e9e4cf9eab939f3bcd046dcfae548"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/biome_html_formatter/src/lib.rs:50-57 | crates/biome_js_formatter/src/lib.rs:617-624 | crates/biome_markdown_formatter/src/lib.rs:282-289 \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/biome_html_formatter/src/lib.rs:50\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060options\u0060 to \u0060HtmlFormatOptions\u0060 in one and \u0060JsFormatOptions\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/biome_html_formatter/src/lib.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3716f7db43c35cc9a3ad4ca28eb4d44c6607573cd66e3be26cf13d984f42a66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 4): crates/biome_html_formatter/src/svelte/auxiliary/attach_attribute.rs:7-25 | crates/biome_html_formatter/src/svelte/auxiliary/const_block.rs:7-25 | crates/biome_html_formatter/src/svelte/auxiliary/html_block.rs:7-25 | crates/biome_html_formatter/src/svelte/auxiliary/render_block.rs:7-25 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026SvelteAttachAttribute\u0060 in one and \u0060\u0026SvelteConstBlock\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/biome_html_formatter/src/svelte/auxiliary/attach_attribute.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aab75cdc04030ea95276d6594835b6dad94b19c8573f95dcc94b0afdcc9c9da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/biome_html_formatter/src/utils/children.rs:42-54 | crates/biome_js_formatter/src/utils/jsx.rs:29-41 \u2014 before extracting anything, compare \u0060crates/biome_html_formatter/src/utils/children.rs\u0060 and \u0060crates/biome_js_formatter/src/utils/jsx.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_formatter/src/utils/children.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"278ecab4ae92c744255736baaff213b62f244b5e24268368602e17acdd1cbcd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_js_analyze/src/lint/correctness/no_constructor_return.rs:73-82 | crates/biome_js_analyze/src/lint/correctness/no_setter_return.rs:89-98 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/no_constructor_return.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"a677ab70e61311d02397a5265cfa6816e359759d0f79fc280f8cbacafdf4df9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/biome_js_analyze/src/lint/correctness/no_unused_imports.rs:638-642 | crates/biome_js_analyze/src/lint/correctness/use_hook_at_top_level.rs:681-685 \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/biome_js_analyze/src/lint/correctness/no_unused_imports.rs:638\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/correctness/no_unused_imports.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea2cff0c4cd8f90f69b2b58c07a725bda2443ed7e0f5352aa26fbaf389d992db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 8): crates/biome_js_formatter/src/js/assignments/parenthesized_assignment.rs:15-30 | crates/biome_js_formatter/src/js/expressions/import_meta_expression.rs:12-27 | crates/biome_js_formatter/src/js/expressions/new_target_expression.rs:12-27 | crates/biome_js_formatter/src/jsx/objects/member_name.rs:10-18 | crates/biome_js_formatter/src/ts/auxiliary/qualified_module_name.rs:11-19 | crates/biome_js_formatter/src/ts/auxiliary/qualified_name.rs:11-19 | crates/biome_js_formatter/src/ts/types/array_type.rs:10-24 | crates/biome_js_formatter/src/ts/types/template_literal_type.rs:11-26 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 8 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 8 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_formatter/src/js/assignments/parenthesized_assignment.rs:15\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026JsParenthesizedAssignment\u0060 in one and \u0060\u0026JsImportMetaExpression\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/biome_js_formatter/src/js/assignments/parenthesized_assignment.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff76b776c387cc078c6a9b869946456d5a016ef1e5efe5f5af1ff6fb76fb0779"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 17): crates/biome_js_formatter/src/js/auxiliary/decorator.rs:8-15 | crates/biome_js_formatter/src/js/auxiliary/private_name.rs:11-18 | crates/biome_js_formatter/src/js/auxiliary/spread.rs:11-18 | crates/biome_js_formatter/src/js/bindings/array_binding_pattern_rest_element.rs:15-22 | crates/biome_js_formatter/src/js/expressions/post_update_expression.rs:12-19 | crates/biome_js_formatter/src/js/expressions/yield_expression.rs:12-19 | crates/biome_js_formatter/src/js/objects/private_class_member_name.rs:11-18 | crates/biome_js_formatter/src/ts/assignments/non_null_assertion_assignment.rs:16-22 | crates/biome_js_formatter/src/ts/auxiliary/definite_property_annotation.rs:15-22 | crates/biome_js_formatter/src/ts/auxiliary/definite_variable_annotation.rs:15-22 | crates/biome_js_formatter/src/ts/auxiliary/mapped_type_optional_modifier_clause.rs:17-24 | crates/biome_js_formatter/src/ts/auxiliary/mapped_type_readonly_modifier_clause.rs:17-23 | crates/biome_js_formatter/src/ts/auxiliary/optional_property_annotation.rs:15-22 | crates/biome_js_formatter/src/ts/bindings/this_parameter.rs:10-17 | crates/biome_js_formatter/src/ts/expressions/instantiation_expression.rs:13-20 | crates/biome_js_formatter/src/ts/expressions/non_null_assertion_expression.rs:16-23 | crates/biome_js_formatter/src/ts/types/reference_type.rs:10-17 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 17 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 17 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_formatter/src/js/bindings/array_binding_pattern_rest_element.rs:15\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026JsDecorator\u0060 in one and \u0060\u0026JsPrivateName\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/biome_js_formatter/src/js/auxiliary/decorator.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"e11a9cafadd5eca2368a0b6b13dc220f156265d6ef5462e684469c2e09c772a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/biome_js_formatter/src/js/auxiliary/finally_clause.rs:11-18 | crates/biome_js_formatter/src/js/expressions/yield_argument.rs:11-18 | crates/biome_js_formatter/src/js/module/export_as_clause.rs:11-18 | crates/biome_js_formatter/src/ts/statements/declare_statement.rs:11-17 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026JsFinallyClause\u0060 in one and \u0060\u0026JsYieldArgument\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/biome_js_formatter/src/js/auxiliary/finally_clause.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"cadd01f798724020c983c4f4751febd6e51fdbcded4afd7a696e239731c0ad07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/biome_js_formatter/src/js/auxiliary/variable_declaration_clause.rs:16-29 | crates/biome_js_formatter/src/js/statements/variable_statement.rs:13-26 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_formatter/src/js/auxiliary/variable_declaration_clause.rs:16\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026JsVariableDeclarationClause\u0060 in one and \u0060\u0026JsVariableStatement\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/biome_js_formatter/src/js/auxiliary/variable_declaration_clause.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2531622ea223809c01a7235b6f2c044cfac804eb87a92c0e43b8df984b96e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_js_formatter/src/js/bindings/object_binding_pattern_rest.rs:15-22 | crates/biome_js_formatter/src/js/expressions/pre_update_expression.rs:12-19 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_formatter/src/js/bindings/object_binding_pattern_rest.rs:15\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026JsObjectBindingPatternRest\u0060 in one and \u0060\u0026JsPreUpdateExpression\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/biome_js_formatter/src/js/bindings/object_binding_pattern_rest.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ac6e9486da49bd3cee5720d6f530433dbfe33b8b81476a64b9dbb3cd90e5acc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/biome_js_formatter/src/js/bindings/rest_parameter.rs:11-28 | crates/biome_js_formatter/src/ts/auxiliary/external_module_reference.rs:15-32 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_formatter/src/ts/auxiliary/external_module_reference.rs:15\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026JsRestParameter\u0060 in one and \u0060\u0026TsExternalModuleReference\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/biome_js_formatter/src/js/bindings/rest_parameter.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"a176b6553bf305d9e3b5b1a11055a5a6f573aacf9fa916d8118345a555ea3f3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): crates/biome_js_formatter/src/js/module/export_default_expression_clause.rs:17-33 | crates/biome_js_formatter/src/js/module/import.rs:13-29 | crates/biome_js_formatter/src/ts/module/export_assignment_clause.rs:12-28 \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/biome_js_formatter/src/js/module/export_default_expression_clause.rs:17\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026JsExportDefaultExpressionClause\u0060 in one and \u0060\u0026JsImport\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/biome_js_formatter/src/js/module/export_default_expression_clause.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"34efd7ebea8f8963d310efb47b5fdfcfaac2f0a8b27f03d325ccd451a3e22a54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_js_formatter/src/js/module/module_source.rs:12-22 | crates/biome_js_formatter/src/ts/types/string_literal_type.rs:11-21 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026JsModuleSource\u0060 in one and \u0060\u0026TsStringLiteralType\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/biome_js_formatter/src/js/module/module_source.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"094dd0056fa1d8a778ffc46a3b8fdf027dc421aaf0779ef064876e162c71d231"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/biome_js_formatter/src/js/module/namespace_import_specifier.rs:15-32 | crates/biome_js_formatter/src/ts/types/predicate_return_type.rs:11-27 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_formatter/src/js/module/namespace_import_specifier.rs:15\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026JsNamespaceImportSpecifier\u0060 in one and \u0060\u0026TsPredicateReturnType\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/biome_js_formatter/src/js/module/namespace_import_specifier.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"002527933f2ecdac070d1da748a1d522f2fcb421c567574ac9a8d8c6e4739bfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/biome_js_formatter/src/js/statements/try_statement.rs:11-28 | crates/biome_js_formatter/src/ts/declarations/module_declaration.rs:11-28 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026JsTryStatement\u0060 in one and \u0060\u0026TsModuleDeclaration\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/biome_js_formatter/src/js/statements/try_statement.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"69d5e7a6d3049f3c59ebfafc1431da30f44f12a158011181dc52c39e6d333be5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_js_formatter/src/ts/auxiliary/method_signature_type_member.rs:16-24 | crates/biome_js_formatter/src/ts/declarations/declare_function_export_default_declaration.rs:16-24 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_formatter/src/ts/auxiliary/method_signature_type_member.rs:16\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026TsMethodSignatureTypeMember\u0060 in one and \u0060\u0026TsDeclareFunctionExportDefaultDeclaration\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/biome_js_formatter/src/ts/auxiliary/method_signature_type_member.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"c04923c92d648f62b1440d8bc38c23cad5c927193951c68f82905869f107553d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/biome_js_formatter/src/ts/auxiliary/optional_tuple_type_element.rs:14-22 | crates/biome_js_formatter/src/ts/auxiliary/rest_tuple_type_element.rs:10-18 | crates/biome_js_formatter/src/ts/bindings/index_signature_parameter.rs:14-23 \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/biome_js_formatter/src/ts/auxiliary/optional_tuple_type_element.rs:14\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026TsOptionalTupleTypeElement\u0060 in one and \u0060\u0026TsRestTupleTypeElement\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/biome_js_formatter/src/ts/auxiliary/optional_tuple_type_element.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"92113d76eecd2d2221a0c0d3ed8615d8862f7a81cf5f01e9884c0c5c550aee0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_js_formatter/src/ts/expressions/as_expression.rs:15-23 | crates/biome_js_formatter/src/ts/expressions/satisfies_expression.rs:12-20 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026TsAsExpression\u0060 in one and \u0060\u0026TsSatisfiesExpression\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/biome_js_formatter/src/ts/expressions/as_expression.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"7880b829ec00c74de3e735df3886fa46fb254685a549ceb19f2c845edc709985"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_rowan/src/cursor/node.rs:41-52 | crates/biome_rowan/src/cursor/token.rs:23-34 \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/biome_rowan/src/cursor/node.rs:41\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_rowan/src/cursor/node.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dbc6050faf86db2ed2d69e93a6f56d3f0bedb62b24d82badcd65324a68dea5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_rowan/src/green/node.rs:94-100 | crates/biome_rowan/src/green/token.rs:54-60 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_rowan/src/green/node.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"492925dd8042e036c9776a76cfc4b259c537a497386ed571c9cbdf15a5a43465"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_rowan/src/green/node.rs:338-344 | crates/biome_rowan/src/green/token.rs:213-219 \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/biome_rowan/src/green/node.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0094ff2d1ba7c061182824cb931193a07c5e0ad2b69ba2a0dcee2c7c7e054c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_rowan/src/green/node.rs:412-418 | crates/biome_rowan/src/green/token.rs:200-206 \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/biome_rowan/src/green/node.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"71381acbcd8f0fe7a937fd89e912a8420b3fac4d70443af960e0232c2be45c8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_service/src/file_handlers/css.rs:67-78 | crates/biome_service/src/file_handlers/graphql.rs:61-72 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/css.rs\u0060 and \u0060crates/biome_service/src/file_handlers/graphql.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 202 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060configuration\u0060 to \u0060CssFormatterConfiguration\u0060 in one and \u0060GraphqlFormatterConfiguration\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/biome_service/src/file_handlers/css.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"479df94232ec68bdc49866b5912236e6622309095a083dcc12fdc6b35bd1add4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 15): crates/biome_service/src/file_handlers/css.rs:378-383 | crates/biome_service/src/file_handlers/css.rs:396-401 | crates/biome_service/src/file_handlers/graphql.rs:114-119 | crates/biome_service/src/file_handlers/graphql.rs:132-137 | crates/biome_service/src/file_handlers/grit.rs:263-268 | crates/biome_service/src/file_handlers/html.rs:575-580 | crates/biome_service/src/file_handlers/html.rs:593-598 | crates/biome_service/src/file_handlers/javascript.rs:580-585 | crates/biome_service/src/file_handlers/javascript.rs:598-603 | crates/biome_service/src/file_handlers/json.rs:140-145 | crates/biome_service/src/file_handlers/json.rs:158-163 | crates/biome_service/src/file_handlers/md.rs:300-305 | crates/biome_service/src/file_handlers/md.rs:318-323 | crates/biome_service/src/file_handlers/yaml.rs:255-260 | crates/biome_service/src/file_handlers/yaml.rs:299-304 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/css.rs\u0060 and \u0060crates/biome_service/src/file_handlers/graphql.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 202 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_service/src/file_handlers/css.rs:378\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_service/src/file_handlers/css.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"61eb0654fce2109b4d2e99bcae197368ba2d47b1219bfd1e9a869e611d0a8ee1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 8): crates/biome_service/src/file_handlers/css.rs:540-547 | crates/biome_service/src/file_handlers/graphql.rs:437-444 | crates/biome_service/src/file_handlers/grit.rs:375-382 | crates/biome_service/src/file_handlers/html.rs:758-765 | crates/biome_service/src/file_handlers/javascript.rs:1038-1045 | crates/biome_service/src/file_handlers/json.rs:510-517 | crates/biome_service/src/file_handlers/md.rs:503-510 | crates/biome_service/src/file_handlers/yaml.rs:413-420 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/css.rs\u0060 and \u0060crates/biome_service/src/file_handlers/graphql.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 202 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_service/src/file_handlers/css.rs:540\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_service/src/file_handlers/css.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"d95607acceb2aaceb8dd63bd377540144f08f0095c659bd8f648d42d6c71639b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/biome_service/src/file_handlers/css.rs:601-607 | crates/biome_service/src/file_handlers/graphql.rs:488-494 | crates/biome_service/src/file_handlers/grit.rs:427-433 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/css.rs\u0060 and \u0060crates/biome_service/src/file_handlers/graphql.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 202 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_service/src/file_handlers/css.rs:601\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_service/src/file_handlers/css.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a8bbe9109f3487efcd11f7e0008299215bf7b87791c642f012b580ccf2c654"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_service/src/file_handlers/graphql.rs:424-431 | crates/biome_service/src/file_handlers/grit.rs:362-369 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/graphql.rs\u0060 and \u0060crates/biome_service/src/file_handlers/grit.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 111 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_service/src/file_handlers/graphql.rs:424\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_service/src/file_handlers/graphql.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9e1ea3bc674f1d0537e2478c793cf3d5cfeac6253649a41755070fc0058ee2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): crates/biome_yaml_formatter/src/yaml/auxiliary/block_mapping.rs:7-22 | crates/biome_yaml_formatter/src/yaml/auxiliary/block_sequence.rs:7-22 | crates/biome_yaml_formatter/src/yaml/auxiliary/flow_in_block_node.rs:7-22 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026YamlBlockMapping\u0060 in one and \u0060\u0026YamlBlockSequence\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/biome_yaml_formatter/src/yaml/auxiliary/block_mapping.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c58c9eb15018056cdc50bc975bcedacf0c020d7a5d9af863967f583ba55031"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/biome_yaml_formatter/src/yaml/auxiliary/double_quoted_scalar.rs:8-16 | crates/biome_yaml_formatter/src/yaml/auxiliary/plain_scalar.rs:8-16 | crates/biome_yaml_formatter/src/yaml/auxiliary/single_quoted_scalar.rs:8-16 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026YamlDoubleQuotedScalar\u0060 in one and \u0060\u0026YamlPlainScalar\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/biome_yaml_formatter/src/yaml/auxiliary/double_quoted_scalar.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"f65378172b8f3344d48be5b03a0b30c6bc69d872fc69a9a672b73d88356aa1fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/biome_cli/src/commands/check.rs:211-227 | crates/biome_cli/src/commands/lint.rs:219-236 \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/biome_cli/src/commands/check.rs:211\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/commands/check.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"c971e4c6527e9f4177042f3a31d0e0fd2b6af4ed8b30a7cc34bfa059b505ba83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/biome_service/src/file_handlers/md.rs:656-673 | crates/biome_service/src/file_handlers/yaml.rs:519-536 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/md.rs\u0060 and \u0060crates/biome_service/src/file_handlers/yaml.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 248 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_service/src/file_handlers/md.rs:656\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/biome_service/src/file_handlers/md.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"39be83ed45c68be90f94b122ad6176a70f54efd1398fea79d651b814d4a9373e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/biome_service/src/file_handlers/graphql.rs:621-637 | crates/biome_service/src/file_handlers/html.rs:1248-1264 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/graphql.rs\u0060 and \u0060crates/biome_service/src/file_handlers/html.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 213 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_service/src/file_handlers/graphql.rs:621\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/biome_service/src/file_handlers/graphql.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"430d56da9df811e5606a45b8009548011cecbea4ecdbd943055f52d954a6e02c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): xtask/codegen/src/generate_global_types/lower/overrides.rs:381-396 | xtask/codegen/src/generate_global_types/lower/overrides.rs:1237-1251 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060xtask/codegen/src/generate_global_types/lower/overrides.rs:381\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/generate_global_types/lower/overrides.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"77aa5dba03833e1b202d64bdc9596e7a4885ab5165941b739e9bfaa6f1c4dcce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/biome_react_compiler/src/convert_ast/expressions.rs:813-827 | crates/biome_react_compiler/src/convert_ast/expressions.rs:848-862 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_react_compiler/src/convert_ast/expressions.rs:813\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/biome_react_compiler/src/convert_ast/expressions.rs"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"907a0eab436a0564ab79657d6e8c6a3b2f999fe9a112a3661db54a3744420741"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 5): crates/biome_graphql_analyze/src/lint/correctness/no_duplicate_argument_names.rs:59-73 | crates/biome_graphql_analyze/src/lint/correctness/no_duplicate_enum_value_names.rs:80-94 | crates/biome_graphql_analyze/src/lint/correctness/no_duplicate_field_definition_names.rs:113-127 | crates/biome_graphql_analyze/src/lint/correctness/no_duplicate_input_field_names.rs:59-73 | crates/biome_graphql_analyze/src/lint/suspicious/no_duplicate_graphql_operation_name.rs:81-95 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 5 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_graphql_analyze/src/lint/correctness/no_duplicate_argument_names.rs:59\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_graphql_analyze/src/lint/correctness/no_duplicate_argument_names.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"7abbb10de50889ef38896ec7f179b91a521d48f6288df23b402c1cd958af05eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_css_analyze/src/services/module_graph.rs:34-47 | crates/biome_js_analyze/src/services/database.rs:45-55 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_analyze/src/services/module_graph.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d97bcb50f261aa46d23278d875c51e2f77476ef23a4e3d6b15be677c4c961f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (1\u20138 lines \u00D7 5): crates/biome_js_runtime/src/semantic.rs:174-174 | crates/biome_js_runtime/src/semantic.rs:243-256 | crates/biome_js_runtime/src/semantic.rs:265-265 | crates/biome_js_runtime/src/semantic.rs:297-304 | crates/biome_js_runtime/src/semantic.rs:313-313 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_runtime/src/semantic.rs:174\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_runtime/src/semantic.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa617a3ca32030a8dd39f2720fc29771cb5eac790cbf61cb07adc2109ab9414c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/biome_js_analyze/src/lint/suspicious/no_document_import_in_page.rs:62-75 | crates/biome_js_analyze/src/lint/suspicious/no_head_import_in_document.rs:75-88 \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/biome_js_analyze/src/lint/suspicious/no_document_import_in_page.rs:62\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/suspicious/no_document_import_in_page.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"95a0858210215acfab25e39616cec33818139d6bedabae3f0b0f83cdb5e39556"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/use_regexp_exec.rs:52-64 | crates/biome_js_analyze/src/lint/suspicious/no_undeclared_env_vars.rs:252-263 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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/biome_js_analyze/src/lint/nursery/use_regexp_exec.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"afa83c224efdb10bc1216a502900a26e5bde535ba85b777d13e63c62a577598f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/no_invalid_remove_event_listener.rs:91-96 | crates/biome_js_analyze/src/lint/nursery/use_regexp_exec.rs:52-64 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_invalid_remove_event_listener.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b9575189bd4ca3ba1945fbcdb3914d47010d67ab7cfdcd92d5eafaba42c0aca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/biome_html_analyze/src/lint/style/use_vue_consistent_v_bind_style.rs:106-118 | crates/biome_html_analyze/src/lint/style/use_vue_consistent_v_on_style.rs:105-117 \u2014 before extracting anything, compare \u0060crates/biome_html_analyze/src/lint/style/use_vue_consistent_v_bind_style.rs\u0060 and \u0060crates/biome_html_analyze/src/lint/style/use_vue_consistent_v_on_style.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_analyze/src/lint/style/use_vue_consistent_v_bind_style.rs:106\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/biome_html_analyze/src/lint/style/use_vue_consistent_v_bind_style.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"439d907ecfe9208d3db0a2f8b2f4d7e8d31d801a3117eb939ca5925b323d5690"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/biome_module_graph/src/format_module_graph.rs:55-66 | crates/biome_module_graph/src/format_module_graph.rs:609-620 | crates/biome_module_graph/src/format_module_graph.rs:785-796 \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/biome_module_graph/src/format_module_graph.rs:55\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/biome_module_graph/src/format_module_graph.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc74af59fdc1a91be813739ff5b76544221a0c46c92814cc4ab12406372a0e21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/biome_migrate/src/analyzers/organize_imports.rs:120-131 | crates/biome_migrate/src/analyzers/schema.rs:73-84 | crates/biome_migrate/src/analyzers/trailing_comma.rs:49-60 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_migrate/src/analyzers/organize_imports.rs:120\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/biome_migrate/src/analyzers/organize_imports.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"82fbbd77323f85d4b129880d5045ec2b32c3151e8eeb29727c9a0d664d0fd984"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_formatter/src/comments.rs:1283-1294 | crates/biome_formatter/src/comments.rs:1337-1348 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_formatter/src/comments.rs:1283\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_formatter/src/comments.rs"},"region":{"startLine":1283}}}],"partialFingerprints":{"codehealthFindingId/v1":"003adb47a8e0b002aa2d57e459f68867f1c31465cb2108e5ba962d3957743f4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_css_analyze/src/lint/suspicious/no_duplicate_custom_properties.rs:101-112 | crates/biome_css_analyze/src/lint/suspicious/no_duplicate_properties.rs:110-121 \u2014 before extracting anything, compare \u0060crates/biome_css_analyze/src/lint/suspicious/no_duplicate_custom_properties.rs\u0060 and \u0060crates/biome_css_analyze/src/lint/suspicious/no_duplicate_properties.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_css_analyze/src/lint/suspicious/no_duplicate_custom_properties.rs:101\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_css_analyze/src/lint/suspicious/no_duplicate_custom_properties.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0eae561e87d1315362b2be4c9a497156225a9f43057b16312b7cc98caa40d79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_html_analyze/src/assist/source/use_sorted_attributes.rs:233-244 | crates/biome_js_analyze/src/assist/source/use_sorted_attributes.rs:209-220 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_analyze/src/assist/source/use_sorted_attributes.rs:233\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/biome_html_analyze/src/assist/source/use_sorted_attributes.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b973468038877dfa1f7484736b2d4f4642206377c9796754823b26f76edab91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_js_analyze/src/lint/complexity/no_implicit_coercions.rs:616-627 | crates/biome_js_analyze/src/lint/complexity/no_implicit_coercions.rs:630-641 \u2014 both copies are in the same file, so extract the block 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/biome_js_analyze/src/lint/complexity/no_implicit_coercions.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe30ab43511a68f73ac59b6cd58b1c895a17907852f6f267adb2dcda3ce3cc69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/use_react_function_component_definition.rs:405-416 | crates/biome_js_analyze/src/lint/nursery/use_react_function_component_definition.rs:500-511 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/nursery/use_react_function_component_definition.rs:405\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_react_function_component_definition.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e94b38802d227f175cce2725cd76de59dc21744ccee4988eb9813ea6259fec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_analyze/src/diagnostics.rs:477-488 | crates/biome_analyze/src/diagnostics.rs:512-523 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_analyze/src/diagnostics.rs:477\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060fmt\u0060 to \u0060\u0026mut std::fmt::Formatter\u0060 in one and \u0060\u0026mut biome_console::fmt::Formatter\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/biome_analyze/src/diagnostics.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c15d28a2fdcda8f9da0568d7cb60b75da6c510e2ad301b2adab77aae96fa52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): crates/biome_js_analyze/src/lint/style/no_playwright_wait_for_selector.rs:85-95 | crates/biome_js_analyze/src/lint/suspicious/no_playwright_page_pause.rs:81-91 | crates/biome_js_analyze/src/lint/suspicious/no_playwright_wait_for_navigation.rs:80-90 | crates/biome_js_analyze/src/lint/suspicious/no_playwright_wait_for_timeout.rs:80-90 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/style/no_playwright_wait_for_selector.rs:85\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/style/no_playwright_wait_for_selector.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"adad6c0d5783b027bf455ee83e9fa321b285f52f6d72cd65d5798ced757459e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/biome_module_graph/src/db/queries/type_inference/lookups.rs:145-155 | crates/biome_module_graph/src/db/queries/type_inference/lookups.rs:176-186 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_module_graph/src/db/queries/type_inference/lookups.rs:145\u0060 it does not close everything it opens, so those exact 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/biome_module_graph/src/db/queries/type_inference/lookups.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"4acfde3b7a5de1d3380a21add0e95bbd04c767e90f78ebc7c35cdd762ff9d9ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_json_analyze/src/assist/source/use_sorted_package_json/sorters/eslint_config.rs:25-31 | crates/biome_json_analyze/src/assist/source/use_sorted_package_json/sorters/eslint_config.rs:35-44 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_json_analyze/src/assist/source/use_sorted_package_json/sorters/eslint_config.rs:25\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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/biome_json_analyze/src/assist/source/use_sorted_package_json/sorters/eslint_config.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb5583be8fcf567bd3b66be33527890e8b871d3b714acbd700d26380838bbc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): crates/biome_module_graph/src/format_module_graph.rs:54-63 | crates/biome_module_graph/src/format_module_graph.rs:608-617 | crates/biome_module_graph/src/format_module_graph.rs:772-781 | crates/biome_module_graph/src/format_module_graph.rs:784-793 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/format_module_graph.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"867f866b8f386e4c82e4fc896c4dc5d1897750e21d648aff1e00d3ccb692e4a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/biome_js_analyze/src/lint/style/no_playwright_wait_for_selector.rs:74-82 | crates/biome_js_analyze/src/lint/suspicious/no_playwright_page_pause.rs:69-78 | crates/biome_js_analyze/src/lint/suspicious/no_playwright_wait_for_navigation.rs:69-77 | crates/biome_js_analyze/src/lint/suspicious/no_playwright_wait_for_timeout.rs:69-77 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/style/no_playwright_wait_for_selector.rs:74\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/no_playwright_wait_for_selector.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"8827bf8e7189dda6f9ccf8e6c5fe813b046ecd78fc778226ec599e22775a212f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20137 lines \u00D7 4): crates/biome_html_analyze/src/lint/nursery/no_tailwind_legacy_utilities.rs:133-139 | crates/biome_html_analyze/src/lint/nursery/no_tailwind_restricted_classes.rs:241-243 | crates/biome_html_analyze/src/lint/nursery/use_tailwind_shorthand_classes.rs:145-154 | crates/biome_html_analyze/src/lint/nursery/use_tailwind_variables_shorthand.rs:102-108 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_analyze/src/lint/nursery/no_tailwind_legacy_utilities.rs:133\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_html_analyze/src/lint/nursery/no_tailwind_legacy_utilities.rs:133\u0060 calls \u0060Some\u0060 and \u0060crates/biome_html_analyze/src/lint/nursery/no_tailwind_restricted_classes.rs:241\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/biome_html_analyze/src/lint/nursery/no_tailwind_legacy_utilities.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b3f41129b783ec08a9714e9506fc320506217545218c415ab7c24daf38948a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_html_analyze/src/lint/style/use_vue_consistent_v_bind_style.rs:172-181 | crates/biome_html_analyze/src/lint/style/use_vue_consistent_v_on_style.rs:183-192 \u2014 before extracting anything, compare \u0060crates/biome_html_analyze/src/lint/style/use_vue_consistent_v_bind_style.rs\u0060 and \u0060crates/biome_html_analyze/src/lint/style/use_vue_consistent_v_on_style.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_analyze/src/lint/style/use_vue_consistent_v_bind_style.rs:172\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/biome_html_analyze/src/lint/style/use_vue_consistent_v_bind_style.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4a0466eb3f3b4ab5d18c50061710f1b7977fffa0033eb4c7d06ada89ede2f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_html_analyze/src/lint/nursery/no_disabled_attribute.rs:191-200 | crates/biome_js_analyze/src/lint/nursery/no_disabled_attribute.rs:187-196 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_analyze/src/lint/nursery/no_disabled_attribute.rs:191\u0060 it begins part-way through the construct above it, so those exact 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/biome_js_analyze/src/lint/nursery/no_disabled_attribute.rs:199\u0060 calls \u0060query\u0060 and \u0060crates/biome_html_analyze/src/lint/nursery/no_disabled_attribute.rs:204\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/biome_html_analyze/src/lint/nursery/no_disabled_attribute.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"8791eddb6c1b289f54558c74131420df4db8328446600798e97a3c2356767d64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/biome_react_compiler/src/convert_ast/expressions.rs:476-484 | crates/biome_react_compiler/src/convert_ast/expressions.rs:488-496 | crates/biome_react_compiler/src/convert_ast/expressions.rs:511-519 \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/biome_react_compiler/src/convert_ast/expressions.rs:476\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/biome_react_compiler/src/convert_ast/expressions.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1c5efdbf5fbcea7920b258f022b58cf9881267a58d4c5f7ee328f63a53063b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_module_graph/src/db/queries/type_inference/lookups.rs:45-53 | crates/biome_module_graph/src/db/queries/type_inference/lookups.rs:74-82 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_module_graph/src/db/queries/type_inference/lookups.rs:45\u0060 it does not close everything it opens, so those exact 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/biome_module_graph/src/db/queries/type_inference/lookups.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"71232e7b62b88ad031b42cad569d0eccb38b7a0bbea38ac2aae8f6b3d0f69d79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/no_boolean_sort_comparator.rs:169-177 | crates/biome_js_analyze/src/lint/nursery/no_negation_in_equality_check.rs:350-358 \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/biome_js_analyze/src/lint/nursery/no_boolean_sort_comparator.rs:169\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_boolean_sort_comparator.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a73caa04790141f14d91ce6c9798fb5b0d6fdd4add4fb480bee5b305ee8c4ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/use_vue_consistent_prop_name_casing.rs:159-167 | crates/biome_js_analyze/src/lint/nursery/use_vue_registered_component_name_casing.rs:136-144 \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/biome_js_analyze/src/lint/nursery/use_vue_consistent_prop_name_casing.rs:159\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/nursery/use_vue_consistent_prop_name_casing.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"80a213b58e0d9e73a517ee9f0dbf71b7d2835ed07b3ebc3148855ec73740336c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_js_analyze/src/lint/complexity/no_implicit_coercions.rs:406-414 | crates/biome_js_analyze/src/lint/complexity/no_implicit_coercions.rs:429-437 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/complexity/no_implicit_coercions.rs:406\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/biome_js_analyze/src/lint/complexity/no_implicit_coercions.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dab2b4137492ea774db97c3d55be01b7fc1d3eccf4560b3403be747a80e0dd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/no_vue_expose_after_await.rs:258-266 | crates/biome_js_analyze/src/lint/nursery/no_vue_multiple_slot_args.rs:183-191 \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/biome_js_analyze/src/lint/nursery/no_vue_expose_after_await.rs:258\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/nursery/no_vue_expose_after_await.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7ec5508aa8e3b40d46b330dccaae202a8c23575ac27801f3bdff296a1fcd6de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/biome_js_analyze/src/lint/nursery/no_boolean_sort_comparator.rs:170-178 | crates/biome_js_analyze/src/lint/nursery/no_negation_in_equality_check.rs:351-359 | crates/biome_js_analyze/src/lint/suspicious/no_empty_interface.rs:104-111 \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/biome_js_analyze/src/lint/nursery/no_boolean_sort_comparator.rs:170\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/no_boolean_sort_comparator.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"e01cb43b2db46c9cf84bc7a91c1f55fb2f5448c6fe94a4654602288c29843ad2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/biome_cli/src/service/unix.rs:88-96 | crates/biome_cli/src/service/windows.rs:37-45 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_cli/src/service/unix.rs:88\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/service/unix.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"9445b9d14f4ace4d1ee7bbd2ac5fe784b38391c9af3a59d8af17c12856f4ade7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/use_math_trunc.rs:250-258 | crates/biome_js_analyze/src/lint/nursery/use_object_from_entries.rs:266-271 \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/biome_js_analyze/src/lint/nursery/use_math_trunc.rs:250\u0060 it begins part-way through the construct above it, so those exact 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/biome_js_analyze/src/lint/nursery/use_math_trunc.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"e61683ed5edf858f3bc38c29f8cb346115fbe9b295ae846daacc671ee2683b43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_js_analyze/src/lint/suspicious/no_useless_regex_backrefs.rs:163-169 | crates/biome_js_analyze/src/lint/suspicious/no_useless_regex_backrefs.rs:174-182 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_js_analyze/src/lint/suspicious/no_useless_regex_backrefs.rs:163\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/suspicious/no_useless_regex_backrefs.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4fcc0490d659220480c465d7cca9471847894bc656682eb64b2c7cdb081c373"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_js_analyze/src/lint/style/use_export_type.rs:414-422 | crates/biome_js_analyze/src/lint/style/use_export_type.rs:427-434 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_js_analyze/src/lint/style/use_export_type.rs:414\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/style/use_export_type.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef589e238034fbf68a1aa1d651f255e0f4ae98d007a21b5738eb1780e773b5fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/biome_js_analyze/src/lint/nursery/use_react_function_component_definition.rs:319-327 | crates/biome_js_analyze/src/lint/nursery/use_react_function_component_definition.rs:405-413 | crates/biome_js_analyze/src/lint/nursery/use_react_function_component_definition.rs:500-508 \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/biome_js_analyze/src/lint/nursery/use_react_function_component_definition.rs:319\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/nursery/use_react_function_component_definition.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e3159dc2627de79c32694143f321bd0607a8672af7beac2a6d9a89bd3bb668"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/biome_configuration/src/overrides.rs:359-366 | crates/biome_configuration/src/overrides.rs:369-376 | crates/biome_configuration/src/overrides.rs:379-386 | crates/biome_configuration/src/overrides.rs:406-413 \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/biome_configuration/src/overrides.rs:359\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_configuration/src/overrides.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b55aac8391f5c2052e5d2f27700b1e45dae3e45172b82e446389d2e84bdd7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_module_graph/src/format_module_graph.rs:662-669 | crates/biome_module_graph/src/format_module_graph.rs:744-751 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_module_graph/src/format_module_graph.rs:662\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_module_graph/src/format_module_graph.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b3e4d1d5df98d217d090d4de7748f79eb006d6a356c833ca0dc11fbd3c24bfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_js_analyze/src/lint/complexity/no_implicit_coercions.rs:453-460 | crates/biome_js_analyze/src/lint/style/use_object_spread.rs:182-189 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/complexity/no_implicit_coercions.rs:453\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/biome_js_analyze/src/lint/complexity/no_implicit_coercions.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a74684994371403997ae0cccdac5b506af3a86da5071f00b52af1cd4e71a802"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_html_analyze/src/lint/nursery/no_vue_v_text_v_html_on_component.rs:106-113 | crates/biome_js_analyze/src/lint/suspicious/no_unassigned_variables.rs:118-125 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_analyze/src/lint/nursery/no_vue_v_text_v_html_on_component.rs:106\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_html_analyze/src/lint/nursery/no_vue_v_text_v_html_on_component.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e509cd7e7cfbcfa24eb43afabd6d88c1bb4e7c1a6c5f42b23764807543e035"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/biome_grit_patterns/src/grit_built_in_functions.rs:210-217 | crates/biome_grit_patterns/src/grit_built_in_functions.rs:416-423 | crates/biome_grit_patterns/src/grit_built_in_functions.rs:570-576 \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/biome_grit_patterns/src/grit_built_in_functions.rs:210\u0060 it does not close everything it opens, so those exact 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/biome_grit_patterns/src/grit_built_in_functions.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"580e74feae5d70f63b3e94b6521dddde83c896a5d00fe21f2f91cf7d74742a76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_vue_semantic/src/semantic_model/layout.rs:435-442 | crates/biome_vue_semantic/src/semantic_model/layout.rs:444-451 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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/biome_vue_semantic/src/semantic_model/layout.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9674b96a2f78dd7cbd2354ed586724888adf384900af5cc4678063c391027dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_react_compiler/src/convert_ast/expressions.rs:941-948 | crates/biome_react_compiler/src/convert_ast/expressions.rs:963-970 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_react_compiler/src/convert_ast/expressions.rs:941\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060update\u0060 to \u0060\u0026JsPostUpdateExpression\u0060 in one and \u0060\u0026JsPreUpdateExpression\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/biome_react_compiler/src/convert_ast/expressions.rs"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9bcf89984dbcf0fac46f6a16ff940b883e417e9fe87fce8bf3de16d2164f509"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_html_analyze/src/lint/style/use_vue_consistent_v_bind_style.rs:151-158 | crates/biome_html_analyze/src/lint/style/use_vue_consistent_v_on_style.rs:154-161 \u2014 before extracting anything, compare \u0060crates/biome_html_analyze/src/lint/style/use_vue_consistent_v_bind_style.rs\u0060 and \u0060crates/biome_html_analyze/src/lint/style/use_vue_consistent_v_on_style.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_analyze/src/lint/style/use_vue_consistent_v_bind_style.rs:151\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_html_analyze/src/lint/style/use_vue_consistent_v_bind_style.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"13e60ce2e1c43dfdd394b2e5b748a664b448e3fa9385f180461a6ecf7f1d68c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_js_analyze/src/lint/complexity/no_useless_catch_binding.rs:144-151 | crates/biome_js_analyze/src/lint/correctness/use_single_js_doc_asterisk.rs:174-181 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/complexity/no_useless_catch_binding.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"9965bc9c2b680e4b3e715bb6d90827e4f3e5fff1b6c90177143009b20b51ec4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/use_consistent_json_file_read.rs:276-283 | crates/biome_js_analyze/src/lint/nursery/use_set_size.rs:229-236 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_consistent_json_file_read.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8dd89605f867db84ef4d30c8bb661d08a75a6cf87a09f0fca4088b7d87f4385"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 8): crates/biome_js_analyze/src/lint/complexity/no_this_in_static.rs:180-186 | crates/biome_js_analyze/src/lint/complexity/no_useless_ternary.rs:191-197 | crates/biome_js_analyze/src/lint/correctness/no_process_global.rs:143-150 | crates/biome_js_analyze/src/lint/nursery/no_new_array.rs:149-155 | crates/biome_js_analyze/src/lint/nursery/no_single_promise_in_promise_methods.rs:186-192 | crates/biome_js_analyze/src/lint/nursery/use_block_statement_over_iife.rs:196-202 | crates/biome_js_analyze/src/lint/nursery/use_vue_emit_validator.rs:175-181 | crates/biome_js_analyze/src/lint/style/use_single_var_declarator.rs:210-216 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 8 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 8 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/complexity/no_this_in_static.rs:180\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/biome_js_analyze/src/lint/complexity/no_this_in_static.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"726fbfeefc7a9edfa8566fc6e2bd0d84b0a4eb8be59da29fcae5ee2a70599b82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/biome_react_compiler/src/convert_ast/identifiers.rs:342-349 | crates/biome_react_compiler/src/convert_ast/identifiers.rs:360-367 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_react_compiler/src/convert_ast/identifiers.rs:342\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_react_compiler/src/convert_ast/identifiers.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"c393c7990e9a46f3b8ac70341a78edfe93d98184425d7d89c08e92ff2a397cab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_react_compiler/src/convert_ast/expressions.rs:383-389 | crates/biome_react_compiler/src/convert_ast/expressions.rs:421-427 \u2014 both copies are in the same file, so extract the block into one function there 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/biome_react_compiler/src/convert_ast/expressions.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f9aea6a01c0d9529ba9747cd7d95351020c8e900b0d9f1f40f9e0ee441f61d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/biome_js_analyze/src/lint/complexity/use_optional_chain.rs:274-280 | crates/biome_js_analyze/src/lint/style/use_exponentiation_operator.rs:171-177 | crates/biome_js_analyze/src/lint/suspicious/no_jsx_leaked_dollar.rs:144-150 \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/biome_js_analyze/src/lint/complexity/use_optional_chain.rs:274\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/biome_js_analyze/src/lint/complexity/use_optional_chain.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"034d77052bea1d14deeb1521f18ce893c81efddda3098cac13b1ba2f8d6a064b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/biome_js_analyze/src/lint/nursery/use_includes.rs:330-334 | crates/biome_js_analyze/src/lint/suspicious/no_undeclared_env_vars.rs:174-180 | crates/biome_js_analyze/src/lint/suspicious/no_undeclared_env_vars.rs:199-205 \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. 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/biome_js_analyze/src/lint/nursery/use_includes.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad5ead94155543af5d7cf4ada12df6b10ea57a237afae5c965675ade26aab7de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_js_analyze/src/lint/complexity/no_useless_continue.rs:112-118 | crates/biome_js_analyze/src/lint/suspicious/no_debugger.rs:75-81 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/complexity/no_useless_continue.rs:112\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/biome_js_analyze/src/lint/complexity/no_useless_continue.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b8a75859441eebf50f5dc88a3bab0a90d4ea9a81e91766dfed109675403c0ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/biome_js_analyze/src/lint/complexity/no_useless_constructor.rs:249-255 | crates/biome_js_analyze/src/lint/correctness/no_unused_private_class_members.rs:218-224 | crates/biome_js_analyze/src/lint/style/no_inferrable_types.rs:203-209 \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/biome_js_analyze/src/lint/complexity/no_useless_constructor.rs:249\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/biome_js_analyze/src/lint/complexity/no_useless_constructor.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"f65e19a4195d5d8e6845cc261721021dfb5b6fed6f53311a507f2de9ed746334"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_react_compiler/src/convert_ast/identifiers.rs:15-21 | crates/biome_react_compiler/src/convert_ast/identifiers.rs:201-207 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_react_compiler/src/convert_ast/identifiers.rs:15\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060pattern\u0060 to \u0060\u0026AnyJsBindingPattern\u0060 in one and \u0060AnyJsAssignmentPattern\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/biome_react_compiler/src/convert_ast/identifiers.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"31265b678b5d5678fa7473b5fa82cfa91c05c2dc84af2add3977c1ca2b3fb5de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/use_vue_valid_define_options.rs:255-261 | crates/biome_js_analyze/src/lint/nursery/use_vue_valid_define_props.rs:217-223 \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/biome_js_analyze/src/lint/nursery/use_vue_valid_define_options.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"2484cee5d223951f7005c49d94a69fb2d694defb36ee9f14be8220e0f833419c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_js_analyze/src/lint/style/use_exponentiation_operator.rs:86-92 | crates/biome_js_analyze/src/lint/suspicious/use_is_array.rs:61-67 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/style/use_exponentiation_operator.rs:86\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/biome_js_analyze/src/lint/style/use_exponentiation_operator.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c278b2139a8c9b2bb6c72008502f0d1858869db986fe710c35ebe368948a0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/biome_js_analyze/src/lint/complexity/use_flat_map.rs:126-132 | crates/biome_js_analyze/src/lint/style/use_shorthand_assign.rs:156-160 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/complexity/use_flat_map.rs:126\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/complexity/use_flat_map.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"15890d6a9698b9987c0e607847c492d6f571dbb394bf1dec1c98b01abb3ff4d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/biome_js_analyze/src/lint/nursery/use_valid_test_title.rs:365-371 | crates/biome_js_analyze/src/lint/style/no_implicit_boolean.rs:133-139 | crates/biome_js_analyze/src/lint/style/use_spread_over_apply.rs:145-151 | crates/biome_js_analyze/src/lint/suspicious/no_useless_escape_in_string.rs:139-145 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/nursery/use_valid_test_title.rs:365\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/biome_js_analyze/src/lint/nursery/use_valid_test_title.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec71c940e5f513444aaf2f6a29cc73abe165045eae4c8efd526da2e648f7bb33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/biome_react_compiler/src/convert_ast/jsx.rs:276-282 | crates/biome_react_compiler/src/convert_ast/modules.rs:582-588 \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/biome_react_compiler/src/convert_ast/jsx.rs:276\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_react_compiler/src/convert_ast/jsx.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"415f7ad1e7bcf987a04af516bec2ea6e595c8ec48d5ca2de6391d4cf0720e1c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/biome_js_analyze/src/lint/correctness/no_process_global.rs:71-77 | crates/biome_js_analyze/src/lint/security/no_global_eval.rs:72-78 | crates/biome_js_analyze/src/lint/suspicious/no_global_is_finite.rs:51-57 | crates/biome_js_analyze/src/lint/suspicious/no_global_is_nan.rs:52-58 \u2014 before extracting anything, compare \u0060crates/biome_js_analyze/src/lint/suspicious/no_global_is_finite.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/suspicious/no_global_is_nan.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 78 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/correctness/no_process_global.rs:71\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/biome_js_analyze/src/lint/correctness/no_process_global.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc4b54c722aed051808f6ffeaa247ac6271b92164c380b0ca8bfd0d9c6356879"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/biome_js_analyze/src/lint/correctness/no_constant_math_min_max_clamp.rs:164-170 | crates/biome_js_analyze/src/lint/nursery/use_consistent_json_file_read.rs:276-280 | crates/biome_js_analyze/src/lint/nursery/use_set_size.rs:229-233 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/no_constant_math_min_max_clamp.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a3d589f20e5d0b4683c62c66e4d48e0017ffe10445cb3fa8c45808678572ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/biome_js_runtime/src/ast.rs:596-602 | crates/biome_js_runtime/src/token.rs:80-84 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_js_runtime/src/token.rs:79\u0060 calls \u0060from_fn_ptr\u0060, \u0060to_js_function\u0060, \u0060context\u0060 and \u0060crates/biome_js_runtime/src/ast.rs:595\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/biome_js_runtime/src/ast.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25555bcadc6108b21d2b4e2c8fea9d50bc6e6cbc64367eff1dd81f90cfc1214"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/biome_js_analyze/src/lint/correctness/use_json_import_attributes.rs:230-234 | crates/biome_js_analyze/src/lint/nursery/use_set_size.rs:184-190 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/correctness/use_json_import_attributes.rs:230\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/correctness/use_json_import_attributes.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cbcaf11e64552afbfb2630542229e0bdb365024306c2407ba692daa0024b568"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 8): crates/biome_configuration/src/overrides.rs:205-208 | crates/biome_configuration/src/overrides.rs:226-229 | crates/biome_configuration/src/overrides.rs:244-247 | crates/biome_configuration/src/overrides.rs:260-262 | crates/biome_configuration/src/overrides.rs:277-281 | crates/biome_configuration/src/overrides.rs:290-293 | crates/biome_configuration/src/overrides.rs:311-316 | crates/biome_configuration/src/overrides.rs:327-332 \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_configuration/src/overrides.rs:277\u0060 it begins part-way through the construct above it, so those exact 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/biome_configuration/src/overrides.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"102340a3c8ea2c229b269ea0483e8fc2ded39f00b35aac8b2acf3913fc6c063e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/biome_grit_patterns/src/grit_built_in_functions.rs:277-282 | crates/biome_grit_patterns/src/grit_built_in_functions.rs:510-515 | crates/biome_grit_patterns/src/grit_built_in_functions.rs:549-554 \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/biome_grit_patterns/src/grit_built_in_functions.rs:277\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/biome_grit_patterns/src/grit_built_in_functions.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"b575ce5735a052e35869270c19503554b9f03524e4006db9b5eab2af36ff1ee7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_js_analyze/src/lint/complexity/use_numeric_literals.rs:175-180 | crates/biome_js_analyze/src/lint/style/use_exponentiation_operator.rs:82-87 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/complexity/use_numeric_literals.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"696c8bdeec5a3ffc3e21280d00e9f6516c6268c4859ced8a6997e452773017c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_js_analyze/src/lint/complexity/no_for_each.rs:108-113 | crates/biome_js_analyze/src/lint/nursery/no_process_exit.rs:73-78 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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/biome_js_analyze/src/lint/complexity/no_for_each.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"e88e07217171d703bc5cc106c5703b1dedf7491813cf1eb2a8e2d690cb8e8f16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_react_compiler/src/convert_ast/expressions.rs:770-775 | crates/biome_react_compiler/src/convert_ast/expressions.rs:802-807 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_react_compiler/src/convert_ast/expressions.rs:770\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_react_compiler/src/convert_ast/expressions.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b0023e70e15286aace32e47b9263653d3568d4dabea3bf3bbae2f35fb8c36d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/biome_js_analyze/src/lint/style/use_import_type.rs:749-753 | crates/biome_js_analyze/src/lint/style/use_import_type.rs:760-765 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_js_analyze/src/lint/style/use_import_type.rs:749\u0060 it does not close everything it opens, so those exact 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/biome_js_analyze/src/lint/style/use_import_type.rs"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7b80ede55e4d9b35558113395af43fd056d81e5796a6aabda983db8e0200d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/biome_html_analyze/src/lint/nursery/no_vue_deprecated_inline_template.rs:71-76 | crates/biome_html_analyze/src/lint/nursery/no_vue_deprecated_slot_scope.rs:97-101 \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/biome_html_analyze/src/lint/nursery/no_vue_deprecated_inline_template.rs:71\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/biome_html_analyze/src/lint/nursery/no_vue_deprecated_inline_template.rs:79\u0060 calls \u0060query\u0060, \u0060name\u0060, \u0060ok\u0060 and \u0060crates/biome_html_analyze/src/lint/nursery/no_vue_deprecated_slot_scope.rs:104\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/biome_html_analyze/src/lint/nursery/no_vue_deprecated_inline_template.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b1356dace5cc52a58f3f9ee9112c09b85af7053e09143672f89ee0fca004da6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/biome_js_analyze/src/lint/complexity/no_useless_label.rs:114-118 | crates/biome_js_analyze/src/lint/suspicious/no_const_enum.rs:84-89 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/complexity/no_useless_label.rs:114\u0060 it does not close everything it opens, so those exact 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/biome_js_analyze/src/lint/complexity/no_useless_label.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecba4b2bd84fe48f6f923e5949e770a92e91c0dd3a0aa2ff5f5a7c4199810932"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/biome_js_analyze/src/lint/complexity/use_numeric_literals.rs:175-179 | crates/biome_js_analyze/src/lint/correctness/use_is_nan.rs:318-323 | crates/biome_js_analyze/src/lint/style/use_exponentiation_operator.rs:82-86 \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/biome_js_analyze/src/lint/correctness/use_is_nan.rs:318\u0060 it does not close everything it opens, so those exact 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/biome_js_analyze/src/lint/complexity/use_numeric_literals.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b007d653fb3426b2832bf9e38b7525ca9ec141b675b15952966fd84b064af9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_html_analyze/src/lint/nursery/use_vue_consistent_event_hyphenation.rs:242-247 | crates/biome_html_analyze/src/lint/style/use_vue_hyphenated_attributes.rs:237-242 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_html_analyze/src/lint/nursery/use_vue_consistent_event_hyphenation.rs:242\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/biome_html_analyze/src/lint/nursery/use_vue_consistent_event_hyphenation.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"58b37ff23ee36761b2d87d226c69f5e20e86f935785a6d86760a110f63e4f8d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/use_string_starts_ends_with.rs:366-370 | crates/biome_js_analyze/src/lint/nursery/use_string_starts_ends_with.rs:402-406 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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/biome_js_analyze/src/lint/nursery/use_string_starts_ends_with.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee4f9c802398e8565930680e9909c436408c1d1169a922b348f21bc4af7c7d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/biome_js_analyze/src/lint/a11y/no_aria_hidden_on_focusable.rs:140-144 | crates/biome_js_analyze/src/lint/a11y/use_valid_aria_role.rs:162-166 \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/biome_js_analyze/src/lint/a11y/no_aria_hidden_on_focusable.rs:140\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/a11y/no_aria_hidden_on_focusable.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"b747edd4a07eb261a794f8170232ad045a6d392e679aae327895cec5b118d7a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/no_new_array.rs:86-90 | crates/biome_js_analyze/src/lint/nursery/use_bigint_literals.rs:82-86 \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/biome_js_analyze/src/lint/nursery/no_new_array.rs:86\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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/biome_js_analyze/src/lint/nursery/no_new_array.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a26e3f2b3720733083a21918676f882d3e3473c47bea2d941d3e79932480ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/biome_js_analyze/src/lint/correctness/no_process_global.rs:141-145 | crates/biome_js_analyze/src/lint/style/no_restricted_types.rs:107-111 | crates/biome_js_analyze/src/lint/style/use_single_var_declarator.rs:208-212 \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/biome_js_analyze/src/lint/correctness/no_process_global.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/biome_js_analyze/src/lint/correctness/no_process_global.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"1223ab4cdaed14227f58565d155d65a5c480bdb448cfade6f9cc6a466550fb93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/biome_configuration_macros/src/group_struct.rs:207-211 | crates/biome_configuration_macros/src/group_struct.rs:310-314 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_configuration_macros/src/group_struct.rs:207\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_configuration_macros/src/group_struct.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f975a0a33de0cd621b8d343fa852624d9a80e434df2ea417095443792d58879"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/biome_js_analyze/src/lint/nursery/no_map_spread.rs:305-309 | crates/biome_js_analyze/src/lint/suspicious/no_global_is_finite.rs:120-124 | crates/biome_js_analyze/src/lint/suspicious/no_global_is_nan.rs:121-125 \u2014 before extracting anything, compare \u0060crates/biome_js_analyze/src/lint/suspicious/no_global_is_finite.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/suspicious/no_global_is_nan.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 78 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/nursery/no_map_spread.rs:305\u0060 it does not close everything it opens, so those exact 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/biome_js_analyze/src/lint/nursery/no_map_spread.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"4597f2de4ca07c7ecddf8131f43ac7ba5aac7c1014a766608bf15e60ef5ddbd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/biome_js_analyze/src/lint/nursery/no_disabled_attribute.rs:257-261 | crates/biome_js_analyze/src/lint/nursery/use_string_starts_ends_with.rs:143-147 | crates/biome_js_analyze/src/lint/nursery/use_vue_prop_type_constructor.rs:172-176 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/nursery/no_disabled_attribute.rs:257\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/nursery/no_disabled_attribute.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c5eeb0824fb9e168888cc19ab2023128b52cf65bd95cd46a6e520cae3c0944"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/biome_cli/src/execute/migrate/eslint.rs:156-161 | crates/biome_cli/src/execute/migrate/prettier.rs:496-501 | crates/biome_cli/src/execute/migrate/stylelint.rs:94-99 \u2014 before extracting anything, compare \u0060crates/biome_cli/src/execute/migrate/eslint.rs\u0060 and \u0060crates/biome_cli/src/execute/migrate/stylelint.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_cli/src/execute/migrate/eslint.rs:156\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/execute/migrate/eslint.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"241b210ce7f81f853113b864f7b19f9d5d8056b4d1135a35d3a2a046d07cc77b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/biome_css_analyze/src/lint/nursery/use_logical_properties.rs:1304-1308 | crates/biome_css_analyze/src/lint/nursery/use_logical_properties.rs:1327-1331 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_css_analyze/src/lint/nursery/use_logical_properties.rs:1304\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_css_analyze/src/lint/nursery/use_logical_properties.rs"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8adaf36e572d8e72164d6f49e703a02606ba11036313e3927d496861531896"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/biome_grit_patterns/src/pattern_compiler/literal_compiler.rs:29-33 | crates/biome_grit_patterns/src/pattern_compiler/literal_compiler.rs:42-46 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_grit_patterns/src/pattern_compiler/literal_compiler.rs:29\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/biome_grit_patterns/src/pattern_compiler/literal_compiler.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6530b79a89ce09e40bd300aa0318676bfbf82fb9fef3ca1b22131182f797b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/no_array_sort_for_min_max.rs:435-440 | crates/biome_js_analyze/src/lint/nursery/use_vue_valid_define_emits.rs:283-288 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/biome_js_analyze/src/lint/nursery/use_vue_valid_define_emits.rs:282\u0060 calls \u0060JsCallExpression\u0060, \u0060Some\u0060 and \u0060crates/biome_js_analyze/src/lint/nursery/no_array_sort_for_min_max.rs:434\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/biome_js_analyze/src/lint/nursery/no_array_sort_for_min_max.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"07efb95cb6c41bc164e93131e74aed31d441bf4a798b8d477d1ecabf4ccfe1f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_js_analyze/src/lint/style/use_import_type.rs:499-504 | crates/biome_js_analyze/src/lint/style/use_import_type.rs:628-633 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_js_analyze/src/lint/style/use_import_type.rs:499\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/style/use_import_type.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f3af0926e3f04f06bea4a26b19abfca04e60711674e29abe7dd3a15211c86b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_js_type_info/src/format_inferred_type_info.rs:81-90 | crates/biome_js_type_info/src/format_type_info.rs:86-95 \u2014 before extracting anything, compare \u0060crates/biome_js_type_info/src/format_inferred_type_info.rs\u0060 and \u0060crates/biome_js_type_info/src/format_type_info.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 242 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060\u0026mut Formatter\u003CFormatInferredTypeContext\u003C\u0027db\u003E\u003E\u0060 in one and \u0060\u0026mut Formatter\u003CFormatTypeContext\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/format_inferred_type_info.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"b67504ce3958627e333ddbd2d9064b9cb8f0a208ab399a53c47289ec902725c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_js_type_info/src/format_inferred_type_info.rs:994-999 | crates/biome_js_type_info/src/format_type_info.rs:660-665 \u2014 before extracting anything, compare \u0060crates/biome_js_type_info/src/format_inferred_type_info.rs\u0060 and \u0060crates/biome_js_type_info/src/format_type_info.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 242 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/biome_js_type_info/src/format_inferred_type_info.rs"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f348f78a7efd1ad6b9065f803498cfadc968ceaafea545e50714db5f1e3618"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/biome_js_type_info/src/inferred_type.rs:1280-1284 | crates/biome_js_type_info/src/inferred_type.rs:1598-1602 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/inferred_type.rs"},"region":{"startLine":1280}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc60fa7eac3ed821c521169857723793b545bc3608b89363bdacb68194b1a4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/biome_json_analyze/src/assist/source/use_sorted_package_json/sorters/helpers.rs:74-78 | crates/biome_json_analyze/src/assist/source/use_sorted_package_json/sorters/helpers.rs:110-114 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_json_analyze/src/assist/source/use_sorted_package_json/sorters/helpers.rs:74\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_json_analyze/src/assist/source/use_sorted_package_json/sorters/helpers.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"10737371f8d6cba53dc601d4ae91a5443a0cac2740aef69aca75bc5480bcfe8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/biome_markdown_parser/src/syntax/list.rs:105-109 | crates/biome_markdown_parser/src/syntax/mod.rs:979-983 \u2014 before extracting anything, compare \u0060crates/biome_markdown_parser/src/syntax/list.rs\u0060 and \u0060crates/biome_markdown_parser/src/syntax/mod.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 59 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"38285d2a36065a3aa8df1f4582f45e37d5091afe50ee4e3d8c4fe623ce4c853b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/biome_markdown_parser/src/syntax/list.rs:2425-2429 | crates/biome_markdown_parser/src/syntax/list.rs:2518-2522 \u2014 both copies are in the same file, so extract the block 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/biome_markdown_parser/src/syntax/list.rs:2431\u0060 calls \u0060cur_range\u0060, \u0060end\u0060, \u0060into\u0060 and \u0060crates/biome_markdown_parser/src/syntax/list.rs:2524\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":2425}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25c95847f73551d6da8cd7cc737e12af93e925b0a3b069e8b348a502dcdb38c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_service/src/configuration.rs:1323-1328 | crates/biome_service/src/workspace/server.rs:3028-3033 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_service/src/configuration.rs:1323\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_service/src/configuration.rs"},"region":{"startLine":1323}}}],"partialFingerprints":{"codehealthFindingId/v1":"436f99effb48a854fc0d27784454b5d78ec2ffd0e0af0de505c37edabed3a6f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/biome_service/src/file_handlers/html.rs:818-822 | crates/biome_service/src/file_handlers/javascript.rs:1849-1853 \u2014 before extracting anything, compare \u0060crates/biome_service/src/file_handlers/html.rs\u0060 and \u0060crates/biome_service/src/file_handlers/javascript.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 202 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/biome_service/src/file_handlers/html.rs"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a898f66846c9efca92f075858ec3056b12e4038c9ca72646d5ca197e9882b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/biome_tailwind_parser/src/lexer/mod.rs:62-66 | crates/biome_tailwind_parser/src/lexer/mod.rs:100-104 \u2014 both copies are in the same file, so extract the block 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/biome_tailwind_parser/src/lexer/mod.rs:60\u0060 calls \u0060consume_after_dash\u0060, \u0060consume_modifier\u0060 and \u0060crates/biome_tailwind_parser/src/lexer/mod.rs:99\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/biome_tailwind_parser/src/lexer/mod.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"29525973798e5a2c332bba514f98c84c0196ecdd0c1e27bf1052c88e5874c8d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): crates/biome_test_utils/src/lib.rs:940-975 | crates/biome_test_utils/src/lib.rs:984-1018 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_test_utils/src/lib.rs"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"8835dffc8ca5f4dca9635eef8cd39f8a83747bc3c1909266ef483af9de991075"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): crates/biome_test_utils/src/lib.rs:171-211 | crates/biome_test_utils/src/lib.rs:219-256 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_test_utils/src/lib.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"184d5fa84d90c393f4ba53dc42de693c70557ff4190dcd4896179d4885239119"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/biome_test_utils/src/lib.rs:533-563 | crates/biome_test_utils/src/lib.rs:603-625 \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/biome_test_utils/src/lib.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b76aee77c528c7fc77d70689a7db76c11ab4004336aebb7a5ece8a2d144030e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/biome_test_utils/src/lib.rs:506-522 | crates/biome_test_utils/src/lib.rs:628-644 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_test_utils/src/lib.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b3a68f567936b01249cfd05564c15e5afb795b1fcdba0c9b7cb6e0f3fae025"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): fuzz/fuzz_targets/rome_common.rs:22-35 | fuzz/fuzz_targets/rome_common.rs:166-179 \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":"fuzz/fuzz_targets/rome_common.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"539e29e7ecdfce56b9d47f5acb7b32d785164b6bd4e017f1a7b8a9b797fd547c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/biome_test_utils/src/lib.rs:178-202 | crates/biome_test_utils/src/lib.rs:228-252 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_test_utils/src/lib.rs:178\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_test_utils/src/lib.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"76661416b7e3a1a939a0e4983c7476135a0bf86a0cd22670867507758ea24b28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/biome_test_utils/src/lib.rs:320-341 | crates/biome_test_utils/src/lib.rs:367-388 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_test_utils/src/lib.rs:320\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_test_utils/src/lib.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a684947ac67faab78012ebcc3658f8f6ef12b896e116c4ab88497cf08c3f4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): crates/biome_test_utils/src/lib.rs:951-964 | crates/biome_test_utils/src/lib.rs:1006-1017 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_test_utils/src/lib.rs:951\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_test_utils/src/lib.rs"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"adddfbac59e9bbdbaa23096e3437484ca4a5639a70b93ef7f8ac9741585d98bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/biome_js_analyze/src/lint/nursery/use_valid_test_title.rs:116-128 | crates/biome_js_analyze/src/lint/nursery/use_valid_test_title.rs:180-192 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/biome_js_analyze/src/lint/nursery/use_valid_test_title.rs:116\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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/biome_js_analyze/src/lint/nursery/use_valid_test_title.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ebdceac9c42357e05b78e576c90ff8cbe13ac738332670a419b743e0de8cec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_test_utils/src/lib.rs:705-714 | crates/biome_test_utils/src/lib.rs:739-748 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_test_utils/src/lib.rs:705\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/biome_test_utils/src/lib.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8127d36be47dd5d114a9f6f4e737f588ed93c27de1849948652ed3c8ba45264"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_test_utils/src/lib.rs:477-482 | crates/biome_test_utils/src/lib.rs:1325-1330 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_test_utils/src/lib.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"8200c40514404c22a0d15218baa04932f740e26b720a300f9f172f1f287b1393"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/biome_js_analyze/src/lint/style/use_test_hooks_in_order.rs:107-128 | crates/biome_js_analyze/src/lint/style/use_test_hooks_on_top.rs:66-87 \u2014 before extracting anything, compare \u0060crates/biome_js_analyze/src/lint/style/use_test_hooks_in_order.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/style/use_test_hooks_on_top.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_test_hooks_in_order.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba56ec7d6e6f4297e9f9711fdabc78d61c52814c6f839ccd3ab0d615d61481ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/biome_formatter_test/src/spec.rs:64-75 | crates/biome_formatter_test/src/test_prettier_snapshot.rs:85-96 \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/biome_formatter_test/src/spec.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1cf5f66aae33428a16ba21cbece5cc540bdd2afa1d37bc861ee99edb0bafd2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_js_analyze/src/lint/style/use_test_hooks_in_order.rs:200-205 | crates/biome_js_analyze/src/lint/style/use_test_hooks_on_top.rs:157-162 \u2014 before extracting anything, compare \u0060crates/biome_js_analyze/src/lint/style/use_test_hooks_in_order.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/style/use_test_hooks_on_top.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_test_hooks_in_order.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"373434ca1b5e7ec60d649c59c81bab761ea77b64bca25285587b79288353e548"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/biome_js_analyze/src/lint/style/use_test_hooks_in_order.rs:207-212 | crates/biome_js_analyze/src/lint/style/use_test_hooks_on_top.rs:164-169 \u2014 before extracting anything, compare \u0060crates/biome_js_analyze/src/lint/style/use_test_hooks_in_order.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/style/use_test_hooks_on_top.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_test_hooks_in_order.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"517bc0ae97b6f764bace0d6ba33d7e75e3e30b2ac39f44b44ff98e958e5a6d44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/biome_js_analyze/src/lint/style/use_test_hooks_in_order.rs:223-232 | crates/biome_js_analyze/src/lint/style/use_test_hooks_on_top.rs:180-189 \u2014 before extracting anything, compare \u0060crates/biome_js_analyze/src/lint/style/use_test_hooks_in_order.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/style/use_test_hooks_on_top.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/biome_js_analyze/src/lint/style/use_test_hooks_in_order.rs:223\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/biome_js_analyze/src/lint/style/use_test_hooks_in_order.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2833039c7a78b0ced245b46f36607e4957a6275e84114429e8691f2bea86db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/biome_js_analyze/src/lint/style/use_test_hooks_in_order.rs:234-238 | crates/biome_js_analyze/src/lint/style/use_test_hooks_on_top.rs:191-195 | crates/biome_js_analyze/src/lint/suspicious/no_identical_test_title.rs:261-265 \u2014 before extracting anything, compare \u0060crates/biome_js_analyze/src/lint/style/use_test_hooks_in_order.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/style/use_test_hooks_on_top.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_test_hooks_in_order.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"c704549e70a72340845dc92aca7a197c6cea4033303c5891daed11caea89e938"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/biome_test_utils/src/lib.rs:941-945 | crates/biome_test_utils/src/lib.rs:985-989 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_test_utils/src/lib.rs"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"afa5c4947a95ca1abbae2621ae83887ae4bf89332c6bdbd5e7744c16421aa29c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/biome_test_utils/src/lib.rs:1444-1448 | crates/biome_test_utils/src/lib.rs:1452-1456 \u2014 both copies are in the same file, so extract the block 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/biome_test_utils/src/lib.rs:1460\u0060 calls \u0060with_extension\u0060 and \u0060crates/biome_test_utils/src/lib.rs:1452\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/biome_test_utils/src/lib.rs"},"region":{"startLine":1444}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a2d92eeac740c58329ba35d84572f353be8aa9b1976c8122ec62346f1c2c886"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project @biomejs/biome: @biomejs/biome has instability 0.91 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6969c2dd7ca5c2d43b727db63bd9b594627259bb479ac69d4355a5c1f7c94040"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project biome_cli: biome_cli has instability 0.98 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"677131654cadc3117e590027374899d4a5946b81c927d41a163377d3e4c60ff5"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project biome_configuration_macros: biome_configuration_macros has instability 0.94 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"68973c28fed7f4bc5a22516804c0ff7997f31ac52964218ab5753302531db6a8"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project biome_css_formatter: biome_css_formatter has instability 0.88 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f7217af098ab6a713d78f98fde64d829d9819d5977abe4655b31f9ccc5bf4b95"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project biome_graphql_formatter: biome_graphql_formatter has instability 0.86 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8c9d8a135fc1421f2962a58fe2fb8566c02119a740ba08d7d0ef423dc21cd541"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project biome_grit_formatter: biome_grit_formatter has instability 0.86 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7f0c233333fb26d088199a35defc9ac01e02f52aafdcc64924db9990438ecc48"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project biome_grit_patterns: biome_grit_patterns has instability 0.88 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"693a39d7ae0bea86f02de03f8850a6ffcb1a0e41e999063cbe0f8b6939e234cc"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project biome_html_analyze: biome_html_analyze has instability 0.82 with 6 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0833f50658bcb2413111e8f335cd3738d05cf39b046ba6c4ae38bf5f65b92e4f"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project biome_js_analyze: biome_js_analyze has instability 0.87 with 6 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"29449abd7d822fdf4263e3c82656fbcc4664fd19ceb51d5c4a7208edb9411d63"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project biome_js_runtime: biome_js_runtime has instability 0.92 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f9dd1d2172cec80c19535ce4122ca1eb17892b0a4c4a4414a47537c8aeb3fc29"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project biome_js_transform: biome_js_transform has instability 0.88 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"85d565de13d0b3557b296780efb679d8eec506b83e9e17092c4f546192cbb4ab"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project biome_lsp: biome_lsp has instability 0.93 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"04c9956e00fbe1f2f5e82168a15adbf17eed94bc5c16cf698a4891333358c600"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project biome_markdown_formatter: biome_markdown_formatter has instability 0.83 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"33c74d0a7761913c5bccc94f2c4de4ce18e84ba3de4b9c1545e69619759a478d"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project biome_migrate: biome_migrate has instability 0.90 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"460131ab8bf04ac903ba06ee7dcf2f0634c125c3a4610ece2c484b56d7416485"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project biome_plugin_loader: biome_plugin_loader has instability 0.87 with 3 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f783f3a326f3a97bdd2b1a429a95ef1b1af2cc4ab8eb864ea1e56aa2423f15d2"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project biome_react_compiler: biome_react_compiler has instability 0.88 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"10773ed625e9fb2f07f5355099a0ca16490c4a186f8dd7c821d42a421f266ebd"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project biome_ruledoc_utils: biome_ruledoc_utils has instability 0.98 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"73000cff890d0fc819d820bf3d092e500d5e0d920c420c7dcd6cea3ef677060a"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project biome_service: biome_service has instability 0.92 with 5 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91d47a7896ad8e7024f5929f2529185945b4bbdc95ec8f88d1203a8641d73133"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project biome_tailwind_logic: biome_tailwind_logic has instability 0.89 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"58b43db7e9409a989f7958240d658cac690c50da9ea4b0b846b9d52b946855fc"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project biome_vue_semantic: biome_vue_semantic has instability 0.82 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"04191abf5a13b9d4deeec7ebc46e8171db18b382031367b150e608f38124c986"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project biome_yaml_formatter: biome_yaml_formatter has instability 0.88 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"591c6f81a084f1b73fee26ffea9be0c182c39507fcaa10e7ae64b4f4e30299da"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: biome_diagnostics_categories: biome_diagnostics_categories: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 5 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dd37ab6faf85759ca3c90b77f765c182e60efe76fec00eaa795db860b128131a"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: biome_ungrammar: biome_ungrammar: 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":"56648da7a5453acdf05fb56ab15772a2ca0ca3d43f7635e82961d269b3d7a5e1"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: xtask_glue: xtask_glue: 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":"dc29f51014ef4cfeaf04011b914da3fe4d5637ff37a677a95ddedf9f9458760e"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: biome_json_syntax: biome_json_syntax: abstractness 0.00, instability 0.06, distance 0.94 \u2014 zone of pain \u2014 concrete and depended on by 17 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"546a14d0cca3e6c1cc6d62225f71af349559b341a974e7706c3575a83cf6dc4f"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: biome_yaml_syntax: biome_yaml_syntax: abstractness 0.00, instability 0.07, distance 0.93 \u2014 zone of pain \u2014 concrete and depended on by 14 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ed2eed2629c083ce4700473b295d5bd8ab0ec04290e0b04ebbba0022821df088"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: biome_markdown_syntax: biome_markdown_syntax: abstractness 0.00, instability 0.08, distance 0.92 \u2014 zone of pain \u2014 concrete and depended on by 12 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f0ac89c5486503905ecd629397fc73a9c38e4551edd22d642cf4e068def2a39f"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: biome_graphql_syntax: biome_graphql_syntax: abstractness 0.00, instability 0.08, distance 0.92 \u2014 zone of pain \u2014 concrete and depended on by 11 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"658aab6fb45bea2d853e334f44d50034790323706a8f8041dff7038ef71b4aef"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: biome_text_edit: biome_text_edit: abstractness 0.00, instability 0.11, distance 0.89 \u2014 zone of pain \u2014 concrete and depended on by 8 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ca3d982776b3f25941139e95f4986982748171185bf6f0e9dd6a1725581dd6e9"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: biome_suppression: biome_suppression: abstractness 0.00, instability 0.15, distance 0.85 \u2014 zone of pain \u2014 concrete and depended on by 17 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"11def5c5b7029c5753f3987d1ff3d29c35c41f8e26d2f1d043820fe6a66a5acc"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: biome_rowan: biome_rowan: abstractness 0.14, instability 0.02, distance 0.84 \u2014 zone of pain \u2014 concrete and depended on by 82 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0f7324721719a41d6988c77a9eb468931bef0d012a7e4f14c38ce541cd2ec55e"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: biome_tailwind_syntax: biome_tailwind_syntax: 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":"627387972b4affe7a8280592ca94115a93f60621b664a234b6fa4d7c4ff98549"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: biome_console: biome_console: abstractness 0.15, instability 0.04, distance 0.80 \u2014 zone of pain \u2014 concrete and depended on by 43 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3e363ac144d4934da169ef243e1328bd2d148abcbfc0a2f3b3e3d81eba457bd1"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: biome_html_syntax: biome_html_syntax: abstractness 0.00, instability 0.21, distance 0.79 \u2014 zone of pain \u2014 concrete and depended on by 15 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a606c85014805e374611dc2b0ad5342b5a86179c9dcd1ddc031431d2b33d3c5c"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: biome_diagnostics: biome_diagnostics: abstractness 0.13, instability 0.11, distance 0.76 \u2014 zone of pain \u2014 concrete and depended on by 48 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e55538b02da1d90d248244680b37429cf0e265d5be5253a8ac6dd326ce251d2f"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: biome_line_index: biome_line_index: abstractness 0.00, instability 0.25, distance 0.75 \u2014 zone of pain \u2014 concrete and depended on by 3 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dcc2ea9ebc61f5c9dad7fed8e1a07b1f42080260fefa82a6defa6b8cd460e93b"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: biome_languages: biome_languages: abstractness 0.11, instability 0.14, distance 0.75 \u2014 zone of pain \u2014 concrete and depended on by 37 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8f4fb32e6540beda268fc363747787026a5ee2830dd1bd94ab8a41a1cffacd7d"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: biome_css_syntax: biome_css_syntax: abstractness 0.00, instability 0.27, distance 0.73 \u2014 zone of pain \u2014 concrete and depended on by 16 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"46d8153e75c31449a7065c8c79e3afeb547e0addd577bf369fcf6b285c99897d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: RuleMetadata (LCOM4 10): RuleMetadata\u0027s methods fall into 10 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 10 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/biome_analyze/src/rule.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eef4afb1e6b0ee1fb2439f3b2071553e34c218582e8e9909b202fed43214cd7"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SyntaxNode (LCOM4 9): SyntaxNode\u0027s methods fall into 9 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 9 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/biome_rowan/src/cursor/node.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"852f4949a54af4c39d49c849701179a23e977950f91d77346872cc92aba60391"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: LintRulesVisitor (LCOM4 8): LintRulesVisitor\u0027s methods fall into 8 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 8 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/biome_configuration_macros/src/visitors.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a4ef848249a85972f8fbd334024043de85298823d6788495274e9fd9731a714"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: AssistActionsVisitor (LCOM4 7): AssistActionsVisitor\u0027s methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_configuration_macros/src/visitors.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e5591e308781a652da61e5ff333b18583efd14839a93326d5717ee05df1722"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: JsModuleInfo (LCOM4 6): JsModuleInfo\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/biome_module_graph/src/js_module_info.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2dbbd0ff9e89f23093d95a87514e4298e25d1e65ccd95cc44b30e82bb820676"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: LintVisitor (LCOM4 6): LintVisitor\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/biome_service/src/file_handlers/mod.rs"},"region":{"startLine":1712}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e5b3d53abfc9c24c6b1060006ec9834a53d86c99b6957dc0c2b7cb3d82300ab"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ManifestVisitor (LCOM4 6): ManifestVisitor\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/biome_service/src/file_handlers/mod.rs"},"region":{"startLine":2036}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc71aeb1bec86e443ea8ff49ca46b03df0d0be9b18ecd7e8588935079b9a974"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: AssistsVisitor (LCOM4 6): AssistsVisitor\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/biome_service/src/file_handlers/mod.rs"},"region":{"startLine":2231}}}],"partialFingerprints":{"codehealthFindingId/v1":"6155247d56baac26ffcf208d91b91a9e036feda194e43c77b007419168ded629"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: RuleDiagnostic (LCOM4 5): RuleDiagnostic\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/biome_analyze/src/rule.rs"},"region":{"startLine":1628}}}],"partialFingerprints":{"codehealthFindingId/v1":"94659edf09075d8ddff319ce43545c5aaa05ca62eec4870135f8e36c9ed2f37a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SyntaxVisitor (LCOM4 5): SyntaxVisitor\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/biome_service/src/file_handlers/mod.rs"},"region":{"startLine":1607}}}],"partialFingerprints":{"codehealthFindingId/v1":"62cf73d3e00575d32ec61a7c6970f124ea31149e040b23f0ed0e6c756fba2fea"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: OsFileSystem (LCOM4 4): OsFileSystem\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/biome_fs/src/fs/os.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"895c6ec6af1eca3a611e47d1d5f931dfe1cfe3538c088b107b04b1ee9380366f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: JsonFileSource (LCOM4 4): JsonFileSource\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/biome_languages/src/json.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"1198dfde58524c45cc4f203abb38e3f5321565ba0d17a7bf51f313aa1c61fb18"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: MarkdownParserOptions (LCOM4 4): MarkdownParserOptions\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/biome_markdown_parser/src/parser.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d634a5f1ac54cbd5266b34f78a9a042cf42cb1ad8c33d7b122a1fe8534ce350"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: UseNumericSeparatorsOptions (LCOM4 4): UseNumericSeparatorsOptions\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/biome_rule_options/src/use_numeric_separators.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c40dd316d4da6a90959103ba7d3d14b5c271b9823ec9684710a2aadfcf94d9"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: WorkspaceServerWithDb (LCOM4 4): WorkspaceServerWithDb\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/biome_service/src/workspace/server.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfce673cae3cedf8b68efb59362170a2c9d8137f0907a55135560a3e3ce79ff2"}},{"ruleId":"D8","level":"warning","message":{"text":"Coverage not measured \u2014 JavaScript/TypeScript suite: Coverage NOT MEASURED: the JavaScript/TypeScript half could not be measured \u2014 packages/@biomejs/backend-jsonrpc/ runs vitest but declares no coverage provider, so the suite can run and still produce no lcov \u2014 add \u0060@vitest/coverage-v8\u0060 (or \u0060@vitest/coverage-istanbul\u0060) as a devDependency. Coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository\u0027s maintainers can perform; once it passes, the real number is measured on the next scan."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"62e63e619c28f057e129f2997c965d32a457366a9ce18ca019ffb6bdfba85c99"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: wait: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/tests/specs/suspicious/noPlaywrightWaitForTimeout/invalid/in-test.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ae55fbcdc515024ce13578106f2d1e2eb85b350962b04c1bbcf363e9fdf336"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: example: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/tests/specs/suspicious/noPlaywrightPagePause/invalid/in-test.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"aba54bf2e35d1fd796c6d3c6449db199ff011baf52faccb44160a9697cba162b"}},{"ruleId":"D10","level":"warning","message":{"text":"Test project verifies nothing: the repository root: No conventional assertion call was detected in 2 of 2 tests in \u0060the repository root\u0060 \u2014 the project as a whole, not one method. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a suite that genuinely checks nothing. If it is the latter, this project passes unconditionally and cannot fail."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/tests/specs/suspicious/noPlaywrightWaitForTimeout/invalid/in-test.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab709199deea5debef24807ab877494840bc004aa18a8df58bf4fc862dbe9e8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_cli/src/execute/migrate/eslint_to_biome.rs: crates/biome_cli/src/execute/migrate/eslint_to_biome.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 118 in biome_cli::execute::migrate::eslint_to_biome::migrate_eslint_rule at line 767. 4 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_cli/src/execute/migrate/eslint_to_biome.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/biome_cli/src/execute/migrate/eslint_to_biome.rs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f0275658e8b7ee757b6ca6ad3dae04163d31e868dfc865cb34197547564f04"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_module_graph/src/db/type_inference/promise_classification.rs: crates/biome_module_graph/src/db/type_inference/promise_classification.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 183 in biome_module_graph::db::type_inference::promise_classification::classify_expression at line 177. 3 of those changes were fix/bug commits, and the other 8 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_module_graph/src/db/type_inference/promise_classification.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/biome_module_graph/src/db/type_inference/promise_classification.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"232a9029bb6b9ae72942c14a9c8fe0913cea7c658a44883792b8dee03a7bb8ca"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_cli/src/execute/migrate/eslint_eslint.rs: crates/biome_cli/src/execute/migrate/eslint_eslint.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 71 in Rules::deserialize at line 517. 2 of those changes were fix/bug commits, and the other 13 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_cli/src/execute/migrate/eslint_eslint.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/biome_cli/src/execute/migrate/eslint_eslint.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0514104b2341da4528d3f7794ad319209e548819d4cb0d130931229caf0295d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_service/src/file_handlers/html/parse_embedded_nodes.rs: crates/biome_service/src/file_handlers/html/parse_embedded_nodes.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 87 in biome_service::file_handlers::html::parse_embedded_nodes::parse_embedded_nodes at line 29. 7 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_service/src/file_handlers/html/parse_embedded_nodes.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/biome_service/src/file_handlers/html/parse_embedded_nodes.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a467b58f9598664d31838767e9d95ae5b9262ff12b7eb6b7e035f160584b52"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_html_formatter/src/html/lists/element_list.rs: crates/biome_html_formatter/src/html/lists/element_list.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 127 in FormatHtmlElementList::fmt_children at line 382. 6 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_html_formatter/src/html/lists/element_list.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/biome_html_formatter/src/html/lists/element_list.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f17cd88a11b4008f6bd443dcee3e673784d17584ae6e2b30b451ffea7f8b14"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_service/src/workspace/server.rs: crates/biome_service/src/workspace/server.rs changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in WorkspaceServerWithDb::open_file_internal at line 833. 12 of those changes were fix/bug commits, and the other 16 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_service/src/workspace/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/biome_service/src/workspace/server.rs"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2553e2976f4efc25e1ea6cd4e6d08b14e818b93492e3c93db8edb7e2dec7324"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_js_type_info/src/local_inference.rs: crates/biome_js_type_info/src/local_inference.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in TypeData::from_any_js_expression at line 426. 7 of those changes were fix/bug commits, and the other 11 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_js_type_info/src/local_inference.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/biome_js_type_info/src/local_inference.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"6907469cf033f1ad8d33ff195fe7a6c56b288cd5d384011c59f6d6859cdfd1e9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_markdown_parser/src/syntax/mod.rs: crates/biome_markdown_parser/src/syntax/mod.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in biome_markdown_parser::syntax::parse_any_block_with_indent_code_policy at line 331. 3 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_markdown_parser/src/syntax/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/biome_markdown_parser/src/syntax/mod.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"924667a58a4acd4025df0ec6a73fec7cfa43e4aafb2bb2bb37a604f4d14230fd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_js_type_info/src/inferred_type.rs: crates/biome_js_type_info/src/inferred_type.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in InferredType::is_promise_instance_with at line 431. 2 of those changes were fix/bug commits, and the other 13 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_js_type_info/src/inferred_type.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/biome_js_type_info/src/inferred_type.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b26a26f5814333f77d4798b0244f99348839295fb4e37f1521c853cdc3a32f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_markdown_formatter/src/markdown/lists/block_list.rs: crates/biome_markdown_formatter/src/markdown/lists/block_list.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 67 in DefaultBlockListFormatter::fmt at line 378. 7 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_markdown_formatter/src/markdown/lists/block_list.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/biome_markdown_formatter/src/markdown/lists/block_list.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"8133261bf0a15d533f1c2d70fa8845688ad3652fa8e060a63c52660cfd76e1ea"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_module_graph/src/db/type_inference/expressions.rs: crates/biome_module_graph/src/db/type_inference/expressions.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in ResolutionCtx::resolve_typeof_expression at line 125. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_module_graph/src/db/type_inference/expressions.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/biome_module_graph/src/db/type_inference/expressions.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"283d8899a5f5fe56deacae7497082ac86f30a4e72c769a52ca91c0a07f047ee0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_module_graph/src/db/type_inference/qualifiers.rs: crates/biome_module_graph/src/db/type_inference/qualifiers.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in ResolutionCtx::resolve_qualifier at line 80. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_module_graph/src/db/type_inference/qualifiers.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/biome_module_graph/src/db/type_inference/qualifiers.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f00b42c8cac8cf7a906392bd1155cfa6306c68b8f4bc59a84a5d3f292960fb1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_vue_semantic/src/semantic_model/component.rs: crates/biome_vue_semantic/src/semantic_model/component.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in Collector::collect_options_object at line 542. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_vue_semantic/src/semantic_model/component.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/biome_vue_semantic/src/semantic_model/component.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2a650dcfb3d09b42e195fdc2ce27c4e4bd7e0692767d2fa855d5c4afb5973d9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_markdown_parser/src/syntax/list.rs: crates/biome_markdown_parser/src/syntax/list.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in biome_markdown_parser::syntax::list::parse_first_line_blocks at line 2208. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_markdown_parser/src/syntax/list.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/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":2208}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6612f9e7972cd80b5957f9c64c3b4d88f40fd217673a7a7803c6a5d26daba1f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_ruledoc_utils/src/analyzer.rs: crates/biome_ruledoc_utils/src/analyzer.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in biome_ruledoc_utils::analyzer::analyze_rule_code at line 51. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_ruledoc_utils/src/analyzer.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/biome_ruledoc_utils/src/analyzer.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"549fc289156c1704ebda49653a36ac171f0ab4c49acf7f052b93946b1a33b5ed"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_html_formatter/src/utils/children.rs: crates/biome_html_formatter/src/utils/children.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in biome_html_formatter::utils::children::html_split_children at line 257. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_html_formatter/src/utils/children.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/biome_html_formatter/src/utils/children.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"127f0852e63715719dd478a2cae38469fc9c4a526805a2e5823480c38b25f9a2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_configuration/src/overrides.rs: crates/biome_configuration/src/overrides.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in OverridePattern::apply_to_configuration at line 112. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_configuration/src/overrides.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/biome_configuration/src/overrides.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d3ee1cee06b2788db6c99ba814fffa8d995d83154daa0e563af291b7ff9f87"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_markdown_parser/src/lexer/mod.rs: crates/biome_markdown_parser/src/lexer/mod.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in MarkdownLexer::consume_token_impl at line 353. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_markdown_parser/src/lexer/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/biome_markdown_parser/src/lexer/mod.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec082f05d33ffb2f9eba033c54bfb2e0c2fdde334f96389661232a37588adfe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_service/src/settings.rs: crates/biome_service/src/settings.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in Settings::apply_configuration at line 308. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_service/src/settings.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/biome_service/src/settings.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb9e5743d214a881b0f459782234d916e55d087572cb352119e5f0188534c06"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_css_parser/src/lexer/mod.rs: crates/biome_css_parser/src/lexer/mod.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in CssLexer::consume_token_with_fallback at line 588. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_css_parser/src/lexer/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/biome_css_parser/src/lexer/mod.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"935fe87363c98328ce7dc17574b3ff3e2340019f6bdec6ccc42d184d3bb326ee"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_js_type_info/src/interned_types.rs: crates/biome_js_type_info/src/interned_types.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in TypeDataSlotReplacements::rebuild at line 1667. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_js_type_info/src/interned_types.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/interned_types.rs"},"region":{"startLine":1667}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d19ffbb467ac5155313e10e30699c8cb4384bf3e686bc7691c7dc4ac6795d2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_service/src/file_handlers/html.rs: crates/biome_service/src/file_handlers/html.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in biome_service::file_handlers::html::format_embedded at line 803. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_service/src/file_handlers/html.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/biome_service/src/file_handlers/html.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5010b4ccdd965fdf806061187feada2df4f27e992b8f49bef42ff0c071edebc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_js_semantic/src/events.rs: crates/biome_js_semantic/src/events.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in SemanticEventExtractor::enter_identifier_binding at line 625. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_js_semantic/src/events.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/biome_js_semantic/src/events.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5cd881ea5b6194911e8f760fe5d6423285f2e1ba9ebd2444e97e082e471ad8e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_vue_semantic/src/semantic_model/references.rs: crates/biome_vue_semantic/src/semantic_model/references.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in biome_vue_semantic::semantic_model::references::usage_of at line 243. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_vue_semantic/src/semantic_model/references.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/biome_vue_semantic/src/semantic_model/references.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa235510f22d3841c1372a98025edc2a765ffa24765ccb5b4f636c71b5589921"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_html_parser/src/lexer/mod.rs: crates/biome_html_parser/src/lexer/mod.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in HtmlLexer::next_token at line 1804. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_html_parser/src/lexer/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/biome_html_parser/src/lexer/mod.rs"},"region":{"startLine":1804}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d19cde7d9e8c654703f787f8d90abbf89b267bc1428dd4dfdc67c1f8353bbb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_js_control_flow/src/visitor.rs: crates/biome_js_control_flow/src/visitor.rs changed 4 times in last 90 days, max cyclomatic complexity 66 in ControlFlowVisitor::visit at line 48. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_js_control_flow/src/visitor.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/biome_js_control_flow/src/visitor.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"8889313cec0a9065fb3e5d93d77444aa4a844e06a4124a663712cb35685a88be"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_module_graph/src/db/type_inference/lookup.rs: crates/biome_module_graph/src/db/type_inference/lookup.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in biome_module_graph::db::type_inference::lookup::find_member_key_type_with_resolver at line 421. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_module_graph/src/db/type_inference/lookup.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/biome_module_graph/src/db/type_inference/lookup.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a791b6846baee2bea2692bb91ccf0b1e155e6ec652b413df113236440881dd1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_tailwind_logic/src/syntax_service.rs: crates/biome_tailwind_logic/src/syntax_service.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in biome_tailwind_logic::syntax_service::inspect_string_literal at line 560. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_tailwind_logic/src/syntax_service.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/biome_tailwind_logic/src/syntax_service.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"877a21b00d963ad7229586a46a7df23eaa8499ed67292587c09dac52e3552d2d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_analyze/src/lib.rs: crates/biome_analyze/src/lib.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in Analyzer::run_with_optional_inspector at line 171. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_analyze/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/biome_analyze/src/lib.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec758a91cccd375d8dfecefc2cdc30dcb0ec6de49027fcf807e157ef07a7f88b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_module_graph/src/db/queries/type_inference/calls/implementation.rs: crates/biome_module_graph/src/db/queries/type_inference/calls/implementation.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in ArgumentTypeCompatibility::action at line 1075. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_module_graph/src/db/queries/type_inference/calls/implementation.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/biome_module_graph/src/db/queries/type_inference/calls/implementation.rs"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"e76ff1d0c78b6dd5156f30443a037122c855635c662101b1eb3849ba0e882504"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_js_analyze/src/lint/correctness/no_unused_variables.rs: crates/biome_js_analyze/src/lint/correctness/no_unused_variables.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in NoUnusedVariables::run at line 271. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_js_analyze/src/lint/correctness/no_unused_variables.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/biome_js_analyze/src/lint/correctness/no_unused_variables.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b5df94d17ce6ff2f87c94d6f53c2e6eea38efaeacd697d6a9f041307f341c1d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_html_parser/src/syntax/mod.rs: crates/biome_html_parser/src/syntax/mod.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in biome_html_parser::syntax::parse_element_allowing_sfc_blocks at line 476. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_html_parser/src/syntax/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/biome_html_parser/src/syntax/mod.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"09025cabc837889a7c902d22d53d91e68c00d5d70e1be3f70198dd2451b012e5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_js_syntax/src/expr_ext.rs: crates/biome_js_syntax/src/expr_ext.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in AnyJsExpression::contains_a_test_pattern at line 977. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_js_syntax/src/expr_ext.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/biome_js_syntax/src/expr_ext.rs"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f6052167e2ee990cb312a987405466c926d7545244ea69cac1dac641bd67cfa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_markdown_formatter/src/bullet_list.rs: crates/biome_markdown_formatter/src/bullet_list.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in ListBlockList::fmt at line 752. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_markdown_formatter/src/bullet_list.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/biome_markdown_formatter/src/bullet_list.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"51689fde86b87b2061916f4c6c2fc31d11936e783733f1dbbab0647ea6ad1b7b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_module_graph/src/js_module_info/collector.rs: crates/biome_module_graph/src/js_module_info/collector.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in JsModuleInfoCollector::infer_type at line 461. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_module_graph/src/js_module_info/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/biome_module_graph/src/js_module_info/collector.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"53af270a65b57a1ce3d99136b2b51bfca9a3a1e168faf0194a4264b9cbd1d405"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: xtask/codegen/src/formatter.rs: xtask/codegen/src/formatter.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in xtask_codegen::formatter::get_node_concept at line 740. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- xtask/codegen/src/formatter.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":"xtask/codegen/src/formatter.rs"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"0774bb0ecf0dec2e37e6ed61cc73f6cffea5a041b082bc15ec385c51602e6d25"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_markdown_parser/src/syntax/inline/mod.rs: crates/biome_markdown_parser/src/syntax/inline/mod.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in biome_markdown_parser::syntax::inline::parse_any_inline at line 255. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_markdown_parser/src/syntax/inline/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/biome_markdown_parser/src/syntax/inline/mod.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"31558eb857b1d16dabe3a8f187ae83673ce8bd738f1e8a4b3095cf76e273ce77"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_js_type_info/src/inferred_type/boolean_coercion.rs: crates/biome_js_type_info/src/inferred_type/boolean_coercion.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in BooleanCoercionVisitor::enter at line 149. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_js_type_info/src/inferred_type/boolean_coercion.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/biome_js_type_info/src/inferred_type/boolean_coercion.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e9c677bde71848f931483d7b39233fcdf3479d7e3194ac70a20ce01fc93218"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_css_semantic/src/semantic_model/builder.rs: crates/biome_css_semantic/src/semantic_model/builder.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in SemanticModelBuilder::push_event at line 158. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_css_semantic/src/semantic_model/builder.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/biome_css_semantic/src/semantic_model/builder.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b33d575a68bc8c7738b9129df33de276cf256154d06129772c078dccc3f1edf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_css_analyze/src/assist/source/use_sorted_properties.rs: crates/biome_css_analyze/src/assist/source/use_sorted_properties.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in RecessOrderMember::kind at line 357. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_css_analyze/src/assist/source/use_sorted_properties.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/biome_css_analyze/src/assist/source/use_sorted_properties.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a9d328ae107de113b3dd390f9ad7eee79f7632e4e30cfe63809b45643e3f62"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_js_analyze/src/lint/complexity/no_useless_fragments.rs: crates/biome_js_analyze/src/lint/complexity/no_useless_fragments.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in NoUselessFragments::run at line 156. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_js_analyze/src/lint/complexity/no_useless_fragments.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/biome_js_analyze/src/lint/complexity/no_useless_fragments.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"07c87fc17c3fe562b4c4b6ecde5fa4d8d1630b5bf584e0eeed36efbe33f4550e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_markdown_parser/src/to_html.rs: crates/biome_markdown_parser/src/to_html.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in biome_markdown_parser::to_html::extract_alt_text_inline at line 2064. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_markdown_parser/src/to_html.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/biome_markdown_parser/src/to_html.rs"},"region":{"startLine":2064}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e8dacd1e989e7cc6604b3506e85a6291e68cdc18fecd1b4b9272d3a8596348"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_css_semantic/src/events.rs: crates/biome_css_semantic/src/events.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in SemanticEventExtractor::enter at line 85. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_css_semantic/src/events.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/biome_css_semantic/src/events.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3fb60ee1540b7f33b61e2edbde7f449f11be72a4d05a7b232c58067ce468ae6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_markdown_formatter/src/words.rs: crates/biome_markdown_formatter/src/words.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in ProseItemCollector::collect at line 741. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_markdown_formatter/src/words.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/biome_markdown_formatter/src/words.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be87c91ca2d5b2d82c62539dc6dac2184c752a362a936ffdd3131c4c962d805"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_tailwind_logic/src/use_tailwind_sorted_classes/sort_v4.rs: crates/biome_tailwind_logic/src/use_tailwind_sorted_classes/sort_v4.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in PendingSortKey::from_candidate at line 488. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_tailwind_logic/src/use_tailwind_sorted_classes/sort_v4.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/biome_tailwind_logic/src/use_tailwind_sorted_classes/sort_v4.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b71894abb66827a267c8d84077ad60c09c9818505c46080abca0ad7257ad8d9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_cli/src/commands/inspect/plugins/mod.rs: crates/biome_cli/src/commands/inspect/plugins/mod.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in biome_cli::commands::inspect::plugins::inspect_plugins at line 332. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_cli/src/commands/inspect/plugins/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/biome_cli/src/commands/inspect/plugins/mod.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"086b6a1cef6b828b1af325d0e431fa3873513c1ef0d846de591413ddfa496427"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_css_parser/src/syntax/block/declaration_or_rule_list_block.rs: crates/biome_css_parser/src/syntax/block/declaration_or_rule_list_block.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in DeclarationOrRuleList::parse_element at line 193. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_css_parser/src/syntax/block/declaration_or_rule_list_block.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/biome_css_parser/src/syntax/block/declaration_or_rule_list_block.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"e27d76e9e0f8888da4d83ae56fa7cd7f90665d3863d91ed64010f266c3eaac2d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_markdown_parser/src/syntax/inline/emphasis.rs: crates/biome_markdown_parser/src/syntax/inline/emphasis.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in biome_markdown_parser::syntax::inline::emphasis::collect_delimiters at line 327. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_markdown_parser/src/syntax/inline/emphasis.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/biome_markdown_parser/src/syntax/inline/emphasis.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5650a154852088af9d0a392749c207afcfe645c46eaf047988d69749aa0fdfd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: xtask/codegen/src/generate_global_types/compare.rs: xtask/codegen/src/generate_global_types/compare.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in xtask_codegen::generate_global_types::compare::assert_promise_shape at line 191. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- xtask/codegen/src/generate_global_types/compare.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":"xtask/codegen/src/generate_global_types/compare.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"2188791d4074bca6e8fc3ee663effd7107f18274fce2fc5e35c9e1225d5dc8cf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_js_analyze/src/lint/style/use_consistent_test_it.rs: crates/biome_js_analyze/src/lint/style/use_consistent_test_it.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in biome_js_analyze::lint::style::use_consistent_test_it::update_import at line 305. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_js_analyze/src/lint/style/use_consistent_test_it.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/biome_js_analyze/src/lint/style/use_consistent_test_it.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"71c4f8a94d38697f71bfe5501f6107028f372e8305659ebd8745dc2d8264c02b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: xtask/rules_check/src/lib.rs: xtask/rules_check/src/lib.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in rules_check::check_rules at line 48. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- xtask/rules_check/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":"xtask/rules_check/src/lib.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"416ce1fa9cfb3dba66be6e1c3f85643bcff709605fb0766c260796ddb9f4cab5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_html_formatter/src/html/auxiliary/element.rs: crates/biome_html_formatter/src/html/auxiliary/element.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in FormatHtmlElement::fmt_inner at line 147. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_html_formatter/src/html/auxiliary/element.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/biome_html_formatter/src/html/auxiliary/element.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c37ae8c36ad2f49ce79bf04712c1194b265f092966d947f53fb14cfa6e8669e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_js_analyze/src/lint/correctness/no_unused_imports.rs: crates/biome_js_analyze/src/lint/correctness/no_unused_imports.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in biome_js_analyze::lint::correctness::no_unused_imports::is_unused at line 685. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_js_analyze/src/lint/correctness/no_unused_imports.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/biome_js_analyze/src/lint/correctness/no_unused_imports.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"e099e0c3984c1314c71c622344a7d15600be7aab507b633bde69c7b5ae790ea3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_js_analyze/src/lint/correctness/use_import_extensions.rs: crates/biome_js_analyze/src/lint/correctness/use_import_extensions.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in biome_js_analyze::lint::correctness::use_import_extensions::get_extensionless_import at line 269. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_js_analyze/src/lint/correctness/use_import_extensions.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/biome_js_analyze/src/lint/correctness/use_import_extensions.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"f096513d0e74746dbe8986387a9c2cdbd6030cee4250705ff95f9d04f9b62431"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_vue_semantic/src/semantic_model/mod.rs: crates/biome_vue_semantic/src/semantic_model/mod.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in biome_vue_semantic::semantic_model::sfc_model at line 70. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_vue_semantic/src/semantic_model/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/biome_vue_semantic/src/semantic_model/mod.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb183be50d54c7fb9cf864f83f8bcc368b4d30cef97db38842ebc8050a4eaef"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_js_analyze/src/lint/correctness/no_unused_private_class_members.rs: crates/biome_js_analyze/src/lint/correctness/no_unused_private_class_members.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in biome_js_analyze::lint::correctness::no_unused_private_class_members::traverse_members_usage at line 274. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_js_analyze/src/lint/correctness/no_unused_private_class_members.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/biome_js_analyze/src/lint/correctness/no_unused_private_class_members.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc9f3f2b4c405393dcd801ca40560e5de79416b8b5980a47582cf924067826a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_yaml_parser/src/lexer/mod.rs: crates/biome_yaml_parser/src/lexer/mod.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in YamlLexer::consume_flow_collection at line 516. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_yaml_parser/src/lexer/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/biome_yaml_parser/src/lexer/mod.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"cedf19b6c47584f20d13a34d60c9813ef8fd0869999d0f24b4f4ce21476e77f5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_lsp/src/handlers/analysis.rs: crates/biome_lsp/src/handlers/analysis.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in biome_lsp::handlers::analysis::code_actions at line 55. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_lsp/src/handlers/analysis.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/handlers/analysis.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ca4b3c82d933c0ec08cbd0c2b1cbbe8bc9b71de111c1f7886666f3f00912b61"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_tailwind_logic/src/use_tailwind_shorthand_classes.rs: crates/biome_tailwind_logic/src/use_tailwind_shorthand_classes.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in biome_tailwind_logic::use_tailwind_shorthand_classes::analyze_tailwind_shorthand at line 239. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_tailwind_logic/src/use_tailwind_shorthand_classes.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/biome_tailwind_logic/src/use_tailwind_shorthand_classes.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cfdfcf90fca5c22cf45c6f6e114e09f8e7844ab58cae6df0039161e8a146127"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_markdown_formatter/src/quote.rs: crates/biome_markdown_formatter/src/quote.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in QuoteBlockList::fmt at line 96. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_markdown_formatter/src/quote.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/biome_markdown_formatter/src/quote.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"62613b9a9e7963a55f7ee4fa0407eea44409db15f2a7d2baab204bbb8a4cc331"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_cli/src/commands/inspect/config/configuration.rs: crates/biome_cli/src/commands/inspect/config/configuration.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in ConfigurationInspector::inspect_key at line 79. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_cli/src/commands/inspect/config/configuration.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/biome_cli/src/commands/inspect/config/configuration.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f694e8d7be47f75017d9bda9168b5cfb6a4027a29b91a99db50230e3d903fa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_cli/src/runner/impls/collectors/default.rs: crates/biome_cli/src/runner/impls/collectors/default.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in DefaultCollector::run at line 160. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_cli/src/runner/impls/collectors/default.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/biome_cli/src/runner/impls/collectors/default.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb4c69710a8385503c8defb2684f5ffacc6f01c76c6decb28f2a1eecff9b4b3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_markdown_parser/src/syntax/link_block.rs: crates/biome_markdown_parser/src/syntax/link_block.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in biome_markdown_parser::syntax::link_block::is_valid_link_definition_lookahead at line 85. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_markdown_parser/src/syntax/link_block.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/biome_markdown_parser/src/syntax/link_block.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"52bac90ea4f8a525850289bc31438d0cdcbd5b524070662440f0468de77c86d5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_grit_patterns/src/grit_node_patterns.rs: crates/biome_grit_patterns/src/grit_node_patterns.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in GritNodePattern::execute at line 139. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_grit_patterns/src/grit_node_patterns.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/biome_grit_patterns/src/grit_node_patterns.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae188e957e6c18b37bfd7a7f7cfcbb50d34b411a2c341e4ac77a1896b5044a8c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_vue_semantic/src/format_semantic_model.rs: crates/biome_vue_semantic/src/format_semantic_model.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in biome_vue_semantic::format_semantic_model::write_symbol 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_vue_semantic/src/format_semantic_model.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/biome_vue_semantic/src/format_semantic_model.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc217336336386ec0b3dc04bd64f24288dc8ac35d26e964c81775e7eb93f9ca7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_formatter/src/format_element/document.rs: crates/biome_formatter/src/format_element/document.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in Document::propagate_expand at line 40. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_formatter/src/format_element/document.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/biome_formatter/src/format_element/document.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d45ec5f88cb0daf4e84a6e760f0875ca608ebdb61f2004053a8b153ba97f414"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_js_formatter/src/js/auxiliary/template_element.rs: crates/biome_js_formatter/src/js/auxiliary/template_element.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in FormatTemplateElement::fmt at line 106. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_js_formatter/src/js/auxiliary/template_element.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/biome_js_formatter/src/js/auxiliary/template_element.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a6bdb03c3125182093c9123ba157804e2fb0d77f7ff8f0775b086cd32496fae"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_js_analyze/src/lint/correctness/no_vue_ref_as_operand.rs: crates/biome_js_analyze/src/lint/correctness/no_vue_ref_as_operand.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in biome_js_analyze::lint::correctness::no_vue_ref_as_operand::track_to_refs_references at line 348. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_js_analyze/src/lint/correctness/no_vue_ref_as_operand.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/biome_js_analyze/src/lint/correctness/no_vue_ref_as_operand.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebc87db563b856a706283372f4b141ce7e1c8d46eee30dcfbea8b7a4b3b4036a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_configuration_macros/src/group_struct.rs: crates/biome_configuration_macros/src/group_struct.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in biome_configuration_macros::group_struct::generate_group_struct at line 8. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_configuration_macros/src/group_struct.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/biome_configuration_macros/src/group_struct.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb3eac596a17f061531efac29755029af756e265654df666ca14d9c6459fb00"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_js_analyze/src/lint/nursery/use_exhaustive_switch_cases.rs: crates/biome_js_analyze/src/lint/nursery/use_exhaustive_switch_cases.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in UseExhaustiveSwitchCases::run at line 154. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_js_analyze/src/lint/nursery/use_exhaustive_switch_cases.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/biome_js_analyze/src/lint/nursery/use_exhaustive_switch_cases.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d08b3c0d0c72e97d9aa57e21bdf7a2f565a8bfc0b8105a6163e1f443d1f10a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_service/src/workspace_types.rs: crates/biome_service/src/workspace_types.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in biome_service::workspace_types::instance_type at line 95. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_service/src/workspace_types.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/workspace_types.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7504bc54c72f51edcac32be90a98844fcb08c233ebd99edfeca3c184de0b942"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_module_graph/src/db/queries.rs: crates/biome_module_graph/src/db/queries.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in biome_module_graph::db::queries::find_js_exported_symbol at line 33. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_module_graph/src/db/queries.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/biome_module_graph/src/db/queries.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"5180cb507bd79e0fd23379057e4f6c00a3e18ae3def4a250ae9a361e9075f30e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_yaml_formatter/src/yaml/auxiliary/block_map_explicit_entry.rs: crates/biome_yaml_formatter/src/yaml/auxiliary/block_map_explicit_entry.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in FormatYamlBlockMapExplicitEntry::fmt_fields at line 17. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_yaml_formatter/src/yaml/auxiliary/block_map_explicit_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/biome_yaml_formatter/src/yaml/auxiliary/block_map_explicit_entry.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"6577d23cec250454c1ae4d87db1b353e83613839778e0921e7ae13333e73e6ee"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_service/src/file_handlers/javascript/go_to.rs: crates/biome_service/src/file_handlers/javascript/go_to.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in biome_service::file_handlers::javascript::go_to::resolve_binding at line 26. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_service/src/file_handlers/javascript/go_to.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/biome_service/src/file_handlers/javascript/go_to.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbae0bb9888159d00bb2d9d3069f98ec6a3b81029653ba22d16c55a1b743b34c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_js_analyze/src/lint/style/use_block_statements.rs: crates/biome_js_analyze/src/lint/style/use_block_statements.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in UseBlockStatements::action at line 179. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_js_analyze/src/lint/style/use_block_statements.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/biome_js_analyze/src/lint/style/use_block_statements.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd3e6a752920a614e3d6985771450a9f092ab3db898990e0be869f20f9e8ea0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_module_graph/src/css_module_info/visitor.rs: crates/biome_module_graph/src/css_module_info/visitor.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in CssModuleVisitor::visit at line 29. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_module_graph/src/css_module_info/visitor.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/biome_module_graph/src/css_module_info/visitor.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"107a137bc1fcfa9acc4e531d5179cde70439e43614d5ec973c6b1e2bc984662a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_markdown_parser/src/syntax/inline/links.rs: crates/biome_markdown_parser/src/syntax/inline/links.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in biome_markdown_parser::syntax::inline::links::collect_link_text at line 526. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_markdown_parser/src/syntax/inline/links.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/biome_markdown_parser/src/syntax/inline/links.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"540fbe8dcaef6286b88120059f047c06849bfb9a8fe4fe52ad98c66e5fcaa59b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_html_formatter/src/utils/css_display.rs: crates/biome_html_formatter/src/utils/css_display.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in biome_html_formatter::utils::css_display::get_css_display at line 352. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_html_formatter/src/utils/css_display.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/biome_html_formatter/src/utils/css_display.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f228368175e69b82a08679d293dd462d08a65d9c257df1f51936a9364b72203"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_module_graph/src/js_module_info/flow/guards.rs: crates/biome_module_graph/src/js_module_info/flow/guards.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in GuardFunctions::guard at line 265. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_module_graph/src/js_module_info/flow/guards.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/biome_module_graph/src/js_module_info/flow/guards.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"5683a11576be344f412f1a999af2ef7218c4a9f0adad3afc912d6ea039d410da"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_analyze/src/suppressions.rs: crates/biome_analyze/src/suppressions.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in Suppressions::suppresses at line 442. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_analyze/src/suppressions.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/biome_analyze/src/suppressions.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"616c5bf51047697b7bab2cb31e3b03a619bda9e6bada68f7ef62205d40f129bf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/biome_js_formatter/src/ts/expressions/type_arguments.rs: crates/biome_js_formatter/src/ts/expressions/type_arguments.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in FormatTsTypeArguments::fmt_fields 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_js_formatter/src/ts/expressions/type_arguments.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/biome_js_formatter/src/ts/expressions/type_arguments.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ade7bfc830fe8c5eb8b400fbba5c26c2b9e0f0ac0e11f3426d268a246a34b76"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/biome_js_parser/src/syntax/program.rs: crates/biome_js_parser/src/syntax/program.rs changed 8 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is biome_js_parser::syntax::program::parse at line 37), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(core): parse and visit generics (#13057)\u201D; \u201Cfix(svelte): parse type annotations in const tags (#13021)\u201D; \u201Cfix(vue): parse \u0060generic\u0060 attribute of Vue setup scripts (#12124)\u201D; \u201Cfix(format/html/vue): format Vue event handlers that are statements (#12218)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_js_parser/src/syntax/program.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/biome_js_parser/src/syntax/program.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"5944ec781fc8105c89cf8e6fb8ee973ff3007792ee0e35c3960965a377428928"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/biome_languages/src/javascript.rs: crates/biome_languages/src/javascript.rs changed 9 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is JsFileSource::try_from_extension at line 734), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(core): parse and visit generics (#13057)\u201D; \u201Cfix(svelte): parse type annotations in const tags (#13021)\u201D; \u201Cfix(vue): parse \u0060generic\u0060 attribute of Vue setup scripts (#12124)\u201D; \u201Cfix(vue): slots are now parsed with a new root (#12030)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_languages/src/javascript.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/biome_languages/src/javascript.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c23588bfb70df9823d40cdb1965454715e576e76c7372ba3945abd7b5456cb"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/biome_embeds/src/references.rs: crates/biome_embeds/src/references.rs changed 8 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is biome_embeds::references::vue_directive_name_matches_reference_name at line 156), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(vue): parse \u0060generic\u0060 attribute of Vue setup scripts (#12124)\u201D; \u201Cfix(vue): slots are now parsed with a new root (#12030)\u201D; \u201Cfix(tailwind): detect tailwind classes in class expressions (#11802)\u201D; \u201Cfix(service): preserve embedded references in stateless processing (#11398)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_embeds/src/references.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/biome_embeds/src/references.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fbc3e7f1b71ea5267542a740f29b47ed77b7f173111d0253a3ee49af7c4499a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/biome_css_analyze/src/lint/correctness/no_missing_var_function.rs: crates/biome_css_analyze/src/lint/correctness/no_missing_var_function.rs changed 7 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is biome_css_analyze::lint::correctness::no_missing_var_function::is_wrapped_in_var at line 226), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(lint/css): resolve root declarations in embedded snippets (#12967)\u201D; \u201Cfix: improve more lint diagnostics (#12354)\u201D; \u201Cfix(css): support Sass values in modern if() branches (#12209)\u201D; \u201Cfix(css_parser): distinguish legacy and modern if() syntax (#12047)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_css_analyze/src/lint/correctness/no_missing_var_function.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_analyze/src/lint/correctness/no_missing_var_function.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6422049721d13a7c9a8f227e42af4496ea4d8fe94d93e0130e3ee539a884a13"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/biome_tailwind_parser/src/lexer/mod.rs: crates/biome_tailwind_parser/src/lexer/mod.rs changed 6 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is TailwindLexer::consume_token_saw_negative at line 90), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(parse/tailwind): handle long dashed base names when aribtrary values are involved (#12898)\u201D; \u201Cfix(tailwind): read stylesheets imported from packages (#12192)\u201D; \u201Cfix(parse/tailwind): parse CSS variable shorthands as parameter lists (#12183)\u201D; \u201Cfix(parse/tailwind): tokenize binary minus in CSS values (#12181)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_tailwind_parser/src/lexer/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/biome_tailwind_parser/src/lexer/mod.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf02a708503d02c54cabc14a5d265987337f58147d9ccd0bdd106fcfa92a3498"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/biome_js_parser/src/parse.rs: crates/biome_js_parser/src/parse.rs changed 6 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is Parse::cast at line 37), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(vue): parse \u0060generic\u0060 attribute of Vue setup scripts (#12124)\u201D; \u201Cfix(vue): slots are now parsed with a new root (#12030)\u201D; \u201Cfix(tailwind): detect tailwind classes in class expressions (#11802)\u201D; \u201Cfix(rowan): avoid stack overflow when dropping deep trees (#11368)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_js_parser/src/parse.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_parser/src/parse.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"84b531b48c8d82c6d5407aa711d414731be2c5c8dd28d3e0719b49067ac836c9"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/biome_css_analyze/src/lint/style/no_descending_specificity.rs: crates/biome_css_analyze/src/lint/style/no_descending_specificity.rs changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is biome_css_analyze::lint::style::no_descending_specificity::find_descending_selector at line 292), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(noDescendingSpecificity): resolve tail selectors (#12588)\u201D; \u201Cfix: lint rules and typescript reference resolution (#11751)\u201D; \u201Cfix(noDuplicateProperties): handle function named (#11591)\u201D; \u201Cfix(noDescendingSpecificity): improve specificity comparison (#11539)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_css_analyze/src/lint/style/no_descending_specificity.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/biome_css_analyze/src/lint/style/no_descending_specificity.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b1de23ce80a4e8ceabc3a8273a89e5842ad455c1df6c313920885f7b785c85"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/biome_css_parser/src/syntax/property/custom.rs: crates/biome_css_parser/src/syntax/property/custom.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is biome_css_parser::syntax::property::custom::parse_custom_property_component at line 244), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(css_parser): lex digit-led hash names in raw custom property values (#12805)\u201D; \u201Cfix(css):  preserve URL nodes in SCSS custom properties (#12398)\u201D; \u201Cfix(css): preserve Sass function call boundaries (#11764)\u201D; \u201Cfix(css/parse): legacy filters (#11582)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_css_parser/src/syntax/property/custom.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/biome_css_parser/src/syntax/property/custom.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdba99f59fa53fe76420ed97b12d85931dbbf036d685b574f1f71781ebeb1150"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/biome_js_formatter/src/lib.rs: crates/biome_js_formatter/src/lib.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is FormatNodeRule::fmt_node at line 375), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(core): astro fmt embedding (#11975)\u201D; \u201Cfix(format/js): omit redundant unary operand parentheses (#11724)\u201D; \u201Cfix(js/parser): read Astro template expression contents as Astro does (#11440)\u201D; \u201Cfix(js/parser): support Astro implicit fragments and void elements (#11437)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_js_formatter/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/biome_js_formatter/src/lib.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccb265e63f2bd65c1664115bac43a491dfdb16ccd2cced5adfafe967dc40f564"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/biome_css_parser/src/syntax/scss/expression/mod.rs: crates/biome_css_parser/src/syntax/scss/expression/mod.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is ScssExpressionOptions::with_end_ts at line 122), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(css): support Sass values in modern if() branches (#12209)\u201D; \u201Cfix(css_parser): parse unary and identifier-led SCSS list expressions (#12096)\u201D; \u201Cfix(css_parser): parse SCSS module variables in media queries (#11765)\u201D; \u201Cfix(css): preserve Sass function call boundaries (#11764)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_css_parser/src/syntax/scss/expression/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/biome_css_parser/src/syntax/scss/expression/mod.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe7298a00a7b9fccced01595f84afbdc49b8b28a4b64fb1baf99f9a4870acf8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/biome_grit_patterns/src/grit_target_language/js_target_language.rs: crates/biome_grit_patterns/src/grit_target_language/js_target_language.rs changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is JsTargetLanguage::is_disregarded_snippet_field at line 138), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: various bug fixes (#11735)\u201D; \u201Cfix: various fixes (#11670)\u201D; \u201Cfix(grit): query named imports (#11627)\u201D; \u201Cfix(grit): match named re-export specifiers (#11458)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_grit_patterns/src/grit_target_language/js_target_language.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/biome_grit_patterns/src/grit_target_language/js_target_language.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"e28292965f6dda7afaa1f23f31679ac6d52306b6e6629d052c8806c93ef90884"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/biome_service/src/embed/html.rs: crates/biome_service/src/embed/html.rs changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is biome_service::embed::html::resolve_script_language at line 309), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(core): parse and visit generics (#13057)\u201D; \u201Cfix(vue): parse \u0060generic\u0060 attribute of Vue setup scripts (#12124)\u201D; \u201Cfix(vue): slots are now parsed with a new root (#12030)\u201D; \u201Cfix(js/parser): read Astro template expression contents as Astro does (#11440)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_service/src/embed/html.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/biome_service/src/embed/html.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"22fa5f8d45a2056f972127ea7718f4701cd4774a8544fba30a1f49b8379a21a8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/biome_css_parser/src/syntax/property/mod.rs: crates/biome_css_parser/src/syntax/property/mod.rs changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is biome_css_parser::syntax::property::parse_composes_property_value at line 176), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(css_parser): don\u0027t panic on non-identifier composes value (#13033)\u201D; \u201Cfix(css): support Sass values in modern if() branches (#12209)\u201D; \u201Cfix(parse/css): support Grit metavariables in selectors and property names (#12199)\u201D; \u201Cfix(css/parse): legacy filters (#11582)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_css_parser/src/syntax/property/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/biome_css_parser/src/syntax/property/mod.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef6782ea679952c91a5b83c4106d673718f2b88810d7b1ff0eb9deae38684654"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/biome_css_parser/src/syntax/selector/mod.rs: crates/biome_css_parser/src/syntax/selector/mod.rs changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is biome_css_parser::syntax::selector::parse_sub_selector at line 602), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(css): support compound SCSS placeholder selectors (#12276)\u201D; \u201Cfix(parse/css): support Grit metavariables in selectors and property names (#12199)\u201D; \u201Cfix(css_parser): allow final semicolon omission in SCSS at-rules (#11714)\u201D; \u201Cfix(css_parser): support interpolated subselectors in SCSS (#11685)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_css_parser/src/syntax/selector/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/biome_css_parser/src/syntax/selector/mod.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"f811fbc1a8f3fff03dd009667322174d356365b0069600a137a160d802612d93"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/biome_css_parser/src/syntax/at_rule/feature.rs: crates/biome_css_parser/src/syntax/at_rule/feature.rs changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is biome_css_parser::syntax::at_rule::feature::parse_named_query_feature at line 101), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(css_parser): correct variable-led SCSS media ranges (#12196)\u201D; \u201Cfix(scss): support unary expressions in query values (#11974)\u201D; \u201Cfix(css_parser): parse SCSS module variables in media queries (#11765)\u201D; \u201Cfix(css_parser): allow parenthesized Sass query values  (#11680)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_css_parser/src/syntax/at_rule/feature.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/biome_css_parser/src/syntax/at_rule/feature.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"1733820e9589964ea4931de338b462aa0c9f53df1d0c1ac799887ebf8d3a9249"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/biome_html_parser/src/token_source.rs: crates/biome_html_parser/src/token_source.rs changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is HtmlEmbeddedLanguage::closing_tag_name at line 221), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(parse/html/vue): parse \u0060v-for\u0060 binding default values (#12702)\u201D; \u201Cfix(html): lex processing instructions in their own context (#12292)\u201D; \u201Cfix(lint/html/svelte): mark \u0060class:\u0060 and \u0060style:\u0060 shorthands as variable usages (#12246)\u201D; \u201Cfix(html/parser): correct Astro document parsing (#11403)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_html_parser/src/token_source.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_parser/src/token_source.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"70340e2f004ecb8bb6b7ae8ce4656181eb62f726f08bd434fe35260b5625e61a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/biome_js_formatter/src/utils/format_binary_like_expression.rs: crates/biome_js_formatter/src/utils/format_binary_like_expression.rs changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is FormatBinaryLikeOperatorAndRight::fmt at line 381), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(format/html/vue): format Vue directive values inside quotes (#12131)\u201D; \u201Cfix: formatter and lint rules (#11790)\u201D; \u201Cfix(format/js): omit redundant unary operand parentheses (#11724)\u201D; \u201Cfix(format/js): keep comments above binary operators with operatorLinebreak before (#11718)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_js_formatter/src/utils/format_binary_like_expression.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/biome_js_formatter/src/utils/format_binary_like_expression.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe547753cb992011afef386ffc834f917c3878959a5a2c3e3366a4c636a5cf3"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/biome_module_graph/src/db/type_inference/imports.rs: crates/biome_module_graph/src/db/type_inference/imports.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is ResolutionCtx::resolve_import_member_with_steps at line 362), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(inference): keep context and avoid overflow (#12041)\u201D; \u201Cfix(inference): reduce unnecessary type inference (#11631)\u201D; \u201Cfix(type_inference): infer non-cyclic declarations in module cycles (#11555)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_module_graph/src/db/type_inference/imports.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/biome_module_graph/src/db/type_inference/imports.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"5943faf69f246419807d3fe0344526733cfb5da20125024288817444c5d0f7c2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/biome_js_analyze/src/lint/complexity/no_useless_string_concat.rs: crates/biome_js_analyze/src/lint/complexity/no_useless_string_concat.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is biome_js_analyze::lint::complexity::no_useless_string_concat::extract_string_value at line 376), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(biome_js_analyze): preserve JS number stringification semantics in noUselessStringConcat (#12211)\u201D; \u201Cfix(noUselessStringConcat): escape quotes in string concat fixes (#11914)\u201D; \u201Cfix(analyzer): various bugs (#11720)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_js_analyze/src/lint/complexity/no_useless_string_concat.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/biome_js_analyze/src/lint/complexity/no_useless_string_concat.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"d39377cc05942b13eea11ef8cfb6e1a2eeb4d8fb78e3026cff1bbc74f530c1b9"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/biome_analyze/src/matcher.rs: crates/biome_analyze/src/matcher.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is RuleFilter::eq at line 152), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(analyze): first class citizen snippets (#11915)\u201D; \u201Cfix: various fixes (#11670)\u201D; \u201Cfix(analyzer): suppressions via trait (#11660)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_analyze/src/matcher.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/biome_analyze/src/matcher.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e6e2af27c33c5ec9aa82eb4f66f0458f4f46cb1e05400a1afb0b15d45aafcab"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/biome_service/src/workspace.rs: crates/biome_service/src/workspace.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is FeaturesSupported::with_settings_and_language at line 199), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: mark pnpm-lock.yaml as protected file (#12664)\u201D; \u201Cfix(loader): js plugins (#12188)\u201D; \u201Cfix(workspace): scanner behaviour (#11533)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_service/src/workspace.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/biome_service/src/workspace.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee469070a3f4f28bd1e6f0e7b5a55d9a196bee917da22359e1af9086f79f7e31"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/biome_cli/src/execute/migrate/prettier.rs: crates/biome_cli/src/execute/migrate/prettier.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is biome_cli::execute::migrate::prettier::load_config at line 491), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(migrate): carry Prettier\u0027s bracketSpacing into the top-level (#12670)\u201D; \u201Cfix(migrate): carry Prettier\u0027s bracketSpacing in overrides (#12649)\u201D; \u201Cfix(migrate): use Prettier\u0027s defaults for semi and singleQuote (#12266)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_cli/src/execute/migrate/prettier.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/biome_cli/src/execute/migrate/prettier.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"01983bca2d559926d779e61a7c2ee78be9155be3899cd12b0ee857f00ea52617"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/biome_js_parser/src/syntax/jsx/mod.rs: crates/biome_js_parser/src/syntax/jsx/mod.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is JsxAttributeList::parse_element at line 667), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(js_parser): accept any expression in Astro shorthand attributes (#12394)\u201D; \u201Cfix(js/parser): read Astro template expression contents as Astro does (#11440)\u201D; \u201Cfix(js/parser): support Astro implicit fragments and void elements (#11437)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_js_parser/src/syntax/jsx/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/biome_js_parser/src/syntax/jsx/mod.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd1a6566bf1c2760623b5da35d91c947b6f530de8f24b8e6741d5937e3bebee0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/biome_js_syntax/src/lib.rs: crates/biome_js_syntax/src/lib.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is OperatorPrecedence::try_from_binary_operator at line 244), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(js/parser): read Astro template expression contents as Astro does (#11440)\u201D; \u201Cfix(inference): use local inference for constructor dependent members (#11443)\u201D; \u201Cfix(parse/js): handle incomplete declarations more gracefully (#11422)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_js_syntax/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/biome_js_syntax/src/lib.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a0f554c3a5f1098506db97c977b3f9d9f63e24195a399340a516f305715567"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/biome_css_parser/src/syntax/at_rule/unknown.rs: crates/biome_css_parser/src/syntax/at_rule/unknown.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is UnknownAtRuleComponentBalance::bump at line 222), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(css): parse quoted interpolation in unknown SCSS at-rules (#12259)\u201D; \u201Cfix(css): preserve interpolated SCSS at-rule names (#12205)\u201D; \u201Cfix(css_parser): allow final semicolon omission in SCSS at-rules (#11714)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_css_parser/src/syntax/at_rule/unknown.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/biome_css_parser/src/syntax/at_rule/unknown.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb797d76df179f176b79bc15380c68fbf3a02d56feace229517ae607357c17a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/biome_analyze/src/syntax.rs: crates/biome_analyze/src/syntax.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is SyntaxVisitor::visit at line 59), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(useSimplifiedLogicExpression): preserve all trivia (#11731)\u201D; \u201Cfix: various fixes (#11670)\u201D; \u201Cfix(analyzer): suppressions via trait (#11660)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_analyze/src/syntax.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/biome_analyze/src/syntax.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0cdc74b6c3996df0688c48bb9cc48faae6bec8a97d1d523e087e056f98ef5f3"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/biome_js_analyze/src/lint/a11y/no_label_without_control.rs: crates/biome_js_analyze/src/lint/a11y/no_label_without_control.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is biome_js_analyze::lint::a11y::no_label_without_control::has_accessible_label at line 180), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(js_parser): accept any expression in Astro shorthand attributes (#12394)\u201D; \u201Cfix: improve even more lint diagnostics (#12355)\u201D; \u201Cfix(js/parser): read Astro template expression contents as Astro does (#11440)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_js_analyze/src/lint/a11y/no_label_without_control.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/biome_js_analyze/src/lint/a11y/no_label_without_control.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca1dd023e75ce1688bc8936c801729a18d3668c66348fb75e87b0c3ae72db74"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/biome_js_analyze/src/lint/suspicious/no_global_assign.rs: crates/biome_js_analyze/src/lint/suspicious/no_global_assign.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is NoGlobalAssign::run at line 64), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: improve more lint diagnostics (#12354)\u201D; \u201Cfix(migrate): apply upstream lint rule scope decisions (#12141)\u201D; \u201Cfix(noGlobalAssign): do not report assignments to bindings from Vue setup script (#11502)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_js_analyze/src/lint/suspicious/no_global_assign.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/biome_js_analyze/src/lint/suspicious/no_global_assign.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"df606d544e62ec0c25c41f259c16b336557d94f5ce311df337aecc1634f20b9e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/biome_cli/src/commands/inspect.rs: crates/biome_cli/src/commands/inspect.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is InspectionDiagnostic::source_advices at line 331), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(lsp): empty messages in diagnostics (#12346)\u201D; \u201Cfix(cli): inspect config without key (#12208)\u201D; \u201Cfix(cli): inspect plugins (#11634)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_cli/src/commands/inspect.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/biome_cli/src/commands/inspect.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd2de7a4bb2049887a8008f77b3dafc8e118c49bb3f60ef16483035d2798f1e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/biome_js_analyze/src/lint/complexity/use_simplified_logic_expression.rs: crates/biome_js_analyze/src/lint/complexity/use_simplified_logic_expression.rs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is UseSimplifiedLogicExpression::run at line 89), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: improve even more lint diagnostics (#12355)\u201D; \u201Cfix(useSimplifiedLogicExpression): don\u0027t simplify right-side boolean literals (#11761)\u201D; \u201Cfix(useSimplifiedLogicExpression): preserve all trivia (#11731)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_js_analyze/src/lint/complexity/use_simplified_logic_expression.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/biome_js_analyze/src/lint/complexity/use_simplified_logic_expression.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"343cf9b60cde27ff520c446e875f05b8e6a59408cd74820fbb91b99899df3cda"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/biome_css_formatter/src/scss/auxiliary/unary_expression.rs: crates/biome_css_formatter/src/scss/auxiliary/unary_expression.rs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is biome_css_formatter::scss::auxiliary::unary_expression::needs_space_after_minus at line 61), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(css): support computed SCSS @supports names (#12307)\u201D; \u201Cfix(scss): support unary expressions in query values (#11974)\u201D; \u201Cfix(css): preserve Sass function call boundaries (#11764)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_css_formatter/src/scss/auxiliary/unary_expression.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/biome_css_formatter/src/scss/auxiliary/unary_expression.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"52f86f7dff79258a5744fcc075ed39edc1a80ac97a4a14aa580b43b539a4ca54"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/biome_css_parser/src/syntax/at_rule/tailwind.rs: crates/biome_css_parser/src/syntax/at_rule/tailwind.rs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is ThemeOptionList::recover at line 63), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(parse/css): fix parsing of tailwind \u0060@theme\u0060 options (#12203)\u201D; \u201Cfix(css_parser): accept leading digits in Tailwind custom variants (#12180)\u201D; \u201Cfix(css_parser): allow final semicolon omission in SCSS at-rules (#11714)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:40:27 -05:00\u0027 --until=\u00272026-11-13 18:40:27 -05:00\u0027 --full-history --no-merges -- crates/biome_css_parser/src/syntax/at_rule/tailwind.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/biome_css_parser/src/syntax/at_rule/tailwind.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f0dd0769a35e723cd66b11b04beef9f9957cf1f338be6d23586274756a5c4a6"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 52 significant file(s) lose their only recent owner: crates/biome_service/src/db/state.rs, crates/biome_markdown_formatter/src/markdown/lists/inline_item_list.rs, crates/biome_module_graph/src/db/type_inference/imports.rs, crates/biome_module_graph/src/type_inference/profiling.rs, crates/biome_css_syntax/src/property_syntax/parser.rs, crates/biome_manifest/src/lib.rs, crates/biome_markdown_formatter/src/markdown/auxiliary/link_title.rs, crates/biome_cli/src/commands/inspect.rs (\u002B44 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5a15cbd0901f6c5a271ec5af5fae705a3ca9df9c29bded1214f1a79359c6e22d"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #2: If anonymized user #2 becomes unavailable, 49 significant file(s) lose their only recent owner: crates/biome_css_parser/src/syntax/at_rule/feature.rs, crates/biome_css_parser/src/syntax/scss/expression/list.rs, crates/biome_css_parser/src/syntax/scss/declaration/nesting.rs, crates/biome_css_formatter/src/scss/auxiliary/each_header.rs, crates/biome_css_parser/src/syntax/scss/value/interpolated_value.rs, crates/biome_css_parser/src/syntax/scss/at_rule/module_clauses.rs, crates/biome_css_syntax/src/scss_ext/map.rs, crates/biome_css_formatter/src/utils/scss_interpolated_string/raw_interpolation.rs (\u002B41 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bbcd04a49707cde1d8fb9025b553dfc3dd60603e41e07fd0a65e275d41dd8e15"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #3: If anonymized user #3 becomes unavailable, 33 significant file(s) lose their only recent owner: xtask/codegen/src/generate_global_types/lower/generic.rs, crates/biome_analyze/src/unsupported_rules.rs, crates/biome_tailwind_logic/src/syntax_service.rs, crates/biome_analyze/src/profiling.rs, crates/biome_tailwind_logic/src/use_tailwind_sorted_classes/design_system.rs, crates/biome_tailwind_logic/src/no_tailwind_raw_colors.rs, crates/biome_js_analyze/src/lint/nursery/no_double_comparison.rs, crates/biome_yaml_formatter/src/yaml/auxiliary/block_content.rs (\u002B25 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"82cb316cdb3b5f8f615147b496971209b80f2abc6b35f1fa14182cecacc9f466"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 6 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (140 single-owned of 2103 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 2103 of the 4474 production source files in this repository met that bar). They are anonymized user #4 (1 file(s)), anonymized user #5 (1 file(s)), anonymized user #6 (1 file(s)), anonymized user #7 (1 file(s)), anonymized user #8 (1 file(s)), anonymized user #9 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: crates/biome_js_analyze/src/lint/suspicious/no_identical_test_title.rs, scripts/version-check.ts, crates/biome_js_analyze/src/lint/nursery/no_misleading_return_type.rs, crates/biome_js_formatter/src/js/expressions/sequence_expression.rs, xtask/codegen/src/yaml_kinds_src.rs, crates/biome_css_formatter/src/css/lists/declaration_or_rule_list.rs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove these exceptions in Biome 3.0 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/rules_check/src/lib.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a54939d2438632700dd99487326c6b36bc4653a8464389c516d93a2e02f4f5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove these exceptions in Biome 3.0 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/rules_check/src/lib.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f291b691119a5716fe93acb141886acfc4f8e9a5f67450726342e1ae78cc18b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove these exceptions in Biome 3.0 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/rules_check/src/lib.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6e717416aca3a02acbcc018ef3d98ec6557fcdc64a93f4a7b9e638ddf34bfca"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This is CSS-specific and would be better handled with a per-language \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/ast.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f931a2c9c2001e12b29411be513a42492824bdc84485a32b0e56468d1772e13"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This is CSS-specific and would be better handled with a per-language \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/ast.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a4fd7a3c30cc891b22c5abd9892cbb842cdd5a0d5cac19b968d7b371082f17"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This is CSS-specific and would be better handled with a per-language \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_syntax_codegen/src/ast.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"7daf7f42fc53b3d018f759e15570fd2a434b50097f2a1652d3f7ea564dfde45a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This is CSS-specific and would be better handled with a per-language \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_syntax_codegen/src/ast.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee1755a97f92e4518b8a0218626cda6477399f2d319e44796f4816c42c06e567"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This is CSS-specific and would be nice to handle in a \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/formatter.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db2fac8493e1c79f6e329178eb95fbe72132de17697d5c27dc5341fca972a17"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: implement formatter \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/formatter.rs"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe7abf4539d33c4e3164b0cda7c548f3cd535892c574cbb39a6f2d13fc9cc4f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: review documentation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/generate_nodes.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ddabd122b8b1a4b8943f2708a8b74d9e8068fd28652bd116cc5eb1743eebbf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: review documentation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_syntax_codegen/src/generate_nodes.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a9a89ca12396de705a15c54710157448856e3f26ab495752bf928b7042341c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement range checking for the slot index to ensure other \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/generate_nodes_mut.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee714b8ce8d5adf1678ca15288a17cca3210362f97837d3375120637b4b06034"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement range checking for the slot index to ensure other \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_syntax_codegen/src/generate_nodes_mut.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce113a29b0309a7803a5566211a0fa2c5c4bb63350b721bd713ded206a6e54e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We might want to move this to \u0060js_kinds_src.rs\u0060 when we \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/generate_target_language_constants.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b53b50bd2c8173babc924def13ccf8d4b926e03193c3674dd277c0f23d7062"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: workaround for $kind$out adding an extra space between the two \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/codegen/src/language_kind.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"efccff3c7a2bb16b20ba5cc8a4678c9b84b997601fc072cbad4dc860ed193ab6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Not implemented at the moment \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/@biomejs/backend-jsonrpc/src/transport.ts"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"767a23a3230a02dcea09d2ef7783567991ae294ef0122a47ef731965579c74c4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Not implemented at the moment \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/@biomejs/backend-jsonrpc/src/transport.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaac97892e28da835bac5ff8ef32473cc55a042a51c64358adbcffc7124fdb4e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: replace with OnceLock when upgrading to 1.70 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fuzz/fuzz_targets/rome_common.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"237332a026ef6b9c6c9812a2e5355375d7fbaa3f1b5139a8a44b6a7d25b0759d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: parse multiline plain scalar at current indentation level \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_yaml_parser/src/lexer/mod.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2ac1dc5a2119c01b7621131c30b9673b071a8a5a67663909719b03e6ad6cbf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: a lot of this code is duplicated in xtask/codegen/src/generate_bindings.rs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_wasm/build.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"03bcdbb8e490a244d647b4a9ce847b57d08e8fe27b5d5e4ee325a57881fab98e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Should we ignore the first ascii control chars which are nearly never seen instead of returning Err? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_unicode_table/src/bytes.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"e23dadc6480fbb0edb519c9d5b6f8fc4461aedd4f35c494d66f98536adfb6d19"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK for const fn: math on primitives only \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_text_size/src/range.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3520b30e09b8745e9e162c02e01e95e075fc5d976fbb8de38f8ac2450100f7a"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK for const fn: math on primitives only \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_text_size/src/range.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd4dcf453992bfee73a8fbe6ebe58771d149c038401ad8327c956a6457f62e63"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: equality compares text chunk-wise and cannot short-circuit on \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_tailwind_logic/src/use_tailwind_sorted_classes/sort_v4.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7bce57926035c4a0a0dfa307d6edf1b018459e8ce429fb088d5463c4fa98c30"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: The grammar splits a dashed bare value on every \u0060-\u0060, so \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_tailwind_logic/src/use_tailwind_sorted_classes/sort_v4_variants.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"40421b9cdb6b352897bde3cda35c76c410d634a1bfc211113946fa42cca5d007"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Once trait-alias are stabilized it would be enough to \u0060use\u0060 this trait instead of individual 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/biome_string_case/src/lib.rs"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e7db3a7cf6e9e4ea38864b381e07f4bca969985b37e5120007e917719cfbc8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This really needs proper diagnostics \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_service/src/diagnostics.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dec32866c323f36fe536adaaee0a87cdce501de93661efb11078890f5af7c03"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove once HTML full support is stable \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/settings.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3620a5d468418746680e5c5b84ec0c59c3f2d6352518a51986ef42d54669d5e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove once embedded snippets support is stable \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/settings.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf736281201caa04cc828e30ae4cec0b952746234944a70332c9ea82ffc22fdb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove once pnpm workspace catalogs support is stable \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/settings.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc771ab0a4836c675131a0f5a2d6a665e087bf03638cda4a849713a81f2e436"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO handle 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/biome_service/src/settings.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6bcdbb668fa34724e0757789ffe0df55fc35bdc9fee71eb960713fa7fce4b5b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Find a way to cache this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/settings.rs"},"region":{"startLine":2466}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee956d501b8a79a801499f0c0722069d7921b0a46d815824f2c3e8ed768c53af"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove once html full support is stable \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/workspace.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a47aa8ef261428ebb585e094c3735cf1cb66dafdec2309ac0a2fa68ddd31062"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove once full HTML support is stable \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/workspace.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfcc9e01023ef95e0f0ce323497c3f4910592f903a126a24fe111ff0af703b21"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: This method should not be used in combination with \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/workspace.rs"},"region":{"startLine":1657}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd2929bdbec4314b5230c1a31287b68babdca89164811bd6c8735d9d4278273b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Support \u0060required\u0060 keys here when 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/biome_service/src/workspace_types.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"854856b688fedbb1db20665ca152a8079945341cc811e59df7e0a278eba19be6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: The current implementation of the JSON-RPC protocol in \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/workspace/client.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"7181f093824a7f51f10c98508c0ff215afdc22433c6bb681b36dceb65e55ccd2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove this once legacy HTML-ish support is removed \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/workspace/server.rs"},"region":{"startLine":4020}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54570802ed10be1e743ed6bbf6d889ee71cab3d525fe026439ad9496347ed87"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove this once legacy HTML-ish support is removed \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/handlers/analysis.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ffcf27e91ac2efcf302a000510116a97b483c02f79cd1098e8eee3c97df1e7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: handle diagnostics 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/biome_service/src/workspace/server.rs"},"region":{"startLine":4468}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8a960e461e6074ae780f51e79f36ae6d02efc73a776c63bb8ceb5ca78ef378"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: review here, it feels wrong that we can\u0027t pass the inline config \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_service/src/workspace/server.rs"},"region":{"startLine":4643}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5dea11c54462a1cfa59c53b5d50ef8c9adbf803292595662e6cd182b23918e7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Improve error propagation. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_service/src/scanner/watcher.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"052b764971b142f4fc2575acc55e6f0effb541391c57ac5b893410586db80af3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Improve error propagation. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_service/src/scanner/watcher.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c7d8a579ce38d950c418cb08f8816696021ca07d959feb24482465e43f92cc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Improve error propagation. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_service/src/scanner/watcher.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf6741828d813ec964359703371c36aa1a827f8cec9579e85ac1e1a1624e800a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Improve error propagation. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_service/src/scanner/watcher.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"57ded5fe5236a751744213101f52c6ed2d26e9dd9f1dea6fc8c5d33c3ad76126"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Improve error propagation. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_service/src/scanner/watcher.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"4726320a1bb88cbc2ed31edf8ddada0210ff51882779275092394222086d6876"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Improve error propagation. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_service/src/scanner/watcher.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a578c8e9b3e8018f55c65452e277d0c38f066e715eb330bedc8133d20bb62c7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Improve error propagation. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_service/src/scanner/watcher.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"492cbc1deb3abfc77def46eea43fc5542b5f117421ac8d990e6255b43afbfa09"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Improve error propagation. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_service/src/scanner/watcher.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25730d8d07f19de58369efba7df64f6805e5dab352fab0ac8cadb26e3f5e49e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: improve error propagation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_service/src/scanner/watcher.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"afaafa4f517faac6dd86f937e773e058892adf714280907416b1ed18b8f03072"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We should be able to search JS portions already \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_service/src/file_handlers/astro.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"142b28aebd160ae2c0dcaeb6d97b8ba6cd4b206840d108759128b9fcaae35107"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We should be able to search JS portions already \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_service/src/file_handlers/svelte.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e699c92cfcb0771a24ba6cb12e3d59cead14906f05e39f2f181c79274bac678"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We should be able to search JS portions already \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_service/src/file_handlers/vue.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"406d3c6ded262ff669597ebb12fe179fe1dad992b2b0c8e40cc3103816a2839a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Option to disable indent 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/biome_service/src/file_handlers/javascript.rs"},"region":{"startLine":1956}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4518fded13ab7d453f29a43c29d89d07bddb3968c3f43d87e658591596084ab"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove match once we remove vue/astro/svelte handlers \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_service/src/file_handlers/mod.rs"},"region":{"startLine":1381}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe140815f38ab870c0f15faaee3a7bea15cac5af93e141e8f7c285ad33d9d9c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this function works only with lint rules, but it should work with assist actions too \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_service/src/file_handlers/mod.rs"},"region":{"startLine":1481}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c12c3e70894bd922b64f9ade299a778632c36d1134f3ae902a36fb07e76178f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We should change the parser when HTMLish languages are supported. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/mod.rs"},"region":{"startLine":1537}}}],"partialFingerprints":{"codehealthFindingId/v1":"7704b37f6b3a63a7038c4607a8417b07fb15cf3712ae974e038c27b66db283a6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Angular support \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/html/parse_embedded_nodes.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"c913bda25cedec4794b5a8a7f1d77663c60ab4855b937472272352087a4dfd35"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Angular support \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/html/parse_embedded_nodes.rs"},"region":{"startLine":1163}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5ef04566b6c09b16571a51965688f4519c89604240db6bc8af3d4c9704a6e9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Angular support \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/html/parse_embedded_nodes.rs"},"region":{"startLine":1346}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e482f9df40cdaf9f87cce7f8ffb02f2f66a789fd85c4419fe465403159c6ef9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Angular support \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_embeds/src/visitor.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"8278ec1c20be8de87546f309de28581879338e73cb9d34601558e99c85ace240"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We have to parse the context of the import() call to determine \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_rule_options/src/no_restricted_imports.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4f5d8c40a640f5f559ab06f88da48bb8b2247ddf8bceee88dffb7148620111e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: inner_string_text removes quotes but does not e.g. decode escape sequences. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_rule_options/src/no_restricted_imports.rs"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b36f899ef1b9eae052ce38e39f22814587e069e2aab2ad93df6bcf90353c0cf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove in Biome 2.0 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_rule_options/src/use_hook_at_top_level.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ce0d3173d4ffdf47193be2b1a01179ffba0d5df24c4b8f3c6c345273ab5bc28"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(bholley): Use the updated comment when [2] is merged. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_rowan/src/arc.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e027b68fb2b900868fe50662946ab162d36231a6eb323dad7487da2baf7b4e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This should return \u0026mut Self for consistency with \u0060token\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_rowan/src/tree_builder.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"882016b5f47bb40dcec2d88cc2b611b805960469aba9acb8b9c8b9a3a3cb61f5"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: this handles empty ranges \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_rowan/src/green/node.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f70c60fa480b688b2446f21ce0f3a45e5ce58224268ca80aa1aac3861d16461"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: fix up aggregate data after construction, because we can\u0027t \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_rowan/src/green/node.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f25a105301db423a3a5b35cafa7986ed1d6af8d8899656e9983a05618ee67f8"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: the impl is a bit tricky. As usual when writing interners, we want to \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_rowan/src/green/node_cache.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6df1c8e7c95cbe5ab380afd1f9de926609ca245541c8ca0416c3ad4953e03ac"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is an incomplete approximation of how resolving inside \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_resolver/src/lib.rs"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e353891f80338d9d02a140e976c085d63e95754031a1f5dcb467659fa0c7cb6"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hack for parsing completed markers which have been preceded \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_parser/src/marker.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"63118f3643235bf4058f8b903b4ee045886c14e30a558f70b0072a761efa63fd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add a \u0060recover_until\u0060 which recovers until the parser reached a token inside of the recovery set \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_parser/src/parse_recovery.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b9fa769b1eb6e23b1398268fcdab5b12b4fc7562da6ab8fd93666095376b38"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: Interpret \u0060~\u003E\u0060 as \u0060~\u0060 \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_package/src/node_semver/range.rs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd53d88b988333b357eeef5b27cf86ae574706722d0854a09c4d5dfeb3cb278"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: The following test cases were supported by node_semver, but are \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_package/src/node_semver/range.tests.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"477debac0a56072ecb229806dd0e1c0bb1708ea7fdbf93bdf17cbd8ef5d39a46"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: add proper parsing of license, e.g. support for AND keywords \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_package/src/node_js_package/package_json.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ca05976b7e7eff59cc2a436e691d3e145ee63cdbd18de2912c0086ef77b156"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: address this later \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_module_graph/src/format_module_graph.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b726b7830f0b156361be6b10d2c9f999379bd273dfbcfb406b81c5af465207a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: support defer or source imports \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_module_graph/src/js_module_info/visitor.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"03dd871e997e87b8afd9a472d753c7c0582d18fe98d2dd96a91a2c78cabcaba0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: support defer or source imports \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_module_graph/src/js_module_info/visitor.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"e11b96138441087c86a8139f58ad0e26a0cf2267097ca3dec1e83b508961754e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We may need to implement this if we want to fully \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_module_graph/src/js_module_info/visitor.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dcb094dff87a65d3431307828b3b36a8c4a723a23171386ab14dc5cdfb3f789"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove the \u0060useNamingConvention\u0060 exception, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_migrate/src/analyzers/rule_mover.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"3593ef9fd6c7a4e87f39dd68daa5fb5908384214b6b5f68289b06be02c1219cc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove this once we remove the skipped trivia from the hash \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_markdown_formatter/src/markdown/auxiliary/header.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dabc517aaebe24fea4469dcb2547510214f41448129c3cfd18a8ada66973fd9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: try removing and re-adding closing paren \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_lsp/src/server_type_on_format.tests.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"afa44db4203a767e886de135182bd834e281397d9c46c9667c9a3346e649412b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: try removing and re-adding closing paren \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_formatter/src/lib.rs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"39814f30050d6398508add9e9d175c6ed65646b81176cb8a80e0a9eda79b2df8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: compute skip and only based on configuration \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_lsp/src/handlers/analysis.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c3d0cd337f593649acad25a4f51e6dba9f797b8e800deffdc66af0cf0ee0c8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: handle this error in a better way \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/handlers/analysis.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"13db24ed455f5a813d111a3463350abb7df1bd60e4f62bd7878c5f2853132f43"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: to be implemented \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_languages/src/graphql.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"044259a4d758e2e038a6b6acd8f54e68fe325c10d352f1f2fcb83d544667bb84"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: to be implemented \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_languages/src/grit.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3ef854dc8da421ad411bdae65728cee6140ac01220d609ed6a925823d3b91b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove once we have full support of astro files \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_languages/src/javascript.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"806d145be7fed91db38d9c0798368fc0e2744a3b3c56f306da7046d7f72c6628"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove once we have full support of astro files \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_languages/src/javascript.rs"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"a88bf2214e54f284c6edcc00a75335af865a71fe86cec6792ef8b5f1537eb80a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove once we have full support of vue files \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_languages/src/javascript.rs"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"130c3ae22b44ce87ddbde19819f874df8c68f9be25757e7bc207caa5029ef9cf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove once we have full support of vue files \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_languages/src/javascript.rs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b2562d64cdbd01ec39fed328c471eeb6e55b63c2e54ae5403ed85c1226848d8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove once we have full support of svelte files \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_languages/src/javascript.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"963afdff42f18c44a54b434b4df53957947d0f0893d8936d4579bf40ae09d6c7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove once we have full support of svelte files \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_languages/src/javascript.rs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a35b384a9f681a808ddb79160edac98a0e9fcb8618d7f3a4ed6b0d6e526c203"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This should be considered as an ad hoc fix. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_languages/src/javascript.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df2cae908b968af0bf0e0421d171d9227f6283feedf4d6005b2a1b5a418ae45"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This should be extracted to a dedicated function, maybe in biome_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/biome_languages/src/javascript.rs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6d3514248361753cd88c0d564b1582617a90dd1e073524232a5def7983c956"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This should be extracted to a dedicated function, maybe in biome_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/biome_languages/src/lib.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e95686986de1df921bbf91cacd4be52298fe1c109c720e3de0452ca60679801"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: property implement. Look for the JsSuppressionAction for an example \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_json_analyze/src/suppression_action.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd7bd4ab511c4a75434119329761d572b922b03ab61d01a1f2a19a8144b2bff"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Support dynamic destructuring fields \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_type_info/src/local_inference.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"83edb45ac2b47666e2794965829f9f404c0380814877686e3d8785d53cea2516"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Handle enum declarations. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_type_info/src/local_inference.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"64184b4b6eafec974a4a99c1d1659a699b19e9df896562900464f70cf4945267"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Handle global declarations. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_type_info/src/local_inference.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d475f05f618dab205bb1630cc0d3190aeb4968ef97c90417b6344ffcf2ad4fd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Handle \u0060import T = Name\u0060 syntax. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_type_info/src/local_inference.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc469abf20c3ebfa811d14e6314102629f436b26bcc72b61fc6d0e65fc9d7f62"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Handle interface declarations. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_type_info/src/local_inference.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6db2ad25dfa5efc255890f967d40f2f0f1b2dc80022143df27d397415085a19"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Much \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_type_info/src/local_inference.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf308782f85e8812f023d958c54bff876ed8c442fe3bca153601f100cebe1f03"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Handle import types (\u0060import(\u0022./module\u0022).T\u0060). \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/local_inference.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"54eeba2a8377df2368e3ba959c68e279bd614a6dce7673a8345c01596c9f9bc5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Handle more variants \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_type_info/src/local_inference.rs"},"region":{"startLine":2410}}}],"partialFingerprints":{"codehealthFindingId/v1":"098091794089442bbf3da48d5f8ec8c3c405574af5389ba5fa1252bf44057a3d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Handle setters \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_type_info/src/local_inference.rs"},"region":{"startLine":2523}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35450553216df33fc84ffcaecb6bf68bec188f18747f90e24aed2c576116c30"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Handle setters \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_type_info/src/local_inference.rs"},"region":{"startLine":2660}}}],"partialFingerprints":{"codehealthFindingId/v1":"a380dcf41ffb51e25da1995c73579800751720391a531c3b020acd1fe5706ac1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Handle spread operator \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_type_info/src/local_inference.rs"},"region":{"startLine":2539}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c0e5ac60ca4b186f57723610c32e95d38767b9e955cc54b1733b213dcc904e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Assign accessibility to type members. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_type_info/src/local_inference.rs"},"region":{"startLine":2761}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e810467f01417a0f5561ad882c738c32f88ba46d4a10a1d7b2805cbc47b1e8b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Custom impl of PartialEq for template literals \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_type_info/src/type_data.rs"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad0adaeb7e9de3b0a2c6024bd5c1fcf7cb07f3359f6e5348073082a176277b7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Include setters. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_type_info/src/type_data.rs"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"5439a049dd2c9c9ba94b7461cdf4c8494b756a6af591b4f656a3897fb6e2e659"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: parse escape sequences \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_type_info/src/type_data/literal.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"0177a3b218ac54d1278acfa725c89e2faf5a215c55260fd47bc4d582e2dcc8b7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This is bigger than u64 and can\u0027t parse it via u64::from_str_radix. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_type_info/src/type_data/literal.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b409615130a52d584ba32455940428bd5228d480f9ecdcd9415fef0b212dd7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: move this method into AnyJsBindingPattern and then remove it from everywhere else \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_syntax/src/parameter_ext.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"62727bcdd3fe125825d5ab3c10380a78c4f8c49afea636b1714e4a6083e02947"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //(\u0022\\\\0\\\\07\\\\77\u0022, \u0022\\0\\u{07}\\u{3F}\u0022), TODO: legacy octals \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_syntax/src/unescape.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef2d9834be67c226a1d8bcb501a45c9ea65015ff13ef0eaffe518606bb9d323"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(semantic-invalid-namespace-type-ref): Split semantic events for \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_semantic/src/events.rs"},"region":{"startLine":1318}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc614d5ce218407a533713f787e6dce3b48bb6a909ed19b5507622f040b9600"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO change node to store the range \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_semantic/src/semantic_model/closure.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e8e001db283c91f0bdf926a1b06391201fba8ea26b7c0eac84f0cf2e2331c0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(semantic-invalid-namespace-type-ref): This currently tracks a read to keep \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_semantic/src/semantic_model/tests.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a8fe845d6ce4779bd0b0085a5522be548b9531f13c7b90147efdf65c0bfa6dc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: recover from \u0060try catch\u0060 and \u0060try finally\u0060. The issue is block_items \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_parser/src/syntax/stmt.rs"},"region":{"startLine":2060}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e8544fc9a8320040d568532867cf064dfb67285463d1d5af5e57eda8177486"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should use ID_Continue, not XID_Continue \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_parser/src/lexer/mod.rs"},"region":{"startLine":1088}}}],"partialFingerprints":{"codehealthFindingId/v1":"92f2294acec950cec5e58941b94785d20a82eb50fd0889a50a1d968be11018d1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: merge this, and read_float\u0027s implementation into one so we dont duplicate exponent code \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_parser/src/lexer/mod.rs"},"region":{"startLine":1421}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa67136c271398d266fe840ed97d36a35abdfd90ff21b67205e2cd58437b257"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO this is a very very very very long comment that makes it go \u003E 80 columns \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_formatter/tests/specs/prettier/typescript/comments-2/last-arg.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"a544e435317eab6d50aa8f82fa4869d6358eb5704363e47dbaf431a552f62190"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO this is a very very very very long comment that makes it go \u003E 80 columns \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_formatter/tests/specs/prettier/typescript/comments-2/last-arg.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"249fe134631047e350f21b51c0ff5880f1244fb560948e3f5a8cbdedcc1483f8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO this is a very very very very long comment that makes it go \u003E 80 columns \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_formatter/tests/specs/prettier/typescript/comments-2/last-arg.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"c39fc3e70ec0989ee7eeffe1ee51c4b5eae39f083d384b379b96db3d514be6fb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO this is a very very very very long comment that makes it go \u003E 80 columns \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_formatter/tests/specs/prettier/typescript/comments-2/last-arg.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"901aa12275b2dec5bdc55be61332ae59b5f493508c458f493b9bf8ce84d357d0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO this is a very very very very long comment that makes it go \u003E 80 columns \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_formatter/tests/specs/prettier/typescript/comments-2/last-arg.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"99696a871509d3862fcbf4e1eec82e8bc6d4c8cf822d865bd6f3b590a701b8c2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO this is a very very very very long comment that makes it go \u003E 80 columns \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_formatter/tests/specs/prettier/typescript/comments/declare_function.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"db6c71b1a7b40596f897a0e5ddb99e6a485de9ddaed928bedce1398ce1109830"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO this is a very very very very long comment that makes it go \u003E 80 columns \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_formatter/tests/specs/prettier/typescript/comments/interface.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b59fdf3deb5b8c814cf78bc2928ff768c2882847f0c98aa17ab24ae1ec5dbc4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO this is a very very very very long comment that makes it go \u003E 80 columns \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_formatter/tests/specs/prettier/typescript/comments/interface.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f8f4c7b22b5f77a038bed83ba4dac7a0be3a2c9ef22865b27432bd39c47f78"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO this is a very very very very long comment that makes it go \u003E 80 columns \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_formatter/tests/specs/prettier/typescript/comments/interface.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"777181ec9aad89d0a10a7e16ef2a7dae63dd2984cb6785dc7257507d64a1b57d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO this is a very very very very long comment that makes it go \u003E 80 columns \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_formatter/tests/specs/prettier/typescript/comments/interface.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"76855d4a0916bfc9c3815fcfb3eca51ccb3f30789c2597f447364dee1a5b2fcb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO this is a very very very very long comment that makes it go \u003E 80 columns \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_formatter/tests/specs/prettier/typescript/comments/interface.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"0679237c5854a964e6fed36a1db86c43be3ae5c8ad4524e2fc34287c59a1d59e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: ((a?.b!).c)   (); \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_formatter/tests/specs/prettier/typescript/chain-expression/call-expression.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"445c720a339b145065113367ebcda6e4839a94a4f26cd75ec38541a27ba1534e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: ((a?.b!).c)   (); \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_formatter/tests/specs/prettier/typescript/chain-expression/call-expression.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"7223431ec50db2093cb88f15e360fb0bf1a4f1c4d3f89881b411b08ab70f16e7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: ((a?.b)!.c)   (); \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_formatter/tests/specs/prettier/typescript/chain-expression/call-expression.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"4083f91848e1d4fe5b37c84f00ead3f3c60aa418107aed47f4ad5046554b3432"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: new   (a?.b)!   (); \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_formatter/tests/specs/prettier/typescript/chain-expression/new-expression.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2ad24f68ed3697d32b67cd7fbaaa734de40f471204a4147f9c511b5317ec037"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: new   (a?.b!)   (); \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_formatter/tests/specs/prettier/typescript/chain-expression/new-expression.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e789c7e8b5917818108282a6edb4de33d7e768fa9e3a5b637b8a3e4466bbf15"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: new   (a.b?.c)!   (); \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_formatter/tests/specs/prettier/typescript/chain-expression/new-expression.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"32d39358e0cf72205073c5929fcd6667020bdb11f896b74ea331a9d1d5ab7bf3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: new   (a.b?.c!)   (); \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_formatter/tests/specs/prettier/typescript/chain-expression/new-expression.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef58b10e51c3b0a61a7c4678a3cf9e5eb0428c13156904fa939ee173e5539a54"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: new   (a?.b.c)!   (); \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_formatter/tests/specs/prettier/typescript/chain-expression/new-expression.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e0677a87dde73894b6ea42da109d9a5662e15e2c33d1a77d629eb204d1bfdbb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: new   (a?.b.c!)   (); \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_formatter/tests/specs/prettier/typescript/chain-expression/new-expression.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"ece026e7074e453eeb193ccb3f09bafae52392a0426b8338488a04c2e39f3bf0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: new   ((a?.()).b)!   (); \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_formatter/tests/specs/prettier/typescript/chain-expression/new-expression.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf6690ce42c2fe8f8b29a1df888673f60c5abaa3f85387e2992b4306c033f0e3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: new   ((a?.()).b!)   (); \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_formatter/tests/specs/prettier/typescript/chain-expression/new-expression.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fced330c26f74abe6a52c32729851cea0e079b908d69b668b225716046e7be3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: new   ((a?.())!.b)   (); \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_formatter/tests/specs/prettier/typescript/chain-expression/new-expression.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"3947ba177012b31d80cea9498032bc05859a36a11e602cdb2f71f13b36c310f8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: new   ((a?.()!).b)   (); \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_formatter/tests/specs/prettier/typescript/chain-expression/new-expression.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"12546b0247560848c6c4f174105edb20cd2b8d74bdbbebd435d48a41f3cc47eb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: new   ((a!?.()).b)   (); \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_formatter/tests/specs/prettier/typescript/chain-expression/new-expression.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"e232599713f5ebd0c9eea8e5a4dab354c4a0eaa50e83c96dc7cecd1cb4649363"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: new   (a?.())!   (); \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/tests/specs/prettier/typescript/chain-expression/new-expression.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"2729b5e1daf59c91a5109931ae9ab53b3ec26980740d109fe2a9de65c4a20914"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: new   (a?.()!)   (); \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/tests/specs/prettier/typescript/chain-expression/new-expression.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"213175017eb97c2f79563d2d71bac577d5c165629db4052b991d849799c3223b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: new   (a.b.c?.())!   (); \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_formatter/tests/specs/prettier/typescript/chain-expression/new-expression.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d5f48c4aa1146a6c904b6ea74132216222bad115009b3a881d0a4cd3a55ee3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: new   (a.b.c?.()!)   (); \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_formatter/tests/specs/prettier/typescript/chain-expression/new-expression.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d89aebbb7af4c9c29f384231952467800fb1275847ddd7fdb21ff5f25b4890"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: new   (a.b?.c())!   (); \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_formatter/tests/specs/prettier/typescript/chain-expression/new-expression.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"50273aaa1269a5802a1d95b5c1c03a1e5c2e0300057e96bd48345d4e9d1b092c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: new   (a.b?.c()!)   (); \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_formatter/tests/specs/prettier/typescript/chain-expression/new-expression.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9bcfb5388996ec0ccc395ae7f4d0a2e75c2a7b9d8c87e84c437e4201877584"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: new   (a?.b.c())!   (); \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_formatter/tests/specs/prettier/typescript/chain-expression/new-expression.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e62c9d644cd23189beeb9d35cc440a4afac4e442ddae28848ee37e8946bd8dc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: new   (a?.b.c()!)   (); \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_formatter/tests/specs/prettier/typescript/chain-expression/new-expression.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c27376efd8a3f88a280346359f6245a1038c1b48a1fb91154ed4ce8525e4bd6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: replace this error with a diagnostic \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_formatter/src/context.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b9281d40735e542cfb644c96b2a930f4b3d29c6c1227c49ff0adc8a6c8db83"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: replace this error with a diagnostic \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_formatter/src/context/trailing_commas.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba8cf0fb235c4ffe57b2ab719928aff35e08327698b3f9a3ee45b3d4779210b2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: replace this error with a diagnostic \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_formatter/src/lib.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c2da84ea81ce8f3fe8e84fc24e1f77c65c62efe85f9c48717305be1274948e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: replace this error with a diagnostic \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_formatter/src/lib.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"754db737956f1ec2b0ad759426ceba534563e96f09dc327a370554a53163dabb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: replace this error with a diagnostic \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_formatter/src/lib.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef0331830a28924ecc1cea8a79f43ad51526fed390fbcaf34b2ac901faf5d757"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This should be handled with a \u0060NeedsParentheses\u0060 impl. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_formatter/src/syntax_rewriter.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"170ec68c07a8495866436e709f32b01be8615fb49be2da2e0dc1b4b901dcbf17"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: add here will_break logic \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_formatter/src/utils/assignment_like.rs"},"region":{"startLine":1361}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7addfa1f337fe78fd4035e1c5883834f03d0e5c7900dbd642c7196772eb513"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: I wish we could do this more generically, but we cannot do this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/tests/spec_tests.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"259812594e332bcba9d2b2f839156e46eec0a44e33079ef1e8fac8522144ddd9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Decide on whether to allow or deny this example (TSEslint passes, though of dubious merit) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_analyze/tests/specs/style/useUnifiedTypeSignatures/invalidJsdoc.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b6fcd6c1c517b52fa253eccfd9d20f3f536454287fb535a5f0ac70ef8a06e8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should not generate a diagnostic \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_analyze/tests/specs/style/useShorthandFunctionType/valid.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"de8708e93e739cf6b03e0027d3cd08acc36c4f2caae30fd7812cd6adde93804b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should not generate a diagnostic \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_analyze/tests/specs/style/useShorthandFunctionType/valid.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0de2ca8b9b21932d19c7cfa60938a5342f8d437949ccafb15d1c2652e75ef4e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should not generate a diagnostic \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_analyze/tests/specs/style/useImportType/valid-unused-react-combined.tsx"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c594aadd18bb45b506fe4126bbc0098e87b0dcaea18aca7ab69a85a3264fd1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should not generate a diagnostic \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_analyze/tests/specs/complexity/useOptionalChain/validCases.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb23aefa8e4160327c13b6596fe150db307b2bb30dda50502f99af5bd188f76"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should not generate a diagnostic \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_analyze/tests/specs/complexity/useOptionalChain/yoda_expressions_validCases.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"926bae6c45c75a50ff15cb95a46d50af3bf0a9b4e690899299aae10ae7816444"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Should we nudge? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_analyze/tests/specs/complexity/noExcessiveCognitiveComplexity/complexEventHandler.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f4880ae0600309c82042d9bface4ec9d647b88c14a23776b3ae840f2b4ebfb"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: Jest/Vitest have some functions that start with \u0060use\u0060 and are not hooks \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/react/hooks.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b8431b474f07822ab4c80ea0185d97dfb3276aadb48365c87c6b1ddd71e3d2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Handle short-circuiting assignment operators \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_analyze/src/lint/suspicious/no_constant_binary_expressions.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bfd07b5c4b2b6f24193c286a893fdd109b1a9168af7bc18675dbe8d9d39cb73"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Handle short-circuiting assignment operators \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_analyze/src/lint/suspicious/no_constant_binary_expressions.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5031946d1ab59cb1d26a921bfba55a30abefff6df916a77d457d33b3948e72"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: require() and import() calls should also be handled here, but tracking the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/no_deprecated_imports.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c1f24462c231deb37f6a3cd67b9e4b4cb95d3ff4d043da97e590dbd54dbdae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: require() and import() calls should also be handled here, but tracking the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/no_private_imports.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"f83a18c4010a39fc07397714e3cca7c07f0ec6ec4f0544c9e060f9eb93cb95ee"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: require() and import() calls should also be handled here, but tracking the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/no_unresolved_imports.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a896fa57edc00c9c2b8203e6032f4f2bb995fa1b67043fe5fd5d17437272cbf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement SyntaxResult helpers to make this cleaner \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/no_double_equals.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a31b1892c47022945fc87fadfcfb50e41e4af9fb2e8d9550069ad6535b92b1"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // \u0022\\u{XXX}\u0022 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/no_misleading_character_class.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"652512552013f5512f858335d53fa207fa2c9932d34a96fd03f1264c7e993fa4"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // /\\u{XXX}/ and \u0022\\\\u{XXX}\u0022 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/no_misleading_character_class.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca7e5113f1fbf53bea45c9023f8de18cf4a75274a436e903f2094dcba8f8f429"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Automatically adding the symbol to the import would be nice \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_analyze/src/lint/suspicious/no_react_forward_ref.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5bfb553a314598951bb8b70cbbc1764cd7865de78e5519317593af0a43b5246"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO. This could be improved with type inference, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_analyze/src/lint/suspicious/use_number_to_fixed_digits_argument.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f528adafb89751f5b79b61639e36738bad0765011148036fa50779ec86a1d31"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: uncomment once we allow multiple rules to have the same source. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_analyze/src/lint/style/use_consistent_builtin_instantiation.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"24400edb19a2e5f5788f3025ebb1476963a1277e97f2eb1427acbbd5cea109e0"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: removes the trailing whitespace from the expression \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_consistent_curly_braces.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"11040743e0ed7f8953b8ce667aa81af1513080bf7845a9eab57c1cef9eaed630"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Highlight lines 2-3 and 4-6 of the codeblock if/when the doctest parser learns to ignore such patterns \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_analyze/src/lint/style/use_consistent_method_signatures.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde4101f808ab72e4197e5d56fbad09becdf6f60e05a638bc634f24725bdb0a5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO. Handle cases when \u0060length\u0060 property is not numeric \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_explicit_length_check.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3caaedf45ca75b5ba7e2bcd23b4d22cda6bfb110ba78e0353803f149b6eac3d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Should we drop duplicate JSDocs from the output? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_analyze/src/lint/style/use_unified_type_signatures.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf02958454fd227dc61a190f1376a0cde0601a94814a2667cfa2838f50382ce"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Should we consider functions without JSDocs as mergeable with documented 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/biome_js_analyze/src/lint/style/use_unified_type_signatures.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"67ab9e57792de6b9d60b629ec723d95a1d007a0ddfa63e0f915120ec806d26be"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Should try_merge be made to return a tuple itself? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_analyze/src/lint/style/use_unified_type_signatures.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"e35ecee04080709c4a947befb3196b3b13b3f18c79393fc918a92558b451e1d0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Consolidate this with the \u0060IsNameEqual\u0060 trait from \u0060use_grouped_accessor_pair.rs\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/style/use_unified_type_signatures.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71f23831e3f517d3da05a2161bb24ff05211ce2915b307a44fa2169bea8f2dc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Try to get this to work in JavaScript comments 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/biome_js_analyze/src/lint/security/no_secrets.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6af0d5d1f4d79ec59e08e12161ad1a58baaf069877b615d2a234172cdb6e3b9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This needs some work \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/performance/no_jsx_props_bind.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"84b500ca68250deb93545f44313870879a8383830062dd6b70158f001e303a00"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This will still throw a false positive on e.g. window.bind() \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_analyze/src/lint/performance/no_jsx_props_bind.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c678bef9d188de004b5a0ddddb9cec640e5f8da153320863d6ddffb56ed6e2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: why only arrow functions are ignored inside typed return? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_explicit_type.rs"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed03bb47f9aabb61c7adebbfe0a6698af2c735e527478e32cc3b90a8e8cd6cd9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we should also check that an \u0060.\u0060 exports exists. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/no_undeclared_dependencies.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c7ba12460d29baae382d081b764d7d91bbfabedcf6936bf0a60dbf028f1352"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Update this if/when the rule gets split up or has individual disabling options added \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_js_analyze/src/lint/complexity/no_banned_types.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"d894ae2835e54d6337f98532b6768284872e9e98101a562f4a896f7fbd25c20c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Lint empty template expressions like \u0060${value}\u0060; while ESLint doesn\u0027t do this by default, it still falls under the bucket of \u0022useless string coercion\u0022 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/complexity/no_implicit_coercions.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"038ee23e744e0b1348d798f2d7ba09f362572015b0f00ee95f0170f33cfc4e56"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Should \u0060NeedsParentheses\u0060 be moved in \u0060biome_js_syntax\u0060? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/complexity/use_arrow_function.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"f42f8bca2fb58f99ff7a829e3aef138d094e768207fd40d84b9cd57d2e350eb8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO. Find a way to avoid this. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/complexity/use_date_now.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c85cefd8bd69fb943a71ed32e4e807b23f786ecfbe6f3908e5d5fe4dcc97581"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove once Angular has been added to file source detection \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_html_parser/tests/spec_test.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f7958d2c6371dd6d2c98ba025a04203a4f9618ef4f0c1075676cb558e6efcac"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Uncomment when the parser supports unquoted attribute values. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_parser/tests/spec_tests.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"09c1dc15111d90b7c97594fcb81825c0a791f21b241f9c0eb42652823a9f64cb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Ideally, the lexer would just lex IDENT directly \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_html_parser/src/syntax/vue.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e71a3d892fe370821e899d62bd1264e44698e3c6f01bafb68930ac776200a7c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: probably it requires an update because it\u0027s tight to svelte grammar \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_html_formatter/src/separated.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"1434375a5e82a12a03808ab0afda148cad034da60288e33d173d307aea175c9a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: might be able to make this a debug assertion instead \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_formatter/src/utils/children.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0fdc73822a11bbe2d01c2d07d2530c1ef86a7e60aef899f1b1b1579aab5704c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: might be able to make this a debug assertion instead \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_formatter/src/utils/children.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab56b030aa2767a80b2bfc1c71180ba6d6004ea29a3aca5e126a7225e4b3983c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Prettier treats \u0060display: none\u0060 as whitespace sensitive. So technically, this should not be included 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/biome_html_formatter/src/utils/css_display.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"08427d60c9f7a7c8606b60f2cd186f20dd3ad02dc3827d0b31d65eb09f9fad1b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: deduplicate with CSS formatter\u0027s version of this, move to \u0060biome_formatter\u0060. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_formatter/src/utils/formatters.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8fc311aad15c36c31bc8670982111122bd8e1ef2c36359182789af7949ba1db"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Ideally, this would be codegened from the actual HTML spec. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_formatter/src/utils/metadata.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4297604bcdf125d6478dbbd7546fbbc6d6219360b9052b7b9d5d87267a8fd38"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: These tokens (the \u0060/\u003E\u0060) are not yet borrowed by sibling elements for whitespace sensitivity. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_html_formatter/src/html/auxiliary/self_closing_element.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee3caab0f96a914e02ec112d6bd54a4fb5fc4fd761da9b62468b5ff21211a0f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement sorting \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_grit_patterns/tests/specs/ts/arrayType.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5a984b5de3d6be02d3abe4b2ce25af63564757cd2526075585df6ae2e12c8f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement suppression \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_grit_patterns/src/grit_binding.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee0602e666727361173199573c545b45ec3d2b26e41dccba7ed7cbbe5d305348"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement insertion padding \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_grit_patterns/src/grit_binding.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"375438c2d4989e0b27f42468b57a05d0adf8658b9f944cf324cc5ee8030b2475"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Improve performance. Equivalence checks happen often so we want them to \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_patterns/src/grit_binding.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"72a45318ebbfd05b74213dc6be53256360d3cef754dda4c6a3ae645a0744bf36"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo add support for other types of bindings \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_grit_patterns/src/grit_built_in_functions.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e24df99d1fe1c480c6b8918dfd09202dc798e74de14babf608d5df8bc23109f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo, for multifile we need to split up the matches by file. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_patterns/src/grit_context.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"d24e71b80d7ef05cd0e3ca211e1cccb6f56128fc87aef924bb277ffa84979132"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Verify the workspace\u0027s maximum file size. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_patterns/src/grit_context.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2f3a3d45916d1e83265adde9591782c6c25e1cfaf7aa728850e7cc6c9c7cbd1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We may want to preserve other diagnostics too. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_grit_patterns/src/lib.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e45b5054be368ab6889a05681e6805cc99b7169c525de9187a9b50b91231a5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: The grammar says literals are supported here, but the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_grit_patterns/src/pattern_compiler/match_compiler.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"267ebea2101ba558d1383c2c7232483ace626d6afe082768426244e3ac637d45"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: See [super::JsTargetLanguage::name_for_kind()]. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_grit_patterns/src/grit_target_language/css_target_language.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee9912d0d0cf9ff722677aaf60a395a931bf4a787fe271fc837db5f7d05687a1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO implement range formatting \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_graphql_formatter/src/lib.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"367213374a2b20d7481196f57540b05aed876d5c698d72356365659f1c452640"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: handle error with diagnostic \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_fs/src/path.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d13bd8d9b4f90c02acf731834fc1cedc06639879478123ce437de5efcc478c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This code should be moved to the \u0060traverse_inputs\u0060 function in \u0060biome_cli/src/traverse.rs\u0060. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_fs/src/fs/os.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"32627616cb211d2746620d09da5106310c2d7fbefa5efcac528460f6efb64f01"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// **TODO:** This is really JS-specific logic, both in syntax and semantics. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_formatter/src/comments.rs"},"region":{"startLine":1297}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d0cd220cc54bfd62324a7b9dc05c35d5c11f1a50eca9647a45bad707e19903"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: instead of calculating lines for every match, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_diagnostics/src/display/frame.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"f083f719b4f2f75d9d9f10a5a506d7bf3dc12032420844f22f21862e3197e40f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_semantic/src/semantic_model/specificity.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f170c9da7eec90db02e6345dc45465ca0771ac1fa3027b4ccd86c71b475433d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: In the future, remove the \u0060#[expect(dead_code)]\u0060 as these get used. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_parser/src/syntax/value/dimension.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c62eada372a638913a4e8aac3729fca4237ee8ce3d3e5789a6063c9e2a54d6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This should actually be \u0060\u003Cdashed-ident\u003E | device-cmyk\u0060. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_parser/src/syntax/at_rule/color_profile.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd681afeb80772bd1f838662e5a9c9936995c7c5b78d2feda357175fb0e64f9d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Optimize to avoid allocation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_css_analyze/src/lint/suspicious/no_deprecated_media_type.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"482be3d01ec79e3d10d2c942354c5b349fe222bcd5c036a03122b3d504b236f0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove this line once markdown is stable \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_configuration/tests/spec_tests.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b03a5e956c411bcbf70e18015db9ce3c13460fa930c5c0b4ad7bf86e9687321"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove the \u0060style/useNamingConvention\u0060 exception, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_configuration/src/analyzer/mod.rs"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"62fdb33c307c5dbf6f1689da542acc06d26d903f0b5b9f0cfc30380453b95da6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: redact snapshot for custom paths in configuration \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_cli/tests/commands/format.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0966a2dec5363c24ab72c9d8c1b524d1e9087324d40e9d8893bfa8c6e3c277c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: add advice \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_cli/src/diagnostics.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"233554e07bf5d7382babbe4dd9c8f984a351e9dadef44e9524046fe21263a94e"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: /// XXX: Remove after [PR](https://github.com/tokio-rs/tracing/pull/3196) is merged."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/logging.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"3169374f2e64326f2900111f420c03cb0a4a131cc20f4d339be21660eea93fbc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: could we make \u0060Self\u0022\u0022is_non_interactive\u0060 the negation of \u0060Self\u0022\u0022is_interactive\u0060? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_aria_metadata/src/lib.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f6ca193488155c404d225c7c709da80b9933c4bb86027e00ad67a36b709b9f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060figcaption\u0060 has no corresponding roles in https://www.w3.org/TR/html-aria/"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_aria/src/roles.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a402c01445fd572ce98728a5adafb5e5867aa898105a7089471a3809ddf5f4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060dd\u0060 has no corresponding roles in https://www.w3.org/TR/html-aria/"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_aria/src/roles.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"076cd17c578e0b91ffa8460a85f6048017261c1b6989c7e1b0a6c8dd9bc6330b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060dt\u0060 has no corresponding roles in https://www.w3.org/TR/html-aria/"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_aria/src/roles.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"33fe348ee9a99d60f53855c09f0a6798a83dd0038df260fcfa8c220dfba196c1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060link\u0060 has no corresponding roles in https://www.w3.org/TR/html-aria/"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_aria/src/roles.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"23593adc67fb354aed37a172a605dd33962138c189a34c2cb81105c5efd523d4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this differs from \u0060get_implicit_role\u0060, is it intentional? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_aria/src/roles.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ccb9ef8051cbf6484ec6d2df0fcaecf3b3bd1804d676c13018edfce45964309"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should we add \u0060link\u0060? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_aria/src/roles.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"b285805670e1c621419f0bbdab590879961af634033d7bef138a05cc710e5419"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Integrate to [\u0060VisitorContext::match_query\u0060]? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_analyze/src/analyzer_plugin.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c4bcae9800ea923cdaf9cf8c237ad17889eac8f847c5c0792b401c76d9e10c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: would be nice to remove suppressed instances, if any, before emitting \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/biome_analyze/src/lib.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"21354776adb2e14b643b91165b2e1169f51fd4f5d1e77e7342bc54697c905a6d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: #3394 track error in the signal queue"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_analyze/src/registry.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c1448b3595128ade4b8ed28c8faf24e6cccbe55d4e628212178fbdd04f96b37"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060packages/prettier-compare/package.json\u0060 makes this repository a deployable product (line 7)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/prettier-compare/package.json"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"a683dc9a57151f647e0694c358c4463af9ea32976ba8dbb5d92a9ec4b05de8fe"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060ImgHTMLAttributes\u0060 spells \u0060HTML\u0060 where 31 names in the project spell it \u0060Html\u0060: 31 of 32 names in project @biomejs/monorepo spell the token \u0060Html\u0060 (31 of 32; unit: names in project @biomejs/monorepo containing \u0060Html\u0060). Peers: crates.biome_js_formatter.tests.specs.prettier.typescript.last-argument-expansion.break.AddAssetHtmlPlugin (crates/biome_js_formatter/tests/specs/prettier/typescript/last-argument-expansion/break.ts:1); A11y.useHtmlLang (packages/@biomejs/backend-jsonrpc/src/workspace.ts:2010); Correctness.useVueValidVHtml (packages/@biomejs/backend-jsonrpc/src/workspace.ts:2914); Nursery.noAstroSetHtmlDirective (packages/@biomejs/backend-jsonrpc/src/workspace.ts:2984); Nursery.noSvelteAtHtmlTags (packages/@biomejs/backend-jsonrpc/src/workspace.ts:3389). Rename to \u0060ImgHtmlAttributes\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/tests/specs/correctness/noUnusedImports/issue_4888.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea3563f87ba15ea6550e6fdf2c41b5138dceb35602029e2023678dcbb5869952"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060intervalID\u0060 spells \u0060ID\u0060 where 102 names in the project spell it \u0060Id\u0060: 102 of 104 names in project @biomejs/monorepo spell the token \u0060Id\u0060 (102 of 104; unit: names in project @biomejs/monorepo containing \u0060Id\u0060). Peers: CanvasStore.getElementById (crates/biome_js_analyze/tests/specs/style/useDomQuerySelector/validIgnore.ts:3); ToastService._toastId (crates/biome_js_analyze/tests/specs/style/useReadonlyClassProperties/valid.ts:662); indexValid.usageRange(userId) (crates/biome_js_analyze/tests/specs/suspicious/noUnnecessaryConditions/validOptionalChain/indexValid.ts:5); arrow-return-type.getVehicleDescriptor(vehicleId) (crates/biome_js_formatter/tests/specs/prettier/typescript/generic/arrow-return-type.ts:1); arrow-return-type.getVehicleDescriptor(vehicleId) (crates/biome_js_formatter/tests/specs/prettier/typescript/generic/arrow-return-type.ts:5). Rename to \u0060intervalId\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/tests/specs/prettier/typescript/as/assignment.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e507cf04b6bef05652f63b83480bce886efc2080e9126eb2e65992cffd24ba"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060intervalID\u0060 spells \u0060ID\u0060 where 102 names in the project spell it \u0060Id\u0060: 102 of 104 names in project @biomejs/monorepo spell the token \u0060Id\u0060 (102 of 104; unit: names in project @biomejs/monorepo containing \u0060Id\u0060). Peers: CanvasStore.getElementById (crates/biome_js_analyze/tests/specs/style/useDomQuerySelector/validIgnore.ts:3); ToastService._toastId (crates/biome_js_analyze/tests/specs/style/useReadonlyClassProperties/valid.ts:662); indexValid.usageRange(userId) (crates/biome_js_analyze/tests/specs/suspicious/noUnnecessaryConditions/validOptionalChain/indexValid.ts:5); arrow-return-type.getVehicleDescriptor(vehicleId) (crates/biome_js_formatter/tests/specs/prettier/typescript/generic/arrow-return-type.ts:1); arrow-return-type.getVehicleDescriptor(vehicleId) (crates/biome_js_formatter/tests/specs/prettier/typescript/generic/arrow-return-type.ts:5). Rename to \u0060intervalId\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/tests/specs/prettier/typescript/satisfies-operators/assignment.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea29cacd35f742f6f113fe30fa6ce21cb12ba95de8a415ecf96856ca84cbf6d"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Invalid: classnames in nested call\u0022 repeats the code it sits on: 4 of its 4 words (invalid, classnames, nested, call) are already in \u0060export const NestedClassnamesInvalid = () =\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/biome_js_analyze/tests/specs/correctness/useQwikClasslist/invalid.jsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b08b5da4578e83e168470a2d2d385cf54d80d00d07402dff3bad3e21ed3b69"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022A body that is set to \u0060undefined\u0060 through a variable is no body.\u0022 repeats the code it sits on: 4 of its 5 words (body, set, undefined, no) are already in \u0060const noBody = undefined;\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/biome_js_analyze/tests/specs/nursery/noInvalidFetchOptions/valid.js"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"05993bfacb28b8ad887ef490f848737e2a854d6ea3fb03649de5b61ab358b8dd"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Valid suite calls\u0022 repeats the code it sits on: 3 of its 3 words (valid, suite, calls) are already in \u0060suite(\u0027valid suite title\u0027, () =\u003E\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/tests/specs/nursery/useValidTestTitle/valid.js"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba2ae0134bf2db67659866d90ffb01a56456be1e55e90cad630ba44d400135ef"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Block comment before call\u0022 repeats the code it sits on: 3 of its 3 words (block, comment, call) are already in \u0060test.skip(\u0022block comment before skip\u0022, () =\u003E\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/tests/specs/style/useConsistentTestIt/invalidCommentTrivia.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"522e00d478efd3ceab7d2ca8c9ee4651dfb068df6bae271c061a4875dc50385a"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022\u0060${foo \u0026\u0026 bar}baz\u0060\u0022 repeats the code it sits on: 3 of its 3 words (foo, bar, baz) are already in \u0060(foo \u0026\u0026 bar) \u002B \u0022baz\u0022;\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/tests/specs/style/useTemplate/invalid.js"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee1c2876879c0a05a1c244234887606d3944b3a5a52910a3dcf055e51140dbbb"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022\u0060foo${bar \u0026\u0026 baz}\u0060\u0022 repeats the code it sits on: 3 of its 3 words (foo, bar, baz) are already in \u0060\u0022foo\u0022 \u002B (bar \u0026\u0026 baz);\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/biome_js_analyze/tests/specs/style/useTemplate/invalid.js"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ccfc4e5f2ee08baa3a2fc73b7a8d86b26cc4a0636d43d467dbfe6cdf97ddd3d"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022\u0060${1 \u002B foo \u0026\u0026 bar}baz\u0060\u0022 repeats the code it sits on: 3 of its 3 words (foo, bar, baz) are already in \u0060(1 \u002B foo \u0026\u0026 bar) \u002B \u0022baz\u0022;\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/tests/specs/style/useTemplate/invalid.js"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a15ca9998e992c1145295ae67905cbcf2cba5da143d03f128e4144073355172"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022\u0060foo${bar \u0026\u0026 baz \u002B 1}\u0060\u0022 repeats the code it sits on: 3 of its 3 words (foo, bar, baz) are already in \u0060\u0022foo\u0022 \u002B (bar \u0026\u0026 baz \u002B 1);\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/biome_js_analyze/tests/specs/style/useTemplate/invalid.js"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"d35935cd6c1fb190f78ce3989e1734ca6a35a03f03d7eef22b64788ba3646fa6"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022globalThis.RegExp\u0022 repeats the code it sits on: 3 of its 3 words (global, reg, exp) are already in \u0060globalThis.RegExp(\u0022foo\u0022, \u0022gi\u0022);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/tests/specs/style/useUnicodeRegex/invalid.js"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"136e8463b2f2d0f8c26ec56753692f9db0883e6d01ce0ad84d88f7516afad2f3"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Also with Deno.env.get - dynamic access\u0022 repeats the code it sits on: 4 of its 5 words (deno, env, get, dynamic) are already in \u0060const dynamicDeno = Deno.env.get(key);\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/biome_js_analyze/tests/specs/suspicious/noUndeclaredEnvVars/validDynamicAccess.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"413857bc9060f29a09f31b3438421863acdf72eb465fea5933ec4e53e3b9959e"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Also with import.meta.env\u0022 repeats the code it sits on: 3 of its 3 words (import, meta, env) are already in \u0060const importMetaVar = import.meta.env.CUSTOM_META_VAR;\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/biome_js_analyze/tests/specs/suspicious/noUndeclaredEnvVars/validNoTurboJson.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"a75644b2f1a7790e165ee13d78aa12a918e393ddb58151e511e1d025c3415fd7"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Global env vars\u0022 repeats the code it sits on: 3 of its 3 words (global, env, vars) are already in \u0060const globalVar = process.env.GLOBAL_VAR;\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/biome_js_analyze/tests/specs/suspicious/noUndeclaredEnvVars/validWithLegacyPipeline.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"5593b894d0dac1173d798dd7ea5cdab15dbba6223523c04516e9246b971b4e32"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022\u0022foo\u0022 extends string =\u003E T\u003Cstring\u003E extends T\u003C\u0022foo\u0022\u003E\u0022 repeats the code it sits on: 3 of its 3 words (foo, extends, string) are already in \u0060expectTypeOf(\u0022foo\u0022).toExtend\u003Cstring\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/biome_js_analyze/tests/specs/suspicious/useExpect/valid/vitest-expect-variants.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1844c3d3b80db8f26ce2b7e690521a51a1731bee4140ef0d1b6e2852d82fe24"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Single string attribute\u0022 repeats the code it sits on: 3 of its 3 words (single, string, attribute) are already in \u0060\u003Cdiv tooltip=\u0022A very long tooltip text that would otherwise make the attribute break onto the same line but it is not be \u2026\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/biome_js_formatter/tests/specs/jsx/element.jsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"328faf558ccc0f9c452dc307e2cd8ad41aba3ea7e8beed7b2e3f5273641224b1"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022when a consequent breaks in a chain:\u0022 repeats the code it sits on: 3 of its 3 words (consequent, breaks, chain) are already in \u0060const chainedWithLongConsequent =\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/biome_js_formatter/tests/specs/prettier/js/conditional/new-ternary-spec.js"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"29fce37f99235ecd38c70c2307243e22d95fea75589808b6f15daa34ee39d231"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022consequent and terminal alternate break:\u0022 repeats the code it sits on: 4 of its 4 words (consequent, terminal, alternate, break) are already in \u0060const consequentAndTerminalAlternateBreak =\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/biome_js_formatter/tests/specs/prettier/js/conditional/new-ternary-spec.js"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"49871f3da31c51499af8c5bd613fab9432ab6402bd3d173baa19bd3f8b359640"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022multiline conditions and consequents/alternates:\u0022 repeats the code it sits on: 4 of its 4 words (multiline, conditions, consequents, alternates) are already in \u0060const multilineConditionsConsequentsAndAlternates =\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/biome_js_formatter/tests/specs/prettier/js/conditional/new-ternary-spec.js"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb89f97701d4d696087ce6ecfb63976047a989752062ca5135ee0f4d65e8dce"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022getStateCode :: Maybe String -\u003E Maybe String\u0022 repeats the code it sits on: 4 of its 5 words (get, state, code, maybe) are already in \u0060var getStateCode = R.composeK(\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/biome_js_formatter/tests/specs/prettier/js/functional-composition/ramda_compose.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e166a3ec43d5dcc705ef678e9d70064e148e08d2b42a9f10346f89b8f4ac9fc"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Convert the byte span to code unit span\u0022 repeats the code it sits on: 4 of its 5 words (byte, span, code, unit) are already in \u0060const [startCodeUnits, endCodeUnits] = spanInBytesToSpanInCodeUnits(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/@biomejs/js-api/tests/spanConversion.test.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ca56515224e76a859843018d074d24d24945e3feb69b24631b8ed4f0051a02"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022No input provided\u0022 repeats the code it sits on: 3 of its 3 words (no, input, provided) are already in \u0060console.error(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/prettier-compare/src/index.tsx"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"2edd365f30794b9e9bb8f6effa80c88812849b5397d0c3a30116298accae31aa"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 15 of 115 project(s) overshoot their size bounds, lowering Project Cohesion to 7.4/10. The most over is \u0060crates/biome_js_analyze\u0060 (189765 LoC, 1510 module-visible types across 24 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90204b473348622e4ffccd9f23669b0eebfbd8ae74018b4ca0a4c44a0688016b"},"properties":{"commitSha":"0136eb063a67c1c429a15044014dbbeeb02846e5"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3401d9578090006d82d030e28950fcf082aaa52c475f02a3cfc2919823e9feba"},"properties":{"commitSha":"8463545ec585b49c650fcad3900e138b3e1dc9dd"}},{"ruleId":"D28","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b53ff773648944b07a9bca2eec8b2ebbca2f958b79168aa4e290406070e0f313"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4d488f2dee20c5dc46bac4d4945acf5558160ec946254cb8b000aa990fd1b762"},"taxa":[{"id":"CWE-214","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a4c9883abfe1d7370d9261ac2fa9aa82abd2d8fbcc9ada193dfb7abf2eff8a46"},"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":"b30ec20c1de974805610d02eced05fcf2c8c512f1741ede21c51c15c962bddbc"},"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":"8959a22eb353c004346099de016b9ab58bf10f87aa77c9bd6201600340d7f701"},"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":"c26ba804df1d2a5c1bb941ce3ad3b64ae1ffaf6a10da788f99f5f5b7b8b7c4ac"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a3279fd7a57d2e3f1875ff52c25deefe369fa65441f75f559241e8723a3000a2"},"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":"e372b860098b75742cc584b7b20dc9acdb8f03e3c91352b9e1e50c97b9dd8031"},"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":"394c1d9de57d3ce78c389c53099abb743f85fc916ed09cb076d85b4f520fe38a"},"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":"7cf8a78c4a993aecafcb4fe2b18ecb6ff3aced137586a07de2812771fcf18756"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"85f99189d964cdde824a816d83f2290af0a3f7efe42feb1d6495743a90e33e22"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1498825690ee691422757d83c6c8726aaf69040fa62a3b6b71a03075f0880320"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"48c164841f6224291df5678c144907aac1140444045df8422910ba31d14b1f68"},"properties":{"dependency":{"package":"shell-quote","version":"1.10.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8162d7b5fb244a56106e432d0d697f85e13ee7465809921edc33b1d3ee0d1b56"},"properties":{"dependency":{"package":"devalue","version":"5.6.4","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":"ae0d27bf3852b1afd2f913fc91706716da90c473e146b25bfb83dea8339045f1"},"properties":{"dependency":{"package":"happy-dom","version":"20.9.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"test-or-tooling","file":"packages/aria-data/generate-aria-data.js","line":4}}}},{"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":"7713653c1cd2e524df06e4e81d883565ceb6482ea97f6eea94f00d39b4a4d989"},"properties":{"dependency":{"package":"launch-editor","version":"2.14.1","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":"2ea65af982fbfa7ee58dbe3fa40bd975ecb648d209c563eae9269b519d2be2a6"},"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":"94c6ff14ea54b382a61d2f966f77a9032450e908372d7ab5d8acd1b161983573"},"properties":{"dependency":{"package":"postcss","version":"8.5.6","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":"549bcf508709afd19b2bed6db704d7a1425c76c084a0453fcd8e812b00abc0f5"},"properties":{"dependency":{"package":"rollup","version":"4.46.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":"0bf997523edcbfd004b0e48079d2d03fc36b5b8058c165442d7b3299bf52fe16"},"properties":{"dependency":{"package":"source-map-js","version":"1.2.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"659b17df3a297d0c761f05e64fbd7a7fec481b8fec3425db0f2590512d5583b5"},"properties":{"dependency":{"package":"ws","version":"7.5.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":"ffba3a9076a73cf66b6daacb5914c478fbdc74d1383d8d2e4003b6bf3aa7b43d"},"properties":{"dependency":{"package":"quinn-proto","version":"0.11.15","advisory":"RUSTSEC-2026-0338","aliases":["[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0339","RUSTSEC-2026-0340","RUSTSEC-2026-0341","RUSTSEC-2026-0342","RUSTSEC-2026-0523","RUSTSEC-2026-0524"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"28f0bc6d34596072b24d37b19b745b7394ed4ce99a53e032439b262379e02dc1"},"properties":{"dependency":{"package":"quinn-udp","version":"0.5.14","advisory":"RUSTSEC-2026-0538","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"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":"c78c7c829ffb431fb928ff724c9cf0276a780b7b7d9be87f32343d1209a988f8"},"properties":{"dependency":{"package":"webpki-root-certs","version":"1.0.9","advisory":"RUSTSEC-2026-0383","aliases":["BIT-golang-2026-111943","[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0381","RUSTSEC-2026-0382"],"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":"11a8858958f6af7f2809c36538a0c7dba6a1fa7cb81360e64b1ca91be4e8ee1b"},"properties":{"dependency":{"package":"@vitest/mocker","version":"4.1.11","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"503930ce8ac5830cbf3d5f5d8ca5d3c7277e8c969216591a7fc2d919ef93f071"},"properties":{"dependency":{"package":"svelte","version":"5.46.4","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]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5585c48a8c4ed670247ebaa40a533d385248c4e49079fee700e7b93cbab137a9"},"properties":{"dependency":{"package":"quick-xml","version":"0.38.4","advisory":"RUSTSEC-2026-0194","aliases":["RUSTSEC-2026-0195"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cfbc024d691bb9990080dd322abfc6778c2bc6f536b76511c114e8bb3758bf4a"},"properties":{"dependency":{"package":"rand","version":"0.8.5","advisory":"[GHSA redacted]","aliases":["RUSTSEC-2026-0097"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_parser/src/syntax/module.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b6c4b1c2b7845a86986e3c0840dc57a83fa65149a36181bbf5f37e7e8f1c6e"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/js/expressions/arrow_function_expression.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0645165527b7ac7a391e678c0a5a0c03e088e1319ccadee303b12cc8f35fc34a"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_formatter/src/jsx/lists/child_list.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bac385b78b193afcf2d3c43a721aefce282dd7cdb42b0a780d5ecf74a5882ae"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_rowan/src/syntax/trivia.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b4a008681c4c91e00bd8e4a5c646b1a91d18294423b6c63ac6ef3de919fd36"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_syntax/src/export_ext.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"182896d0c72a05b0dd5d2e8ec8a6ccbb86a4808f8b1bc4b338b69657826e3db0"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_formatter/src/comments/map.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f101f796285260d4a7c55c139b18fea55709225c76aace955a06b4601c0d869c"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_graphql_parser/src/lexer/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7594d6d40ea258c696b463f1facbcf4536046d280dd17b236659232ce8faf15b"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/suspicious/no_useless_regex_backrefs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2076f46def41dcf09dbf83638f00abd0207830a85531f0ffe91633811c1db4b"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_parser/src/state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d40ee62e4ffc0ec5ed8942723dc0fef2b8499361b5cd5e6183b72e18db5566"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_syntax/src/binding_ext.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c9f1396d20096296200b5149fb3409607957ce7f7aa253802caa788295a116f"}},{"ruleId":"D34","level":"note","message":{"text":"Further orphaned files (smaller): 291 smaller file(s) also have no living knowledge \u2014 folded into the freshness score and metrics rather than raised one row each \u2014 most significant first: crates/biome_package/src/node_js_package/turbo_json.rs, crates/biome_graphql_semantic/src/events.rs, crates/biome_js_parser/src/syntax/assignment.rs, crates/biome_js_parser/src/syntax/typescript/statement.rs, crates/biome_js_parser/src/syntax/object.rs, crates/biome_cli/src/execute/migrate/eslint.rs, crates/biome_js_analyze/src/lint/style/no_yoda_expression.rs, crates/biome_rule_options/src/organize_imports/import_source.rs (and 283 more) (301 orphaned of 2103 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 2103 of the 4474 production source files in this repository met that bar). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_package/src/node_js_package/turbo_json.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b4e70c5148c0f59c052a900964ac62375891d41566a63555fb3832032074ac"}},{"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/biome_graphql_semantic/src/events.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b98d84e8d983e565f69a7984b8820ab4093935162563e1fcba0e7afc689e6744"}},{"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/biome_js_parser/src/syntax/assignment.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcbec5aafcc417910ea4db5fe21d4c091f3a2d73e23687ce1e6cb846012964ca"}},{"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/biome_js_parser/src/syntax/typescript/statement.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f91e41b57bd9a552715c910c905a229723d09508aedca9269808f76f994f456"}},{"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/biome_js_parser/src/syntax/object.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b0947c2981c01bce0bdcab0562084db15405030f965b2aa2769b99769ddee3f"}},{"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/biome_cli/src/execute/migrate/eslint.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8df8b1ba822f3064b5d14f27bcf8ef3d206832e159dcb59ff8f41adc618115c"}},{"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/biome_js_analyze/src/lint/style/no_yoda_expression.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1b7059da04a809a9653149b04a6e924ff7c98227b52ffb7698acc332865fc7"}},{"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/biome_rule_options/src/organize_imports/import_source.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"070e7a951eca0da16f27dfadab015697c4d6009ff82022d1b22200c7e623bcf3"}},{"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/biome_js_formatter/src/js/bindings/parameters.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da7643995362115395ec7fbd02fb4a219c79d560f6c87903e8037928b2573c3"}},{"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/biome_js_analyze/src/lint/correctness/no_nonoctal_decimal_escape.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cfe71659eb2d8045a62fbebf01bd73c2d93670397ff317e8e5cd9f92bc1b278"}},{"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/biome_diagnostics/src/display/backtrace.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"591d2463f4bc1dc67bfa097167c465923de161ed311d1d826d427c88142cec5a"}},{"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/biome_diagnostics_macros/src/parse.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d070684c1cc8bba283b1d0e3df333906d4e515d37c9e33ff7a60fb3fdd8f0c"}},{"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/biome_js_analyze/src/lint/style/use_component_export_only_modules.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c964744458a68f6d2e6fd500ad63aea0ee6e3bddbb92af919ed0b5645dc7d77a"}},{"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/biome_js_analyze/src/lint/style/use_global_this.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"299184aeccab63e812623fe93c2f7116915f62ebb1850ce3124d55814dfea832"}},{"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/biome_js_formatter/src/ts/lists/union_type_variant_list.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a82d833db4ee0c1b4b0e446c9469e724dffb18a12135ee80c07faa09ef5da0fd"}},{"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/biome_js_analyze/src/services/turborepo.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"311e7807c235d8ac8298fa0b16806d31fb7b4f9662d0610d5b7987427ceecca8"}},{"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/biome_js_analyze/src/lint/complexity/no_playwright_useless_await.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5007f80b637004da477401fd6ec5ef9818cb16e78a31c049a45ddf7323b61b"}},{"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/biome_js_analyze/src/lint/suspicious/no_duplicate_object_keys.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2420f895e0710ad59abbfb66c1413dca7a9e71b5a25f1806fe08a3c861c1ecb7"}},{"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/biome_js_analyze/src/lint/suspicious/no_conditional_expect.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"624f19d25237cd6713650e7d495a62fce7753649a0e5fade433c7e6d499c7a42"}},{"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/biome_formatter/src/token/number.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6590ee4abb44be7a1e982f6cd512e531aded6073de1a217627fa1d66d8ea00e5"}},{"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/biome_js_analyze/src/lint/style/use_array_literals.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0665f186803f9765c1b1a7e203b49f747ac9f0d3fd1fa9f9da1558da6524f48"}},{"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/biome_diagnostics/src/location.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"824eab60c4fd8c0d87ae435fc957f762494929251b928c402e0ad6553826ac59"}},{"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/biome_js_analyze/src/lint/suspicious/no_leaked_render.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"965b4833025b806dc9be78849b41a00533fcd980b7390797cd08dbde60bd0baf"}},{"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/biome_diagnostics_macros/src/generate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b07617cdcf4699234ab4b73b0851e2ea7989a9771800c5c7f64d3553a18a1561"}},{"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/biome_parser/src/parsed_syntax.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3cb3968803f2e6befa5cc96022f27e480f1d1702fee31a890a1ac691419a4fe"}},{"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/biome_text_edit/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce574e593869bae4b36f491a082ee790cc0284a4c041c2a9ea01e7d87fb5b92"}},{"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/biome_js_analyze/src/lint/style/use_trim_start_end.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d7a09d55b74a9bbf9f44955252ba268567908cf883b911acb9749ad7593940"}},{"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/biome_formatter/src/printer/queue.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9afd3a38cbed7cf8b290b8bafa385eac3f97ff445a8306a37ffee77e3375fbd1"}},{"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/biome_aria_metadata/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f82781e02aa6399b66df2bc1dfdc01d214e7092f1ab898c7728f2e2b07df0a5"}},{"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/biome_formatter/src/printer/call_stack.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd6bdbd191d565470591289dd124453374bc56c7041cb8b5b0c7f5270f868124"}},{"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/biome_js_parser/src/syntax/binding.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63de2d275570e4381dd4efeadab0c277129d842c9302bf07ba1acb9272ab961e"}},{"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/biome_js_analyze/src/lint/style/use_destructuring.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0135b6448ab7654c9b95eaad3ccf08ce0e5e752376d22f24a43bc60fb173aa4"}},{"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/biome_analyze/src/shared/class_dedup.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f16d608f286d97ca4628302f36e909c20c531cacdf723a8db4afb83866106f73"}},{"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/biome_js_formatter/src/js/declarations/function_declaration.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2df803693baabb3a7054827242c7ea39e58d0615e7de3db275474506e12ba05"}},{"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/biome_control_flow/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f5c8e82861890a983c4025e560bca2a09437ddeed8445782e27784d3ebd766b"}},{"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/biome_js_syntax/src/binary_like_expression.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec9af3384136a3a73e647881049426ef7b7081b14d6652b76fbd29a9a6e322be"}},{"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/biome_diagnostics/src/diagnostic.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7a0729357d2ac2a6d8429a857e2768441d6c22d574f9887b37b1c887f7440b8"}},{"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/biome_js_analyze/src/lint/performance/no_unwanted_polyfillio.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"26f94c2a89627ddf033ab93ec65add745be4fd427a1b67d9f510e2f5f205fa28"}},{"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/biome_js_parser/src/syntax/pattern.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a945db8855b90e279202405ac583eb72e2b3cbd37e53fa79453d731607a8fb"}},{"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/biome_js_analyze/src/lint/style/use_as_const_assertion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a70d1e4b0d2499aa06aa2ed11dd0b36bdf2d56491e761c350f033ddf677433b5"}},{"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/biome_js_formatter/src/jsx/tag/opening_element.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7bc972fe9d26fadebb239a1c04778560509e83e732bbdbd72d44b1c123d9b7d"}},{"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/biome_rowan/src/syntax/rewriter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c3b303aac0c70c4ba49d027c74a39104e49c5b0ef1b1d639ec03e212bf9fdf9"}},{"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/biome_js_formatter/src/utils/member_chain/groups.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4211bdbf9c01f168ef6375ee7ccc1400307d1f51a39b6d3e7e13cc965f39d0fc"}},{"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/biome_js_analyze/src/lint/style/no_parameter_assign.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69135355d3157313abb411fe0f07f2b0ae98f68d4adf6d76930bdc29366e19c7"}},{"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/biome_console/src/fmt.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58bcd8764e290aebf12f29ccd8b2e6538e3a46bd5e3389749fad77b56b1e95fe"}},{"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/biome_js_analyze/src/lint/nursery/no_svelte_unnecessary_state_wrap.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8875d96151e2e8e1c7c802ae79f761854ad46fc46060b7ce583132debf591477"}},{"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/biome_rowan/src/syntax_factory.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"319adcfe64ca41d042509dd975e98f931874f63d79228a1214eff2654aba2506"}},{"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/biome_js_analyze/src/lint/correctness/no_precision_loss.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e36cf5ce817b0cd7d879cd0ae5e321ceb98815eb4bbdb6ce4b6e43ee0125e8d"}},{"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/biome_js_analyze/src/lint/correctness/no_string_case_mismatch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d38d58195e05aea0d84cc368ee02774aa0ffff5966d23ef0a754197dd713aa4c"}},{"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/biome_json_parser/src/lexer/tests.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aebf31da0d632a70f572847c3f4f1e2341320682f4af450a8733b99b787e51c2"}},{"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/biome_js_analyze/src/lint/complexity/no_unnecessary_template_expression.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34c04ea9d31dfca01f927d737be7707f7c7c57b7dfa2c874e714e04a7a6e27fd"}},{"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/biome_graphql_parser/src/parser/definitions/operation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f318772ae3dbac2cf45a68a0af1d6e8ecec7491d0a99d287554cc9ca2f9f44b5"}},{"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/biome_console/src/markup.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af9c5df670db6a01035964588a6e7e5e471298a9d38caad3087fba54f8288ee7"}},{"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/biome_js_parser/src/parser.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8065196995f7410153bdaa05b84479c1a9aea7cd965f525b84aa7b29bbf24cc2"}},{"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/biome_js_analyze/src/lint/style/use_shorthand_function_type.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7114d90593d91d234789633bdcf723ca2a387d7982cba9971cd0c56665c8e59c"}},{"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/biome_js_analyze/src/lint/complexity/no_static_only_class.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e79c94068e94332848995f1f79086df968d410ca6dd46707de8a2094e9a7ce51"}},{"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":"xtask/codegen/src/generate_node_factory.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee792f8ef4c1b21a32dbc2eb57a1ded4c75286cdd4d35f61fbf9a5e159b8e8c"}},{"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/biome_graphql_semantic/src/semantic_model/reference.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd753924c1371057263a4f4f5fbd4df212f8b96f454c5fc9175ccf6db6bef6c1"}},{"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/biome_js_analyze/src/lint/style/use_literal_enum_members.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b0351555c349a05f38965dedbc6c6fab3e53e12477f9ddf10686df5680af8d4"}},{"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/biome_js_analyze/src/lint/correctness/use_valid_typeof.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9491d5610d2cceafe9a193b5f70796bb1171a299fcdf6fba3ba41d35cfd6a6f"}},{"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/biome_js_analyze/src/lint/style/use_enum_initializers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d08e8b99dafe0f12200f215266f94290536d79e5e90f209f135487a60e6f0f7"}},{"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/biome_rowan/src/ast/mutation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14738fc2d9691020f5aeb57bb6fe2bec0609d8990359a29656c0f4fabc38909c"}},{"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/biome_css_parser/src/syntax/value/type.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d272eaffea1411256ff5f592b16f4a4f32b595ce38cfb15608ca328e58ccce4"}},{"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/biome_rowan/src/raw_language.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56dc3f6de41644fc7b4284027ccb12e5ec4cabe7be2fefbdff8746366aa9c311"}},{"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/biome_js_analyze/src/lint/style/use_consistent_builtin_instantiation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9234243c779414e088ceb5572bc20e2372152d935f3a30d3a35b8e588b7aaa54"}},{"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":"fuzz/fuzz_targets/rome_common.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5da004b844a01b60a432c715f27e1818b42c9d672eb14e1c3bdd5e847033f7d"}},{"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/biome_formatter/src/separated.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3610e076177d6c696b185234d276c391b9c5a7816a6887d1f14006fada85ef2e"}},{"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/biome_js_analyze/src/lint/correctness/use_qwik_method_usage.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94c8634c23883ea0ecd7284bce00661e5040537a1d707277dd3b3f6118b17f88"}},{"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/biome_ungrammar/src/parser.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4548723a9769b45166baa597ed18a1ff7c88d8e44695320fe710271f23cebcfd"}},{"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/biome_js_analyze/src/lint/suspicious/no_useless_escape_in_string.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a02a6d1ec888ed7759fe02f0221328666a5fb76ad96167abe887828f2a7c473"}},{"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/biome_js_syntax/src/parentheses/tstype.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d174dca5dd1a0a24de237011f6d9c71e7bafbbeff47639a79b9cb8f8f3d9c6c1"}},{"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/biome_js_analyze/src/lint/complexity/no_useless_undefined_initialization.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c10e68dd644f4b89320f750c5c4d214764ff34f3fd228efa44573df217b608b"}},{"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/biome_graphql_parser/src/parser/value.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e07801d5ae8093485f8a360999bfe8e6573ecf99acb35e3dc6813d97f1d8e752"}},{"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/biome_js_analyze/src/lint/suspicious/no_duplicate_parameters.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3029349835f56bd889b3ed3b63386834fccdff38964eb6e61f1a989d717c3fd1"}},{"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/biome_graphql_parser/src/lexer/tests.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1199a606f4aeea27af30a8cbdc1e5e5253a3baedbcfeb5d41cc5fb7dad9f5b33"}},{"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/biome_js_analyze/src/lint/style/no_non_null_assertion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"68923055c116f7415981b5c376aeaa1bb981c151fd08ee1f73614792e61a27ec"}},{"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/biome_js_formatter/src/js/classes/property_class_member.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1676aa1aa08631616528a5e01a4f60a062b7be482a21057a8d7ce67990d09cf8"}},{"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/biome_js_formatter/src/js/classes/method_class_member.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9222fe09b8bdefcf06d87184d32bd78ca11fc8b191b264f99bbae44ae5b35a55"}},{"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/biome_js_analyze/src/lint/performance/no_accumulating_spread.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85eda92fb3f101d377f43904bc155c2e58c8d8a7c125bd0d7407adbf9a301f67"}},{"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/biome_parser/src/marker.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a193d956837dfb5a153ec606bc135e3379dfaf80ad2511439ef5295fbcc19158"}},{"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":"xtask/codegen/src/generate_syntax_factory.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73522af2e3e0e04e2eed582770f6d96d287ea028b95cfdfcc0e6f23a73077149"}},{"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/biome_js_analyze/src/lint/correctness/no_unsafe_finally.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75263c94b58dffea629d0d1681112d95070a37f023ae6c1001e51736d60fe08f"}},{"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/biome_js_formatter/src/parentheses.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1caabb41432200dcad16f4fc122422291bed8dce2a61cebe615b7d51830d1d12"}},{"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/biome_parser/src/token_set.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf627b9a1031e4b990f37cc28beef17a308410c88c8ed4ca53f863ebae67c818"}},{"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/biome_js_analyze/src/lint/correctness/no_vue_setup_props_reactivity_loss.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a88a3bf704a3606c19046c798ab7d9f16f5bbddf47c5014a489853526f00de3"}},{"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/biome_js_parser/src/token_source.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a885b81812ca74ed121d0773bfbc06b02239f6742fe55643d5776dfe8806dd"}},{"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/biome_js_analyze/src/lint/complexity/no_flat_map_identity.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89416f91663cdf16c8a041d83d41b5de7e908766108a4f6cbe10f095a4e3dd44"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/@biomejs/backend-jsonrpc/src/transport.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ce58356d40feaf8b72cf168a15db75bacf49bed1d646cf24c0180483f01f5e"}},{"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/biome_graphql_semantic/src/semantic_model/model.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f73a1d9c8165cfc1ba7f16595614fef7d2e0259481888c555eba48f4ba652a1"}},{"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/biome_graphql_parser/src/parser/definitions/field.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec6442d7d81de24755c194dbf52f23f3b37d19aeb9de099549ae523de55f9bc8"}},{"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/biome_diagnostics/src/advice.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed0119ba30ef6dc4a805080b5c80afa5524466e8bb9cf419d7affb3e7c1bdc4"}},{"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/biome_js_formatter/src/jsx/tag/element.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c2fab81bb5df33eb9661f053a6676322ee69e481cb4a2909d9684df11649362"}},{"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/biome_js_analyze/src/utils/tests.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b14812f43bacfb74c15800c0ffa87b609bbd3106d06bc9546d14966a51808c"}},{"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/biome_js_analyze/src/lint/complexity/no_useless_this_alias.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4907029f398abf878f5729b1c1ec7f51b2649ca5290868029fdfc0e1c6e95254"}},{"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/biome_js_analyze/src/lint/correctness/no_react_prop_assignments.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee357a034ec66c6ba202ce94c65bc5b6e164e11029e394a99ce71beb0af8c524"}},{"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/biome_js_formatter/src/js/expressions/static_member_expression.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a18d873cfa27ec2f46ff3f4d6fe66f9db597731ccaf4c7c3ffe3511e1e6309"}},{"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/biome_js_parser/src/syntax/typescript.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0932950c25d89b54891b9256a8233b5423175a78dbf8ef4f916749030590ccf1"}},{"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/biome_js_analyze/src/lint/correctness/use_valid_for_direction.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"259b6f32234197c0e51d0ccf8fe1fe7a0caadfafbcb72271c0ffdc93b2843b3f"}},{"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/biome_js_analyze/src/lint/security/no_script_url.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d87db424eb42172d1928630a2854fc795e654e067132a58fcbbb4f6d299ed41"}},{"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/biome_js_analyze/src/lint/style/no_playwright_wait_for_selector.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"106c04e1a130635a5569278d7b8770bac49f97194632e80a40c44c5f412bbe8c"}},{"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/biome_js_analyze/src/syntax/correctness/no_type_only_import_attributes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6865c4a27bf366572069a504797ffd7f2c618b0f60dc4988ba47a758175b7811"}},{"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/biome_js_analyze/src/lint/complexity/no_useless_rename.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"03433470ce2fddb38b4e9b8ec631b6cfa48b9e827a65e9155ab01ead33f9a5e3"}},{"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/biome_css_parser/src/syntax/at_rule/function.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb85ac4aba268edf231dade956490d0bace6fc0400ab94bfcca20346a19b829"}},{"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/biome_js_syntax/src/type_ext.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9680cb50e5b02b548893f3acbbed5479f5509939628932d8f694395707d5d89f"}},{"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/biome_js_analyze/src/lint/a11y/no_noninteractive_tabindex.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef5d89b50821488da206d3305c938de3b817e70f250c46e5cb6b70fd13b210c"}},{"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/biome_js_analyze/src/lint/performance/no_jsx_props_bind.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c858c0eb4c0979c99afc73c98f82f5dc83ce6911a7eae8ddf8324409e91dcf91"}},{"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/biome_parser/src/parse_recovery.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c698db0e2526d94eeb40e0792955743f6eea076d9c6754ceafb7872fde3b3488"}},{"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/biome_js_analyze/src/lint/style/use_shorthand_assign.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f06587ed0e1cfc8ac40c321e5e83a51dbe62880d55a4851915875d1ebac64a0"}},{"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/biome_js_analyze/src/lint/complexity/no_excessive_nested_test_suites.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f1e883b4fd0c2cac6f96e45a64ba9d30437999c31f53b9c013d6f22c659284f"}},{"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/biome_js_formatter/src/utils/member_chain/chain_member.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfdf9293061e21e9e674b4a09d11c3329a1e21e31b2d2fd4cce013424a294373"}},{"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/biome_graphql_semantic/src/semantic_model/builder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ebbb3246c5cc167f96549624034616db36bcff901168318660b42ecb491b78"}},{"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/biome_js_analyze/src/lint/complexity/no_useless_lone_block_statements.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2762a4881479b7eb60c00b84cba9585c5bf72f8cd561b964fdc289863dc0dc1"}},{"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/biome_js_analyze/src/lint/style/use_throw_new_error.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1266c573e1db6feb2285fcc4180738aa6314bb501adb2f32a7784bbda22676aa"}},{"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/biome_js_formatter/src/ts/types/mapped_type.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2723cc1889ff0ba52511cf4463550f36fc26564b0215ee5b6916d62587d90bfd"}},{"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/biome_js_analyze/src/lint/complexity/no_useless_type_constraint.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"414ff514937b5c80cf6f8a126fee25cc727bfdc5a523cba648501df2e67a2847"}},{"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":"xtask/glue/src/glue.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dd5612ae43d0d0e60a613be8c9a6f81a4ac1caec8cc3daf586bf44c0ea52de8"}},{"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/biome_js_analyze/src/lint/style/use_default_parameter_last.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"402ca76ae07de20c3f80a343187a6efc08e8c6f1082e0fc6d493bc16bb59c197"}},{"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/biome_js_analyze/src/lint/complexity/no_useless_continue.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2120233eea1aa900d9cb3da9ac25b10249a388ac8954c748470c5f4f97dae79d"}},{"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/biome_js_parser/src/syntax/auxiliary.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1820d1ee3806b7bf59659015ab8108854e236a77bc908dd8e2bfeea397c40e7f"}},{"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/biome_rowan/src/macros.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ab354ce2711e654c4175c60d6f029a64742ff72303be5bdfbeecefb995d8d5"}},{"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/biome_js_analyze/src/lint/style/use_spread_over_apply.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c399e0cac2480984f37f3803b331be0f3bf45ba13b613a5c85cfe978da0565a6"}},{"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/biome_line_index/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd054631e2395254f288be2d5bb0b98931649bfcab8de73711ae47cdecde70e"}},{"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/biome_cli/src/execute/migrate/ignorefile.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"944c7729f80697f6724568c8cc38d7d6e4628cc8728731a0f526eda0cc93a92b"}},{"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/biome_js_analyze/src/lint/suspicious/use_error_message.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea390b92da20513a63ac1366e45147820e927f219451c5e031ecea12f50c0445"}},{"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/biome_js_formatter/src/utils/format_class.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef0d60e0c6f94835942e68a3c3ae76eb28bbf8dc95d22fdb0b4ea7706498a1b8"}},{"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/biome_js_analyze/src/lint/style/no_done_callback.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b20c8a4d94e39716a2ce2d465304a9d5ec1b6f4366ed03f24dd494f8fdd7d7"}},{"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/biome_formatter/src/arguments.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f26839098d4320c5b41efbcbf05bce8e3acee31d9b85355345a36d7df8fa96e"}},{"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/biome_js_analyze/src/lint/suspicious/no_global_is_finite.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc421ca38c457bd419250b91133974c50aa3132fa9b7278b524c27ba55ad99c"}},{"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/biome_js_analyze/src/lint/correctness/no_void_type_return.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e50c361472e625af9280519dbbbbd04146a0fe69a5bed89912e0b1557c76e03c"}},{"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/biome_js_syntax/src/expression_left_side.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a98a37d29c599cacaa25f3ae4cae61f534e34b2aca55408923009299b62b888b"}},{"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/biome_control_flow/src/builder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a6425364227725548e2df68e7ab0df8dc6ba23f4c60cf41e7ec7af4553cc9c"}},{"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/biome_js_analyze/src/lint/suspicious/no_compare_neg_zero.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de4216d39f8eaecd0c8b4c4bb577d15f336b2a81caa03c70681b3ad6617ea389"}},{"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/biome_js_analyze/src/lint/suspicious/no_global_is_nan.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc1ce6fb4e2bf1cc5e8f8dc6fc457a0f387aa8d683cc88ce6800f07056fc8c04"}},{"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/biome_js_analyze/src/lint/suspicious/no_bitwise_operators.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b31b7e5cea1557632747405d0857dfe50f0086074bd35ce2b2c11182441af464"}},{"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/biome_js_analyze/src/lint/complexity/no_useless_switch_case.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3290d892fd7e707573b7f1b55638739906da6fd0cbc0e61ed0c853c5f49e877"}},{"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/biome_js_analyze/src/lint/a11y/no_aria_unsupported_elements.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ea7502b8056bff052ba1cf2803eaab680f31a8aa32a7b10eba2cd5473ae059"}},{"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/biome_grit_formatter/src/context.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc3862dc506914b230e85b39a73f441621894c79e4df792a51c0283987803a1"}},{"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/biome_rowan/src/cursor/trivia.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c92bcce3a5607e668e2e3a608bd444374ce91324f16e3c541c02cd63696023f2"}},{"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/biome_js_analyze/src/lint/complexity/no_useless_catch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"46cf51b15806827e865d846c4d53932e5a558bfc69991522f491a871f96744f1"}},{"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/biome_grit_patterns/src/linearization.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7752455f6444ff1c8e8b9be84423c521a00bb63b9ea8a36685d16c7402fc570f"}},{"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/biome_js_formatter/src/ts/expressions/as_expression.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb39a3f99c78e6a69846a078638066c9bedab26aa4bc28ca3d34d3b6bb6caec1"}},{"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/biome_js_formatter/src/js/lists/array_element_list.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ca134294885f4d190a55a23704d1c041b7f2029f040de49595791078932ab8"}},{"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/biome_graphql_parser/src/parser/definitions/schema.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"738ed63fc4ebdcb935f9967c635a22ae13cb70dee843a749d0b66f363da4a23c"}},{"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/biome_deserialize_macros/src/deserializable_derive/container_attrs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e26a33cea4d73a8a9984a80f13859286f2bf1c1eb882322af8de3b7749e0571f"}},{"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/biome_json_analyze/src/lint/suspicious/use_required_scripts.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e35c4ba08bb319bec9d4f1b2a4eacd69d60599471bf9b8d480a755e4718a7c"}},{"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/biome_js_analyze/src/lint/complexity/no_useless_label.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91bcdf2654285748c47c600054453fdb0f893fb6dddb4ab6f36364248910be6f"}},{"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/biome_diagnostics/src/error.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d388709fdaafcda29c44b3243e1724647414484cb0f4514539c2131622badc"}},{"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/biome_js_analyze/src/lint/suspicious/use_guard_for_in.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0eaa2398d6d6ba296ca0c75255b64a3979ec6ce8e2b5137bd402c57b3a6a99"}},{"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/biome_js_analyze/src/lint/suspicious/no_import_assign.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"026ed14995092cf0dc290283a43ff5ef5769f22e7a66464c81ac4f7b5901ce05"}},{"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/biome_js_analyze/src/lint/style/use_collapsed_else_if.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"40fce1c89763d01d9b6dd7b8be364e18aa8f7ecca949794dbc1b7aee9909cee2"}},{"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/biome_js_analyze/src/lint/correctness/no_empty_character_class_in_regex.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af98682232f5d83c81c6e2e7af20444fe466c7b21348ac762f008a887b7fdae3"}},{"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/biome_js_analyze/src/lint/complexity/no_useless_empty_export.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80ac353ca1808827a7a41957f3e2ae1f6c6e68cf5cd10fef1112334c4ae391b6"}},{"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/biome_js_analyze/src/lint/style/no_playwright_element_handle.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33af9982482fd5bec9dee5a31f6ec6ea4e41a1a96c15f5ef8e9bf4cd6fb16c37"}},{"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/biome_js_analyze/src/lint/suspicious/no_playwright_networkidle.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b454188e271e234e38d298991c039b92b8b9c64360ceb7f6ab4aafe12d98af96"}},{"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/biome_js_formatter/src/utils/array.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5afc9b6a58a87500812271f6e990f5b8183b4c6dd1d540b5e8d3cafb513eacb"}},{"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/biome_js_analyze/src/lint/suspicious/no_misrefactored_shorthand_assign.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e846f9c03d97735beb31b211debe8051297f9c42463e3169767ac68be27ccd0"}},{"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/biome_graphql_parser/src/parser/definitions/union.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f3b28ab48fd2574d2cc844fb7ea55501eb610e73fe66d8c9ec354902cb13a8"}},{"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/biome_js_formatter/src/js/lists/parameter_list.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ba9cf440d0d3264fbdcbdc0612ded870372c289e8a6e972d5825a6a4f49bbf"}},{"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/biome_js_control_flow/src/nodes/try_catch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d71710f383542d64a1fc4f95ab96794b506907758b89dee7f2143bc7c47279b"}},{"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/biome_js_analyze/src/lint/suspicious/use_google_font_display.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1fe673c1e574c42870dbfac6a4485806da575fdab989ffe4d093f5492a8704a"}},{"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/biome_js_analyze/src/lint/suspicious/no_async_promise_executor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd32a5b6f79fac5971158a27a946ead5e43f3f7f9c4a0a08880daf84bc3e2eb0"}},{"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/biome_js_analyze/src/lint/suspicious/use_is_array.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"240ffe470a0502bf710bd11d77b97e93cb9a89c21fcdbfeec0faeba6fe54b8e9"}},{"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/biome_ungrammar/src/lexer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df34c6cbcedaccb4c68e45218cb13adbbd8744bfdb50dde62e1ba7c3a1e359f5"}},{"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/biome_js_analyze/src/lint/suspicious/no_confusing_labels.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"148e241db497af06d03c7973239a47da64f9b4f1d35da601ef33c87b22a7ccf9"}},{"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/biome_js_analyze/src/lint/suspicious/no_playwright_force_option.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3feb3ec2fc11927fc0484d7ea5eb07eb7728d24321adf508a808231b847f7fe4"}},{"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/biome_js_analyze/src/lint/complexity/no_useless_catch_binding.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0878b102a313f46c491c8086b7c9dbf2e2b30ac705ac09744cb4843d80b5d2a"}},{"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/biome_js_analyze/src/lint/suspicious/no_evolving_types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1988c3014a43c92e8246c13992153b0b1de23f0d4e54e53c7d70c33eb086c5ba"}},{"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/biome_js_analyze/src/lint/suspicious/no_empty_interface.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a23f77af6cafe2e8b6c68ae428ab81d52831cd53ce73b32146ea187b5c424c"}},{"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/biome_js_factory/src/make.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b208c36c1e1c3a75e1bb6a8ee0537b5fac9f02460fa7d06f075ec8ca3ad911"}},{"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/biome_graphql_parser/src/parser/parse_error.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee3380e5ffc913dcfe1f4d1ac356dc05c5e2056b5ea9275dcb8dc765c27c9a8"}},{"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/biome_js_analyze/src/lint/style/no_implicit_boolean.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c514c821388827bd9ce4074e21ddabeea1f017f3091de8afd78a900bbb984c2"}},{"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/biome_js_formatter/src/js/statements/block_statement.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b54cfaf68821b5b128db9f8f6804399434968f5de00f6b33cbfe0eb747dbf9"}},{"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/biome_cli/src/reporter/checkstyle.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"adc4d98206534ed9bc8f861a045859e04b39f0f21e7cfbabf71fcc9777117c1d"}},{"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/biome_js_analyze/src/lint/style/use_throw_only_error.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d7c9ca6ba370085da4d307bf83c722403a12932c93ef5c6db1b80b232c441c"}},{"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/biome_js_formatter/src/js/expressions/array_expression.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82aa6e9e4531591cbe7eb5c651fd945aafa9f309d3664722e48af124543ef957"}},{"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/biome_graphql_parser/src/parser/definitions/enum.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"896957cf365a1cb9b9959da2a78225231bb4b88945bd624afdbce6e6935b4422"}},{"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/biome_deserialize/src/merge.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"752dacd227216f69b42e5004d76a5201940ab957bf060851c5eb88a48960de5c"}},{"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/biome_js_analyze/src/lint/a11y/use_key_with_mouse_events.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"05984d970ae99370472aedefd2b9c0ca7830d82951b68613ec2c3621994c098c"}},{"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/biome_js_syntax/src/parentheses/assignment.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96728bed9767524b065f70111c859d5a44bbc4110e07bbb52fc1acd03524939"}},{"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/biome_js_analyze/src/lint/a11y/no_static_element_interactions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d221cae6f8c589eae099e99f8210cb3930b8024fe763501c7b8e015aec2e65e"}},{"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/biome_js_analyze/src/lint/correctness/no_qwik_use_visible_task.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a46b30a0106fda8882ebd72a311f4d5ace99de6ae218c3d81a699b60de79efc8"}},{"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/biome_js_analyze/src/globals/javascript/node.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb087171ad8cc72c159eabaf008b0e9f22553bc6260801875fb42cd1d453723"}},{"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/biome_js_analyze/src/lint/style/no_default_export.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff073713b3c99d1d3f2d45dc7e0795890e0f155a08bdfc0aa7f25a80977110b"}},{"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/biome_js_formatter/src/js/expressions/await_expression.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a15a9a111a57f73dfb1cce2459406f218d3131066dbd126a194355953d2d39"}},{"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/biome_graphql_parser/src/parser/definitions/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1de249524af90d0f730d690db0f6ce03a93578f7b1452895dc3f2767fb9fbf1"}},{"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/biome_js_formatter/src/js/expressions/conditional_expression.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3549c10c29415a4a684e4ff2bb0b1c77b9a72df10cd2bc2871a3202096dfdeea"}},{"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/biome_js_analyze/src/lint/suspicious/use_number_to_fixed_digits_argument.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f408b101b60832bff2f334546351838e5b057402924122df75d0b2d3e72285"}},{"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/biome_js_analyze/src/lint/suspicious/use_expect.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86df16b81e221f0c1b1c550ee6818ddd0f85f2a022bbdaa2d53f57efb8af47bf"}},{"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/biome_graphql_parser/src/parser/definitions/interface.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b6d608ebb4a8e9f2ccf59fe476add958af7e720abab55f3b7563abe648e050b"}},{"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/biome_js_analyze/src/lint/correctness/no_restricted_elements.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a98610cef72277ba46272420318bcb08db3660665ac4372d0468468d232e0268"}},{"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/biome_rowan/src/utility_types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff93d7d149bb207099dafc82b3e3fe3870adfc0ae54789196d6e9f00cff1eda"}},{"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/biome_js_analyze/src/lint/suspicious/no_unsafe_declaration_merging.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdce33ec050c956aa28588b8fe315bf841cf6710d292d8bb7d7b035666d0b207"}},{"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/biome_js_formatter/src/ts/expressions/satisfies_expression.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6740a23f6e036974716688141219987575b137f3b4f97006788dede680e9d664"}},{"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/biome_graphql_parser/src/parser/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b837eca3a89d61a1ee5521a960c412afba6fb1a15078bcc7e803519e60fca63a"}},{"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/biome_js_analyze/src/lint/suspicious/no_function_assign.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"489503b378bac728e1fb0f112351f96f0b12d2e12fbec6ff79cf3bf4bdcdbbb2"}},{"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/biome_js_formatter/src/jsx/auxiliary/expression_child.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c13f3ea932962481c6715610e7bdc417837805646a10e68b69096a4340817f2f"}},{"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/biome_graphql_analyze/src/lint/correctness/use_graphql_named_operations.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"556758906ef4a4dff1ead62eb9b04aee42ec8111cb60431a6d05fa46c4a1dc52"}},{"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/biome_formatter/shared_traits.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ad089721ad1542a4a5e29160b2b3bdebf00ca2952bd9178807cf1e29286ebb"}},{"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/biome_js_analyze/src/lint/suspicious/use_getter_return.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"395645863cf720dd239fa4020411c0271f1463da99391e0fe1f344f553844cfc"}},{"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/biome_js_analyze/src/lint/performance/no_barrel_file.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7656b8ef8a546ea61d472ffe8992389faaa8a15ac186d9d00de3f8589a87ac0"}},{"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/biome_js_formatter/src/js/module/import_named_clause.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af9a36b75b4d6646a7e80ce6b013ee9c6c5cf7eb9496c039f31d888fc8de5836"}},{"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/biome_js_analyze/src/lint/performance/use_solid_for_component.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e8b0091e4ae2a65f0df5e6b5fb25f39fcf248789d554c98b6c55ef6ec4ab12"}},{"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/biome_js_analyze/src/lint/suspicious/no_return_assign.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12177a2209a0c35484b0cd30d660d0f4fb92c3a1facc539a519f5698e204ee57"}},{"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/biome_js_formatter/src/ts/declarations/interface_declaration.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76bd4e8009e6a948681859cf633d73bc283e09169dfdd16a17e005e24db3c3c"}},{"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/biome_js_analyze/src/lint/performance/no_dynamic_namespace_import_access.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58a263c1054d63caa9d30ff7fae5ed6b6e86f191f1e6e7262c45b90b9859927f"}},{"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/biome_js_analyze/src/lint/suspicious/no_head_import_in_document.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd386abd1b41c0b7ad03310ef18169b0e94063c81d7a7c1f08658f3d5a908c17"}},{"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/biome_js_formatter/src/js/auxiliary/case_clause.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca716b45dff7f0aa127c677777e937693aad5997420475600e3f29cb6fd31c8"}},{"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/biome_js_analyze/src/lint/suspicious/use_default_switch_clause_last.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce13b0f5937db42fedf21274afa654a61f8731a33fc60acc83c2185933cf819"}},{"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/biome_js_formatter/src/ts/expressions/type_assertion_expression.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2d9b9f729275177f18200813175093c5b4cda2451aa51f9427ba38b459ba7a"}},{"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/biome_js_analyze/src/lint/style/no_restricted_types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2918e0a4fdba3df3d46527bea061c9196224f9b6aaa2b5ae69f4b80010b6f08"}},{"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/biome_js_analyze/src/lint/performance/no_img_element.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"649d3f9b1183ce38b0f1934a1729e77ab694b8c22cddcce7356bd76c592b37a0"}},{"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/biome_js_analyze/src/lint/correctness/use_qwik_classlist.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"26f1e95075fab9660f9ea08132243ba19e058168870b1b1c352cda1e6738ec96"}},{"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/biome_js_formatter/src/js/expressions/computed_member_expression.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f4e35214c2ec5ec0f1d3e16697f1b457d1b1498972c644d52f5d3c584b4d5f2"}},{"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/biome_js_factory/src/utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e244d4a37a9efdfc5a36f38e8a43f3eb827ab4d386322e333bce9c2f63f75631"}},{"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/biome_js_analyze/src/lint/correctness/use_qwik_valid_lexical_scope.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"213be56c860f95f6e94e987e2bce2695074437001dcc68206bac72debd827932"}},{"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/biome_js_analyze/src/lint/suspicious/no_catch_assign.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b87e6a938a7234ad8a919dc6d5de6f6f9b6c8664e1a3ea8dfc8215df943bf94d"}},{"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":"xtask/codegen/src/generate_nodes_mut.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"88ec5bc079a0fc4254665d4f20b90132567ac0e0c6c99a5d24db84a09338a029"}},{"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/biome_js_analyze/src/lint/a11y/no_header_scope.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aeb3a9f29961ed664bc63aca0e81adc528415ec0dc1de59cf3e1672c9afff31"}},{"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/biome_rule_options/src/no_unused_variables.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"18033ec5f5dd39da52b2ae020a65bc24ab2866a49889d096b912f77b1c06d1e4"}},{"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/biome_js_analyze/src/lint/suspicious/no_drizzle_update_without_where.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"841085c889a9851abb96bdd1c758621e317dde521aacb2d5e8ae0f6b2d48e53b"}},{"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/biome_js_control_flow/src/nodes/switch_stmt.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8703f79b021f56082cd673551d128029653b9d6799cd399f03c110b34d835357"}},{"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/biome_ungrammar/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be6952a4496be150cd4004768c6e8f0f0cdfe366306449ddc1cc7513b81ba778"}},{"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/biome_js_analyze/src/lint/style/use_symbol_description.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93fdf6593909bc7cab77cff08a44f1f97906df1ed9a8aeea363d6649d36e483d"}},{"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/biome_js_control_flow/src/nodes/if_stmt.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87dc6130f7a4cd6a969ea7abcc1459047c33f934da419658861e3e32e111be81"}},{"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/biome_js_formatter/src/ts/types/function_type.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e118f4df6ff4738a92110f382db8680ca90dae4865dd9977910e757f58b24d76"}},{"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/biome_js_analyze/src/lint/suspicious/no_drizzle_delete_without_where.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"644a33b1f893d769c2dbd6b4eabffbf161cfaff24bc8d4bbc1368f3109e23d8b"}},{"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/biome_js_analyze/src/lint/suspicious/no_playwright_wait_for_timeout.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0725ba1d9c8c6cc213240ac7c75039ab56b9bac50a282816cec8d7cf86ee2c32"}},{"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/biome_js_semantic/src/semantic_model/is_constant.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b020cf95866bfecda5dfb7de4b1fafe57781c8712251869e4fe2840c3cded2"}},{"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/biome_graphql_parser/src/parser/definitions/directive.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b9b31802cac8f65843900a7d0715c42f701732e9a1544122352f8674f5adaa"}},{"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/biome_js_analyze/src/lint/suspicious/no_class_assign.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4380280870c8f6da58e6e5ef4ba4dbad22f7fce29f5129ae89c690c9d7e7cff"}},{"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/biome_js_analyze/src/lint/suspicious/use_namespace_keyword.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff40e8565e14eabe002f5e9e18244b021b1b046ecd6141820be1c1edf14a97e"}},{"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/biome_graphql_parser/src/parser/definitions/input_object.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"461130c840d0527be37f66b13fe5d6ab400e3ae5c21d89fff769c55e2fb8d66f"}},{"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/biome_js_analyze/src/lint/style/no_playwright_eval.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a123bd0fb61bbcd8ea9edbc7aeff350ef2241b8c27492c50d97221684f686e"}},{"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/biome_js_formatter/src/jsx/attribute/expression_attribute_value.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8af0606da82d8df0087046790a471adf8e35fecd038d5cffbf9687102aa4ca16"}},{"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/biome_js_analyze/src/lint/correctness/no_vue_reserved_props.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1449be5d3ec68fb8c0e5e002be89a4239c4853e5afff94ce855a02aa3cf2cf2b"}},{"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/biome_js_formatter/src/js/expressions/in_expression.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c6a8433d33704e6a25405d46e6d02fde2fecb4800159f66757883ff74093f1"}},{"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/biome_graphql_semantic/src/semantic_model/binding.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"631a94c9ae2525d624604143b27f70e481e69f16ecc3c2d72a77d3351dc9ffa8"}},{"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/biome_js_analyze/src/lint/security/no_global_eval.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab7bed4e81fe8c99fc940e92ced036862d3a79c5757da32f4ecdb23c1b637238"}},{"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/biome_js_analyze/src/lint/correctness/use_image_size.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a9c72f9b6f59c7270b84d828b889169622df0302f3a7b04ce6ee61d22a59de1"}},{"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/biome_js_analyze/src/lint/suspicious/no_suspicious_semicolon_in_jsx.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7225bb63609162ba367c101fa689f1a8af3d70054d1d74edfb8f2cfbf274fec4"}},{"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/biome_formatter/src/printer/stack.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ae5e31952c699ae16264ad5b9c0cdc972d536f4cde3398e0ed7ca9442605709"}},{"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/biome_js_analyze/src/lint/suspicious/no_const_enum.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4199aab84e820697dbfb07b5d2af816de08745e8513bef4ab93c20d14e0407dd"}},{"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/biome_js_analyze/src/lint/complexity/no_useless_string_raw.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a37839616c2060fc990561de1513b51fb3a3e47cd5b106cf0078ecdd24efa0f"}},{"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/biome_js_analyze/src/lint/suspicious/no_template_curly_in_string.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ff0efaa85f036839aa066ed09035c6e3faae1c3a106939b4a7d76a6bf924289"}},{"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/biome_js_analyze/src/lint/suspicious/no_playwright_page_pause.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"340fd64f757d4972ad986e60b753c4d5d4dacba1d016017b7565c1ae3499a4b5"}},{"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/biome_json_parser/src/token_source.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a548f6f23ea11df612918792224e9321b0859cee8962055733dbe464895cd9"}},{"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/biome_parser/src/event.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"61816eaf81f3144f6ca06cb4811adf2c63466a5c0f81a51718b23075c179dbe7"}},{"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/biome_js_analyze/src/lint/suspicious/no_equals_to_null.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff11789607bf65fbd11782f47956824ed087b3d3db0a879101b62e956c22c2ac"}},{"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/biome_js_formatter/src/js/expressions/binary_expression.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d1c0e55beeea20c1f8f2f944c921b8d3af0a486aa110cdb1ceb10b96a5182e"}},{"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/biome_js_analyze/src/lint/suspicious/no_explicit_any.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b77ec8c0102efc5b077c570a6b847f18e63e7c54dd07825a45077dffb2c65794"}},{"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/biome_js_formatter/src/ts/types/constructor_type.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe74270c2c810a9f7128e64f99ddfcc348be1372f60d9eb5f7801067b57f3da0"}},{"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/biome_js_syntax/src/parentheses/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"77052ac9c6d23b1c105a6ea97fbd3bb2d1d883667d2bc7ef9948ce8a4e113462"}},{"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/biome_js_analyze/src/lint/suspicious/no_playwright_wait_for_navigation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d44bbfa02176b68c057dadeb6e2b3466646fe71f8c057374312348e77f0c1160"}},{"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/biome_js_analyze/src/lint/correctness/no_setter_return.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c3e9d616c787d827163932d7e76e7d591969f955e35d6ac5fe11b0a67c6929"}},{"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/biome_js_analyze/src/lint/suspicious/no_implicit_any_let.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c36fb678c36268be1ce165fd970e6b13922da13e6edc5074e4c9c6d8016a8a"}},{"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/biome_unicode_table/src/bytes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6df7a911be464efcc286aca6959448a409126f0a740c4aa7658ec85c9edf633"}},{"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/biome_js_analyze/src/lint/correctness/no_constructor_return.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cec9a4aa0360ad08347661f93ef01717b76c4a25c1a0c9b6cc8492da0dd0acdc"}},{"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/biome_js_analyze/src/lint/suspicious/no_document_import_in_page.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3cfd54a5db7c5fc6729de664cdd405d3ea06eed7f5313a3f60f0d3040612407"}},{"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/biome_js_formatter/src/js/expressions/instanceof_expression.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e202bf1d4723774bd69043ebe440590610d5fec4406df62549a41fba2b6be7"}},{"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/biome_js_analyze/src/lint/style/no_multi_assign.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71569cd4ced284900bb49fca4c6a62ef5fd7731291e15f69c96521bf6b1b8a2d"}},{"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/biome_js_formatter/src/js/statements/for_statement.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"565c6e61542afca2d6f72bdb0c8e004228951ad6067637f5a8fbea9a0f28bbd3"}},{"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/biome_js_analyze/src/syntax/correctness/no_duplicate_private_class_members.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"373b929daabe328a024fc3c77219227fbac181757dd2e37bb3bf8245a5c8621c"}},{"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/biome_js_formatter/src/js/expressions/yield_expression.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d2fec856ec7a1c5e2bd5df889f0969ec7cc831393adef562451ee833353184"}},{"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/biome_js_formatter/src/js/expressions/template_expression.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bee5f69135d0232fce6d2fc56a2ac956a96cc3efa97262dd064c32ed8a46f47"}},{"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/biome_graphql_parser/src/token_source.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f56ce69c6928f8ccd43b91d4e2b7bf8b5f4a2b3580fb2a64f0fe9a48647269e"}},{"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/biome_js_analyze/src/lint/style/no_head_element.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ed7271f2ef280c5d7ea4e64b8501f9c182ff44c7627a3fd4879fa0b776490ca"}},{"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/biome_js_analyze/src/lint/style/no_enum.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdf94a9c3a46c1e241c1a4b993da8210e4dd5c44456121c1c90721dbd8cd0232"}},{"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/biome_js_formatter/src/js/statements/if_statement.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad7ccebbcaa15cc4306f40ce2756017a4b213f89bae5131484e3d4afab67f95"}},{"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/biome_js_formatter/src/js/expressions/logical_expression.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89f6ca5f09ddcdd1da41c8df8edcad9038ab36a3a453cfee264b045f9d9a8560"}},{"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/biome_rowan/src/serde_impls.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"409f27e4773ff03ff554d081fe0b91392ff3829d0272d9370804fdf619b7ce49"}},{"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/biome_graphql_analyze/src/lint/style/use_deprecated_reason.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"90329772d4cecb17ee2e94c7c5e41932e25b964f918deca1ff0431d8ac78e97a"}},{"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/biome_diagnostics_categories/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"325a964c466e230bbcdb75ecce288ff04639c7c5602ed5190436c0bd1072390a"}},{"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/biome_css_formatter/src/css/lists/custom_identifier_comma_separated_list.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c581e056831b446e9310cc5ca972f4a9851639dc2be463f770e50c04029729bd"}},{"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/biome_css_formatter/src/css/lists/relative_selector_list.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d92387fdca785a6311e5e1aac23d322e79cc1dc91894258bef9011cf84945d9c"}},{"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/biome_js_analyze/src/lint/suspicious/no_label_var.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d1f45ae732efb1d11d3bd7ad3bcc297a7d422d530102fa700516774473b84d"}},{"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/biome_js_formatter/src/js/module/export_named_from_clause.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"388a2c5d667aae70f07024a3773c1afaf9966d6fe3d3d36a115a128654a75af8"}},{"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":"xtask/codegen/src/yaml_kinds_src.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fae4a4cb95ba9e590fa4aa5bb66123b55967fb47305a9ab1fc1e59c0ab5ec40e"}},{"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/biome_js_analyze/src/lint/suspicious/no_self_compare.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d79a0deaf1d9f752b3432da4c44d880a1a549f045e8ebcad9b392d291a23bd0c"}},{"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/biome_js_analyze/src/lint/style/no_exported_imports.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"551e8b3eeb529c6e1770d488dad53b120a60f426c238f0efe1e271b593aa2807"}},{"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/biome_html_analyze/src/lint/nursery/use_svelte_require_each_key.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab6e6b482404256f47f26ce194ba6f402a08e75fcf137d1e7524177487a94ff2"}},{"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/biome_css_formatter/src/css/auxiliary/attribute_matcher_value.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa10ba355d9365118448cf85fe9bd95afcfdd1bde1ab7ff2343a8b32582b361c"}},{"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/biome_graphql_parser/src/parser/argument.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7383a15d476e92f53c10edc6d62e2319b298b217a3322cd758776a133f4a2d"}},{"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/biome_wasm/src/utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"976c3afde0cf3009cc8dc258403404c637a628683c0e284eb3c6812f0d56e56c"}},{"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/biome_js_analyze/src/lint/style/use_default_switch_clause.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c355d1d90544d86a05f29fc501ac486caa78323dceb120622fdcbc862358c84"}},{"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/biome_js_formatter/src/js/expressions/object_expression.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a3262bb66759f93157129b782988bc6354c1af5604582536e90c2fe28a75d8a"}},{"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/biome_js_parser/src/rewrite.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e6aa5a25bf9bfe40a3cc62c5258fe6ce23e67fc9ae3d6f681ad024fa5b587a"}},{"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/biome_grit_formatter/src/separated.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3137a80687407e091b1680bbccc0d7bf65f5407a4a40ae86a07033a13b197ef"}},{"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/biome_js_semantic/src/semantic_model/import.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fec08c2d492929c90549dba255f4a1097fb09b4e36a39948f20fa843f443b9c9"}},{"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/biome_js_formatter/src/js/expressions/call_expression.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"834f79be68f627cca6eebd7a470f8bcc888f9e2255d96c66792a8394e005b8ec"}},{"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/biome_grit_patterns/src/grit_json_parser.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c4392912b3f5178d061e0b6617b573c3c0e525dc483c805816f041aa65aafc8"}},{"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/biome_js_formatter/src/utils/function_body.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"137f739a0ccfdda59837c4d03b050350938f212f09dbee7fbcb578744acdcb56"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 mod.rs: \u0060crates/biome_css_parser/src/lexer/mod.rs\u0060 and \u0060crates/biome_css_parser/src/syntax/at_rule/mod.rs\u0060 change together 81% of the time (13 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 13 shared commits counted here, the most recent 3 are \u00606ffd0a11\u0060 fix(css): preserve interpolated SCSS at-rule names (#12205); \u0060ecd00e81\u0060 feat(css): add support for SCSS \u0060@for\u0060 at-rule (#9421); \u00606742246b\u0060 feat(css): add support for SCSS \u0060@each\u0060 at-rule (#9418) (#9419) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_parser/src/lexer/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e102f6ac438504267626a8d9619733a8ad864ea81318016e9776afb5816d7045"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: client.rs \u2194 server.rs: \u0060crates/biome_service/src/workspace/client.rs\u0060 and \u0060crates/biome_service/src/workspace/server.rs\u0060 change together 75% of the time (12 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 12 shared commits counted here, the most recent 3 are \u0060527db7f7\u0060 feat(wasm): expose new functions (#6896); \u00602782175c\u0060 fix(lsp): code action error (#6545); \u006047cc739f\u0060 fix(core): don\u0027t create a new project when the configuration changes \u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/workspace/client.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1689341b3f7e38079117b51af941176629227b0183d29eceff28bdfa1f43780"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: tests.rs \u2194 mod.rs: \u0060crates/biome_html_parser/src/lexer/tests.rs\u0060 and \u0060crates/biome_html_parser/src/syntax/mod.rs\u0060 change together 75% of the time (12 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 12 shared commits counted here, the most recent 3 are \u00604eadd575\u0060 fix(html): lex processing instructions in their own context (#12292); \u00606a855885\u0060 fix(parse/html): stop reading \u0060{{\u0060 as an interpolation in Svelte (#11\u2026; \u006032dad2de\u0060 feat(parse/html/svelte): new svelte syntax for comments inside tags (\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_parser/src/lexer/tests.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12560dd393f51894560b8d788a628be8ed51db8eb2dd07d6a30413e75ef957c0"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: no_private_imports.rs \u2194 no_unresolved_imports.rs: \u0060crates/biome_js_analyze/src/lint/correctness/no_private_imports.rs\u0060 and \u0060crates/biome_js_analyze/src/lint/correctness/no_unresolved_imports.rs\u0060 change together 67% of the time (8 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u0060ac6615cd\u0060 refactor: removes mutex from salsa db (#10608); \u00603f06e19c\u0060 feat(linter): implement \u0060noDeprecatedImports\u0060 (#7520) (at that commit the file was still \u0060crates/biome_js_analyze/src/lint/nursery/no_unresolved_imports.rs\u0060); \u0060490d3555\u0060 chore: cleanup file annotations (#7462) (at that commit the file was still \u0060crates/biome_js_analyze/src/lint/nursery/no_unresolved_imports.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/no_private_imports.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69f77ee55f1cc4a751599a02e888bab76a1fc5c780131d5c0430f221fd192293"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: check.rs \u2194 lint.rs: \u0060crates/biome_cli/src/commands/check.rs\u0060 and \u0060crates/biome_cli/src/commands/lint.rs\u0060 change together 64% of the time (7 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u0060de1ad4c4\u0060 feat: enable markdown (#11394); \u0060d6d55d04\u0060 chore: remove dead code and update CLI comments (#10748); \u0060e7872bff\u0060 feat(cli): add watch mode (--watch) to the CLI for check/format/lint \u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/commands/check.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1cc4383a34c50fd94e3003a04c05ab8c39130e6c12d3f81b6922813889fd733"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: formatter.rs \u2194 configuration.rs: \u0060crates/biome_configuration/src/formatter.rs\u0060 and \u0060crates/biome_service/src/configuration.rs\u0060 change together 62% of the time (13 of the 21 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 13 shared commits counted here, the most recent 3 are \u00600c250ab5\u0060 revert: editorconfig not default (#5733); \u0060baf09274\u0060 feat(biome_cli): enable .editorconfig by default (#5127); \u00608b54010c\u0060 feat(editorconfig): reenable editorconfig support, add cli flag to di\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_configuration/src/formatter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"231c081fb294a8444455f4053b96687adaa30e390947c65e4b93ae611c191a7b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 svelte.rs: \u0060crates/biome_html_parser/src/lexer/mod.rs\u0060 and \u0060crates/biome_html_parser/src/syntax/svelte.rs\u0060 change together 60% of the time (9 of the 15 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u0060b073c2f6\u0060 fix(lint/html/svelte): mark \u0060class:\u0060 and \u0060style:\u0060 shorthands as varia\u2026; \u00606a855885\u0060 fix(parse/html): stop reading \u0060{{\u0060 as an interpolation in Svelte (#11\u2026; \u006096ef9a4c\u0060 fix(html-parser): allow TypeScript as const in Svelte {#each} express\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_parser/src/lexer/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9568166bba8a472c3409afddca1cb5983f51c4b09e3925c2f1c789720fa2a01"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: check.rs \u2194 format.rs: \u0060crates/biome_cli/src/commands/check.rs\u0060 and \u0060crates/biome_cli/src/commands/format.rs\u0060 change together 58% of the time (19 of the 33 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 19 shared commits counted here, the most recent 3 are \u0060de1ad4c4\u0060 feat: enable markdown (#11394); \u0060e7872bff\u0060 feat(cli): add watch mode (--watch) to the CLI for check/format/lint \u2026; \u0060baf09274\u0060 feat(biome_cli): enable .editorconfig by default (#5127) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/commands/check.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c91cc0a3a676a94f23372022ff1dabb226ea59fc123d76b827ee2654d46b3382"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: ci.rs \u2194 format.rs: \u0060crates/biome_cli/src/commands/ci.rs\u0060 and \u0060crates/biome_cli/src/commands/format.rs\u0060 change together 54% of the time (14 of the 26 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 14 shared commits counted here, the most recent 3 are \u0060baf09274\u0060 feat(biome_cli): enable .editorconfig by default (#5127); \u00607aae85e0\u0060 fix(lsp): apply \u0060.editorconfig\u0060 options (#3948); \u006078bfeef1\u0060 fix(cli): prevent overwriting paths when using \u0060--staged\u0060 or \u0060--chang\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/commands/ci.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4351e45a774479b89c8f17a85813cd23640d9587a1e91760f97cc15f210ee3f1"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 parse_error.rs: \u0060crates/biome_css_parser/src/lexer/mod.rs\u0060 and \u0060crates/biome_css_parser/src/syntax/parse_error.rs\u0060 change together 54% of the time (7 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u006097c92a1c\u0060 feat(css): add scss keyword and arbitrary arguments (#9227); \u0060547c2da0\u0060 fix(parse/css): parse tailwind \u0060@source inline(...)\u0060 (#7921); \u006062a7a2b6\u0060 feat(css_parser): parse CSS-wide keywords and disallow their usage as\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_parser/src/lexer/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"489817702b636fc29cbe75d44bb7a58c1590306bd87acdba5f92c5e6895030f6"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 server.rs: \u0060crates/biome_package/src/node_js_package/mod.rs\u0060 and \u0060crates/biome_service/src/workspace/server.rs\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u006013785fc8\u0060 feat(lint): support pnpm catalogs (#8396); \u006001d8c5ac\u0060 feat(core): implement resolving path aliases from \u0060tsconfig.json\u0060 (#6\u2026; \u0060e0ec141a\u0060 perf: faster manifest handling (#5926) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_package/src/node_js_package/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a5d9ccaea78159603d636d9631df595edd76d2a9f0fab1633c405c0546be70"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 vue.rs: \u0060crates/biome_html_parser/src/lexer/mod.rs\u0060 and \u0060crates/biome_html_parser/src/syntax/vue.rs\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u0060ba1d8ea6\u0060 feat(parse/html/vue): nested destructuring in v-for (#10136); \u006032dad2de\u0060 feat(parse/html/svelte): new svelte syntax for comments inside tags (\u2026; \u0060426de981\u0060 fix(html): parsing of directives in svelte (#9021) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_parser/src/lexer/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"165817d443263727c6d94e041ac23a2de9c18d547810ba57c6f6585603d1e0b7"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: spec.rs \u2194 session.rs: \u0060crates/biome_formatter_test/src/spec.rs\u0060 and \u0060crates/biome_lsp/src/session.rs\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u0060b86842c2\u0060 fix(cli): allow --stdin-file-path outside files.includes (#8508); \u00606cc84cb5\u0060 fix(core): consider extended configs for scan kind (#7099); \u0060e366e75a\u0060 fix(service): biome/file_features still should return a map instead o\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_formatter_test/src/spec.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13e2f5e9f35a36cc3ffe4b245dba31ecb0e8e5ecc5b924fb77dfec036b0e4c25"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"759dca709f1a032fb6f624ce672e6afb5558fce53ecf01fb73618c4d33923164"},"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":"cc682cd7167c2c692b624e54d299d32b2ea2b5b3eb72f5516f0dfab9c0ce991d"},"taxa":[{"id":"CICD-SEC-3","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":"2ecf70ee7f28b2a9183962090575828f57d5ba47056da5ee340e83b35eacfc92"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4f314848b4ad5af32f1f80bacd15d22f00866172a40e6ca1702ccab200520396"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6ee403d05e5ce9acda2be0cbfa7b5c88d9318772a946970666e432f7cbcad0ec"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7a1f719b93cab50cc875e08b918a2d3b499d1cf2a57537d9b31b4ffdbe16c0d4"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d101c271a760b567f7485d0e4953e3e6cf587200e5c1dc57f6b72466277f7519"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"09d6233e161a399a5330d69a91cf5c6bf05d2aa15ac80b165c57f56ee8ff2b07"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ef28d5da59116266c08820362200a219fba15c2ce9a111b2b6fd9f8b1a1f273e"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"069d277c112abd2c3c276f0544a306f2a128341e4da5a88368563ee9c0346b24"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f52014635becad2572adcaacf590a19d56ec81bc292823fdae99bfff45640683"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"29c7cccb42b78ad4bb73009d2f3c4cdd0bb907a447fb2dc7469a616368b85f44"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9e759935bc673c1bbcc6c3a0b71d4c7fad5f018c82bda27e04c84ef98fe18b58"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aaf83a94e6b469a79ec8bcdc66d96cb3535882a59eb9bc6fe206990361d0adae"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"15c8b899847776cbc20ddfa0fc355735fbbc47c4ecf223f0d562a46b0d99b2ff"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d5d67e04e55c4b753ec054dca0384cd42dcfbc5686518d0d2efdd3a0ab0f5fee"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4f1e7684f8281bd255ddef97105c7055c2ebae06964c8745716b83e174debe83"}},{"ruleId":"AX8","level":"error","message":{"text":"Production project references a test project: biome_ruledoc_utils \u2192 biome_test_utils: \u0060biome_ruledoc_utils\u0060 (production) references the test project \u0060biome_test_utils\u0060. Production must never depend on test code \u2014 it pulls a unit-test framework and test fixtures into the shipped product and inverts the only correct direction (tests depend on production, never the reverse). Move any shared helper into a production support library, or invert the reference."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"472fcd04fd02eb26efbac8260b7ad626400cecd881f1e5b82f026560b6a04f0b"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P10","level":"note","message":{"text":"Implementation type on the public API: 1 public type in \u0060biome_deserialize.impls\u0060 is marked as implementation by its own namespace, folder or name: \u0060TextNumber\u0060 (crates/biome_deserialize/src/impls.rs:45, \u0060impls\u0060). While it is public, every consumer of the library can bind to it, so changing it is a breaking change for those consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_deserialize/src/impls.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b394a65ee21b34258b41abd3028fd9870e81d2704a922a2bd1c0a23786c7a4"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 7/12 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060crates/biome_wasm\u0060, \u0060packages/@biomejs/biome\u0060, \u0060packages/prettier-compare\u0060, \u0060xtask/codegen\u0060, \u0060xtask/rules_check\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060package.json\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.json"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b237f7efe841e3a95b381b232502a3a473094adeb069a11eaca8ca533fb1c34"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (34 matched lines \u00D7 2 locations): packages/@biomejs/biome/scripts/generate-packages.mjs:6 \u00B7 scripts/update-manifests.mjs:6 \u2014 the two spans are one implementation copied and then locally edited \u2014 263 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/@biomejs/biome/scripts/generate-packages.mjs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"34dbc2b7b0f54ef55566bb36311b82bc026e872ec76d85fdd95fdf68a20dc4fa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2 locations): packages/aria-data/generate-aria-data.js:81 \u00B7 packages/aria-data/generate-aria-data.js:113 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/aria-data/generate-aria-data.js"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf26503783da006a6c2574b22386e23bd2fdcab8be71b33caafc1684472686b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): packages/@biomejs/biome/scripts/update-beta-version.mjs:5 \u00B7 packages/@biomejs/js-api/scripts/update-beta-version.mjs:5 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/@biomejs/biome/scripts/update-beta-version.mjs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c41c7646376688f1819d578b576be4986eb4e8ace033a041728373ee6157b1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): packages/@biomejs/biome/scripts/update-preview-version.mjs:5 \u00B7 packages/@biomejs/js-api/scripts/update-preview-version.mjs:5 \u2014 the two spans are one implementation copied and then locally edited \u2014 108 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/@biomejs/biome/scripts/update-preview-version.mjs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"de8b241d78a4c608c6765d3c108561c1f03f502291cfedd489eb9dee262df10e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/@biomejs/biome/scripts/generate-packages.mjs:135 \u00B7 scripts/update-manifests.mjs:19 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/@biomejs/biome/scripts/generate-packages.mjs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"879cc3fdb39c6c1376660d649d37124a9abd2d4efd7daa078dd5931804835eaf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/aria-data/generate-aria-data.js:8 \u00B7 packages/aria-data/generate-aria-data.js:80 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/aria-data/generate-aria-data.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f12f26a6453517689f7e9e6869268be027174ecc75b2a299edd66a585c1cc90"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/aria-data/generate-aria-data.js:182 \u00B7 packages/aria-data/generate-aria-data.js:304 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/aria-data/generate-aria-data.js"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"256d2c9d00f2fb0fd7f7e61b45abc0d6f681fe6e53be50af28cd3438b6ab033a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/tailwindcss-config-analyzer/src/v4/extract-utilities.ts:224 \u00B7 packages/tailwindcss-config-analyzer/src/v4/extract-utilities.ts:278 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/tailwindcss-config-analyzer/src/v4/extract-utilities.ts"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f78323494f9beb1ea3e6bdb5021c2f8048695ed386e6332aab63e8f7c959b0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function App (cyclomatic 22, cognitive 17): App has cyclomatic complexity 22 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":"packages/prettier-compare/src/components/App.tsx"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"767dfe391f1e6909d44ac3bae95c391afa4be8f26d3a7cb8f740465138207c0b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseAriaSpec (cyclomatic 19, cognitive 18): parseAriaSpec has cyclomatic complexity 19 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/aria-data/generate-aria-data.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"e209fcc47ef107955a795e0d515625c250f328ab3bd4ff0a6a562c2231bde6d3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 17, cognitive 13): main has cyclomatic complexity 17 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/update-crates-versions.ts"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"3180affee313352e07958d826bc0e44361582344b5df381d856de1c2ae63567e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function traverseDir (cyclomatic 15, cognitive 31): traverseDir has cyclomatic complexity 15 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_formatter_test/src/prettier/prepare_tests.js"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb38fb2f286878bb0df1891307ae4030a6fa1fff50de64dfe33543ddc4074d3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractFunctionalBranches (cyclomatic 14, cognitive 30): extractFunctionalBranches has cyclomatic complexity 14 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/tailwindcss-config-analyzer/src/v4/extract-utilities.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bf7c3ef8321c9f45ee5166489c9fdaf9b9211f62cc86eb74f376e9134bde1c0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 14, cognitive 26): run has cyclomatic complexity 14 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/prettier-compare/src/index.tsx"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7330d2cf61f0bc2de057099f791631b61b26941ac4993e72fd96c4e3ae61951"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function DiffView (cyclomatic 14, cognitive 13): DiffView has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/prettier-compare/src/components/DiffView.tsx"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa91e6090687340fa1975ec272f73c1d07943617f3d767275802ca103599f82a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateRepository (cyclomatic 12, cognitive 20): validateRepository has cyclomatic complexity 12 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/update-crates-versions.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"657d20e16dc284d6a87a4c1ed260838186644a06e682c02f876fb1dcbb6396dc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addKeywordBranches (cyclomatic 12, cognitive 19): addKeywordBranches has cyclomatic complexity 12 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/tailwindcss-config-analyzer/src/v4/extract-utilities.ts"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b67bb75b68b64a0cb1bebdcf733a53bb5269659779c4024e71b3f68d99c3045"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseConcept (cyclomatic 12, cognitive 17): parseConcept has cyclomatic complexity 12 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/aria-data/generate-aria-data.js"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8441eeba154b372bc2e47c7f151d7906590fe2cb878013d50698e56acda1ec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function printComparison (cyclomatic 11, cognitive 17): printComparison has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/prettier-compare/src/plainOutput.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8696f869d590ec39d9946b33634524511d75f5f415d98bb68e017d7ecae378"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 11, cognitive 13): (top-level) has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/@biomejs/runtime/type-tests/traversal.test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c85f70e979ea082c915b5f16028de7a9b07fab1e8b40fb198efc846f3688c8"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/tailwindcss-config-analyzer/src/v4/extract-utilities.ts: 503 lines of code: packages/tailwindcss-config-analyzer/src/v4/extract-utilities.ts has 503 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/tailwindcss-config-analyzer/src/v4/extract-utilities.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7696b9a3b33bf636e067b07c1a693eec6f9cc86c254e335d3c0f5a318b1eaa77"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/@biomejs/js-api/src/common.ts: 473 lines of code: packages/@biomejs/js-api/src/common.ts has 473 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/@biomejs/js-api/src/common.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73c8bd63a348bfcecf703966d7a3f18a6dcd1f99d774867549813a2f76cfe588"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: crates/biome_js_analyze/tests/specs/correctness/noPrivateImports/sub2/default_package_nested.js:10 imports \u0027./sub\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/biome_js_analyze/tests/specs/correctness/noPrivateImports/sub2/default_package_nested.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"b34e230ba4b8f66eb18a2932976e930e5e64bf73f3fe6b44860d9aad6e027512"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/tailwindcss-config-analyzer/src/v4/extract-utilities.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c7009edc062f5af02ff0ebcb131bdd78a032ce95758796f6df5109e6462169a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/aria-data/generate-aria-data.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1017ca984e9bd823b15277105b6fced0d3a5e493938ef2633cd4989a1d753d55"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/prettier-compare/src/watch.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2b34dbe0d12e917057de3c92473173948d12c4ec632801ac4cb50fbdee0c44"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/prettier-compare/src/index.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9beb28fc174976f1c40c8fc56154cf263578223ab92ac8a31597955fa2a31b71"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/prettier-compare/src/components/App.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea4ed7112a24434c81392f52f3eef53b6cb036dad360c9b0278bf3c2fbbb3ea6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/prettier-compare/src/languages.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a6cdb57223c91afdd236089c7eca085475a6c5c0a31c4bfec9917af8cf2c72f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/@biomejs/biome/scripts/generate-packages.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87aa0aeff56d68f0bb4e082f40d2a0aaf25c26c56ef7cbcfacf22090613d6d91"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/tailwindcss-config-analyzer/src/v4/generate-tailwind-preset-v4.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f6304e2e30be489c1ad6dce5a28d2123fbc9ae7f2ceb9412d9e6985b48f1da0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/tailwindcss-config-analyzer/src/v4/extract-variants.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41032eed1c1c5717d99212996b55b03d6a480177bfc0bff502a26f47f1148428"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/prettier-compare/src/components/DiffView.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7075954df3eefd59fa979501f210a75d92b299d36a6261068d2c5662b3222e36"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/prettier-compare/src/plainOutput.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ae8a75366c9bce5cb0653464378fc915f32b25c20b5390c05a70b803c728af"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/prettier-compare/src/biome.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a984e98ed7613868da9bafda2f8b9ec2d94c8ed4b39eb03591a9fa930941ddc6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/tailwindcss-config-analyzer/src/v4/probe-samples.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a069e6436eb0ec20d32f9a6b99a5157f1ddce8e4f60b6d6c316b20c7b7400c8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/prettier-compare/src/prettier.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8efa00367d872e0a44a13826d743502340464d1ea366b49b115ac050629280ca"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/tailwindcss-config-analyzer/src/v4/parse-theme-color.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee2da320e78c58484a276bd7f454d5ea0dde7e9b2b04ea274c91a06fd5327d8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/tailwindcss-config-analyzer/src/v4/css-helpers.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"158c0913eada87626893fbe84ecf319e6190be989e4945ed61501bab96a17cd3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/tailwindcss-config-analyzer/src/v4/value-types.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b20a11462c0b37818e56d3072b4cee34068789d2d7503129d3381ede9c8ce3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/tailwindcss-config-analyzer/src/v4/extract-theme-keys.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff1d0c3663c57d7141f929d3c73e904cffc07a8e632affb749601d7db41d629"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/prettier-compare/src/components/DiagnosticsView.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd729ba781116300d0ad1db61de858fddbf075d61a89c6a177818e6c4205e7f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/tailwindcss-config-analyzer/src/v4/extract-property-order.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b59d61ab0733b589fbc2a39c2c0c926b203b56947e49baabd90e3286f67c15b7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/tailwindcss-config-analyzer/src/v4/theme-namespaces.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c49c9973ee4f4a8c1eebd848e8e55c70169ced84da602f3d00d6b21260f5d08d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/prettier-compare/src/components/Spinner.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c65892cd18d9b79ba1344b30953cc6feba7529836b7f13edfdba1fd4d4e9460"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/@biomejs/biome/scripts/update-beta-version.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e3e82c4b60d5ec0c8e5854f510dbdcd2b1c7eec51e86c2ab9ed2cc59db689df"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/@biomejs/js-api/scripts/update-beta-version.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f2b2df035c26cb6ab2d6dfe0600fd43e5e72119a8ebda678c1cf871c59beba6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/@biomejs/js-api/scripts/update-preview-version.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c38b713a1080116d4159afae82e803cac0e62752977c5a68dc9146736eaa4ca"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/plugin.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"30ac03d24a69f331c71b95adf3b57748cd81471118c22d814708b121271721ae"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/@biomejs/biome/scripts/update-preview-version.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11ca1335f6edcbd901829b4f1382a92035868bf900a66d1eeb3c384d6d3e83f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/@biomejs/js-api/src/bundler.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e370fbd98c75b8daedb3ceaaf945cf231b926ce705182da69f3e5d905132f4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/prettier-compare/bin/prettier-compare.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e561a91a0663070c52668a3fd70a5b3d278f76d9d66bd1a1bee04e6dadc038a"}},{"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/biome_js_analyze/tests/specs/correctness/noPrivateImports/sub2/default_package_nested.js 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/biome_js_analyze/tests/specs/correctness/noPrivateImports/sub2/default_package_nested.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8f322dad8483021595d1ca191b8455a3d953f176e66eec8c167f0ce63c249b9"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~109 LoC): no import path from any entry point (24 application, 13 tooling, 59 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":"scripts/update-manifests.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6371ecca7f0014570d57508701f5a24155ac4ff771071d6c46d4913efdc72ab6"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~76 LoC): no import path from any entry point (24 application, 13 tooling, 59 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":"packages/tailwindcss-config-analyzer/src/v4/parse-theme-color.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bfecfabfb8b9877f7a3bfd9a70168f50a12dfeee630eee544304d6110ff3e04"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~27 LoC): no import path from any entry point (24 application, 13 tooling, 59 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":"packages/@biomejs/js-api/scripts/update-preview-version.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57746f5d97c55cd8aed988e2c5401900d22d90f50d902e510f3d153303f37156"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027parseDeclarations\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/tailwindcss-config-analyzer/src/v4/css-helpers.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"184060bb22ccfb5365c5900b509ac7962ced42073312e09f22388fd1ada68c0e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027variantOf\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/tailwindcss-config-analyzer/src/v4/theme-namespaces.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cd4e460c5f5a5a76fa5178b5bcb0671dfbc1678db2580a34e0782396e127503"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027prefixOf\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/tailwindcss-config-analyzer/src/v4/theme-namespaces.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"8af9034bd4a5faaa066bcbc940d5b506b1e6fb38f42dc891c4f55750e22bbc01"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: crates/biome_js_analyze/tests/specs/correctness/noPrivateImports/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm 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/biome_js_analyze/tests/specs/correctness/noPrivateImports/package.json"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d4e94366d2c0a7310f0785336d6240f70cc32e5bce3c158dd4d839eff2a395"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: crates/biome_json_analyze/tests/specs/nursery/noRestrictedDependencies/invalid/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm 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/biome_json_analyze/tests/specs/nursery/noRestrictedDependencies/invalid/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d4706e274698997f5104b629b723d3692fc4cdee03d530544728acec0248f4"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: crates/biome_json_analyze/tests/specs/nursery/noRestrictedDependencies/valid/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm 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/biome_json_analyze/tests/specs/nursery/noRestrictedDependencies/valid/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d2f0807813c99dcc7cf6cd39ad19a2595cbd891b4eda5813ea1607b4397dcf"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: crates/biome_json_analyze/tests/specs/source/useSortedPackageJson/already_sorted/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm 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/biome_json_analyze/tests/specs/source/useSortedPackageJson/already_sorted/package.json"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"9242df1596d9082f3989d22cbe2a1d93beaa256116e8daba26d5fe68f39e4634"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: crates/biome_json_analyze/tests/specs/source/useSortedPackageJson/basic/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_json_analyze/tests/specs/source/useSortedPackageJson/basic/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb2ec13cdc4e538cfc28a848edfd30e44844af44df61662abd134d9d56a1221"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: crates/biome_json_analyze/tests/specs/suspicious/noDuplicateDependencies/invalid/dependencies-devDependencies/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm 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/biome_json_analyze/tests/specs/suspicious/noDuplicateDependencies/invalid/dependencies-devDependencies/package.json"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ef41a361774ff2c477f2d82a3dc26f1b0c57179adcdebac5bb5e1211696223"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: crates/biome_json_analyze/tests/specs/suspicious/noDuplicateDependencies/invalid/dependencies-optionalDependencies/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm 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/biome_json_analyze/tests/specs/suspicious/noDuplicateDependencies/invalid/dependencies-optionalDependencies/package.json"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11cbc061356d6cc94e14dab4f4732d01269e683af7bf0eb7e5e44ba35796fbc"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: crates/biome_json_analyze/tests/specs/suspicious/noDuplicateDependencies/invalid/dependencies-peerDependencies/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm 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/biome_json_analyze/tests/specs/suspicious/noDuplicateDependencies/invalid/dependencies-peerDependencies/package.json"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d3abd64ee149e011d5663ab8f5dc2bc9f20d41f35a39950c4129594b797cc3f"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: crates/biome_json_analyze/tests/specs/suspicious/noDuplicateDependencies/invalid/dependencies/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_json_analyze/tests/specs/suspicious/noDuplicateDependencies/invalid/dependencies/package.json"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"e907481c8b3a1f0809dfb0bb4b8fc9ca22d1ef4d535ad704d191b329a8b1f899"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: crates/biome_json_analyze/tests/specs/suspicious/noDuplicateDependencies/invalid/optionalDependencies-peerDependencies/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm 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/biome_json_analyze/tests/specs/suspicious/noDuplicateDependencies/invalid/optionalDependencies-peerDependencies/package.json"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"504ac466b97e23b98d4d810af4e7de94677414b1ff2de28c976cdf89f7d4982f"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: crates/biome_json_analyze/tests/specs/suspicious/noDuplicateDependencies/valid/optionalDependencies-devDependencies/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm 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/biome_json_analyze/tests/specs/suspicious/noDuplicateDependencies/valid/optionalDependencies-devDependencies/package.json"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc30a3f3d39d14ff54174d74df70cd591186807a439530b09af68faf2af77d23"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: crates/biome_json_analyze/tests/specs/suspicious/noDuplicateDependencies/valid/peerDependencies-devDependencies/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm 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/biome_json_analyze/tests/specs/suspicious/noDuplicateDependencies/valid/peerDependencies-devDependencies/package.json"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"e447d44cf9072b5c2247f7d3f525315c72176121bd8d5be12780520bb737fc02"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: crates/biome_json_analyze/tests/specs/suspicious/noUntrustedLicenses/allow_option/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm 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/biome_json_analyze/tests/specs/suspicious/noUntrustedLicenses/allow_option/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b58b8b349a562e12d3d9c0b097e76d049b7e4d7e24eb12b4aa6f1a821b49f2c"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: crates/biome_json_analyze/tests/specs/suspicious/noUntrustedLicenses/deny_option/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm 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/biome_json_analyze/tests/specs/suspicious/noUntrustedLicenses/deny_option/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"949c474f1414944fb975ee1df23117bef8995558b78558a6fa869efea24dc545"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: crates/biome_json_analyze/tests/specs/suspicious/noUntrustedLicenses/deprecated_license/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm 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/biome_json_analyze/tests/specs/suspicious/noUntrustedLicenses/deprecated_license/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a53d7c668d90f5ff2f9b5fbe8418a8f3c198019afe341e58d2435bf2ea853e"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: crates/biome_json_analyze/tests/specs/suspicious/noUntrustedLicenses/fsf_required/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm 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/biome_json_analyze/tests/specs/suspicious/noUntrustedLicenses/fsf_required/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"21263120b8c991d832e2b40b7613ab00db2cd246ee24e1dac63d39d38a4917b7"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: crates/biome_json_analyze/tests/specs/suspicious/noUntrustedLicenses/ignore_deprecated/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm 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/biome_json_analyze/tests/specs/suspicious/noUntrustedLicenses/ignore_deprecated/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b78a86ebb48691ff25a1c4060fbeaf5f71dc4201f7fbd2006dd8683170da5a"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: crates/biome_json_analyze/tests/specs/suspicious/noUntrustedLicenses/invalid/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm 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/biome_json_analyze/tests/specs/suspicious/noUntrustedLicenses/invalid/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c39214b110949fbb22cbdd8cba15e92c9c884a6b55cff0b763fea74700bed5d"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: crates/biome_json_analyze/tests/specs/suspicious/noUntrustedLicenses/osi_required/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm 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/biome_json_analyze/tests/specs/suspicious/noUntrustedLicenses/osi_required/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aef2dcdb5f9a6a832ea9204791351c11d3dab9b3911f386b4f69decfd98d04e"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: crates/biome_json_analyze/tests/specs/suspicious/noUntrustedLicenses/valid/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm 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/biome_json_analyze/tests/specs/suspicious/noUntrustedLicenses/valid/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"787b4e981cebc229b040845705c741b8648ac7a0f3fe4f7295c426e48f4e782f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof process.env.GITHUB_SHA !== \u0022string\u0022 || process.env.GITHUB_SHA === \u0022\u0022\u0060 appears character-identically in 4 files \u2014 packages/@biomejs/biome/scripts/update-beta-version.mjs, packages/@biomejs/biome/scripts/update-preview-version.mjs, packages/@biomejs/js-api/scripts/update-beta-version.mjs, packages/@biomejs/js-api/scripts/update-preview-version.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/@biomejs/biome/scripts/update-beta-version.mjs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42e4c950d98a9f1557a23512225ba7b72575636273f87d63ac068117e319b42"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof version !== \u0022string\u0022 || version === \u0022\u0022\u0060 appears character-identically in 2 files \u2014 packages/@biomejs/biome/scripts/update-beta-version.mjs, packages/@biomejs/js-api/scripts/update-beta-version.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/@biomejs/biome/scripts/update-beta-version.mjs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5062480be9a74254704c6502f79cff9b3bd9f65f7a2a7557fcec016489de231"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!CssSyntaxFeatures::Scss.is_supported(p) \u0026\u0026 is_legacy_ie_filter_property \u0026\u0026 is_at_legacy_ie_filter_value(p)\u0060 appears character-identically in 2 files \u2014 crates/biome_css_parser/src/syntax/at_rule/supports/mod.rs, crates/biome_css_parser/src/syntax/property/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_parser/src/syntax/at_rule/supports/mod.rs"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"a161b7f3bfdcd7d3b90b71e0437a118834be9ae1995a7224f199329327e30dee"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!embedding_kind.is_vue() || !embedding_kind.is_class_attribute()\u0060 appears character-identically in 2 files \u2014 crates/biome_js_analyze/src/lint/nursery/no_vue_multiple_objects_in_class.rs, crates/biome_js_analyze/src/lint/nursery/use_vue_separate_static_class.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/biome_js_analyze/src/lint/nursery/no_vue_multiple_objects_in_class.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"60cd106a1a14bbbd7a01ac10ff94401dd846f96e30402641d412264565893e6b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!execution.is_ci() \u0026\u0026 summary.diagnostics_not_printed \u003E 0\u0060 appears character-identically in 2 files \u2014 crates/biome_cli/src/reporter/summary.rs, crates/biome_cli/src/reporter/terminal.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/biome_cli/src/reporter/summary.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"9923618b4f4cde381cc2cdc0068ca2da86a59be80da97738f281b9204621fb44"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!file_features.supports_lint() \u0026\u0026 !file_features.supports_assist()\u0060 appears character-identically in 2 files \u2014 crates/biome_lsp/src/handlers/analysis.rs, crates/biome_lsp/src/session.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/biome_lsp/src/handlers/analysis.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"67bef98ec4e1015a2f93acde8f65dc0a22ce22136aedd462e6aa51b1afd8d6f9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!has_alt \u0026\u0026 !has_aria_label \u0026\u0026 !has_aria_labelledby \u0026\u0026 !aria_hidden\u0060 appears character-identically in 2 files \u2014 crates/biome_html_analyze/src/lint/a11y/use_alt_text.rs, crates/biome_js_analyze/src/lint/a11y/use_alt_text.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/biome_html_analyze/src/lint/a11y/use_alt_text.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea80dbe1bb7f727be940bea4aabed977f4a353f6e30fa8b7e8ef0ce3d1c7d5a8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!has_event_handler(EVENT_HANDLER_TYPES, element) || is_content_editable(element) || aria_roles.is_presentation_role(element) || is_hidden_fr\u2026\u0060 appears character-identically in 2 files \u2014 crates/biome_html_analyze/src/lint/a11y/no_noninteractive_element_interactions.rs, crates/biome_js_analyze/src/lint/a11y/no_noninteractive_element_interactions.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/biome_html_analyze/src/lint/a11y/no_noninteractive_element_interactions.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"11452199547d858659fd5b4dd08226f260b51cd92234840529a2a98348ee86fe"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!has_title \u0026\u0026 !has_aria_label \u0026\u0026 !has_aria_labelledby \u0026\u0026 !aria_hidden\u0060 appears character-identically in 2 files \u2014 crates/biome_html_analyze/src/lint/a11y/use_alt_text.rs, crates/biome_js_analyze/src/lint/a11y/use_alt_text.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/biome_html_analyze/src/lint/a11y/use_alt_text.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3863ed10b0ed354f8c828468add482423c95f132fabb1f38ca407880abcd921"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!is_valid_script(script_or_country) \u0026\u0026 !is_valid_country(script_or_country)\u0060 appears character-identically in 2 files \u2014 crates/biome_html_analyze/src/lint/a11y/use_valid_lang.rs, crates/biome_js_analyze/src/lint/a11y/use_valid_lang.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/biome_html_analyze/src/lint/a11y/use_valid_lang.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"519abe7a60a80f0e29c88a2167a55e0e7e1d0ccd061e77bb5948fb6667c1637f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!p.has_preceding_whitespace() \u0026\u0026 !p.has_preceding_line_break()\u0060 appears character-identically in 2 files \u2014 crates/biome_css_parser/src/syntax/scss/expression/precedence.rs, crates/biome_css_parser/src/syntax/scss/value/any.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/biome_css_parser/src/syntax/scss/expression/precedence.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"bff23a2304de6895dddc6def5d6660699d00ccbf318e818cfff94ba1c3012454"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!reference.is_global_this() \u0026\u0026 !reference.has_name(\u0022window\u0022)\u0060 appears character-identically in 4 files \u2014 crates/biome_js_analyze/src/lint/complexity/use_regex_literals.rs, crates/biome_js_analyze/src/lint/nursery/use_global_regex_in_replace_all.rs, crates/biome_js_analyze/src/lint/style/use_named_capture_group.rs, crates/biome_js_analyze/src/lint/style/use_unicode_regex.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/biome_js_analyze/src/lint/complexity/use_regex_literals.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe4b3e47da6b25580c79636f1ec96ced91019baa742b015482cbc5208007ac0e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!self.migrated.is_empty() \u0026\u0026 self.migrated.len() != self.rule_count()\u0060 appears character-identically in 2 files \u2014 crates/biome_cli/src/execute/migrate/eslint_to_biome.rs, crates/biome_cli/src/execute/migrate/stylelint_to_biome.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/biome_cli/src/execute/migrate/eslint_to_biome.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"de829099f803f8b4bd0823812af649d60b5a17c2bccf62e7d2bc5a67a3f93331"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!source_type.is_typescript() || source_type.is_definition_file()\u0060 appears character-identically in 3 files \u2014 crates/biome_js_analyze/src/lint/nursery/use_explicit_return_type.rs, crates/biome_js_analyze/src/lint/nursery/use_explicit_type.rs, crates/biome_js_analyze/src/lint/suspicious/no_evolving_types.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/nursery/use_explicit_return_type.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"7276ee53714e6da058c98b27e8186980f0330fc222605408aa8ccb4c10b02db4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!source_type.language().is_typescript() || source_type.language().is_definition_file()\u0060 appears character-identically in 2 files \u2014 crates/biome_js_analyze/src/lint/style/use_export_type.rs, crates/biome_js_analyze/src/lint/style/use_import_type.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/biome_js_analyze/src/lint/style/use_export_type.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"918ff846e68a60fe09ac4603fd4d8e65e407e7140adb19c994c0da2dd1b59238"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(!field.is_unordered() || last_was_ordered) \u0026\u0026 !current_group.is_empty()\u0060 appears character-identically in 2 files \u2014 crates/biome_syntax_codegen/src/generate_nodes.rs, xtask/codegen/src/generate_nodes.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/biome_syntax_codegen/src/generate_nodes.rs"},"region":{"startLine":1141}}}],"partialFingerprints":{"codehealthFindingId/v1":"e916c14b8111dcc8344d64b2f48b9cfd82240b84032727b56da16ae98b384101"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(!keeps_leading \u0026\u0026 token.has_leading_comments()) || (!keeps_trailing \u0026\u0026 token.has_trailing_comments())\u0060 appears character-identically in 3 files \u2014 crates/biome_js_analyze/src/lint/nursery/no_single_promise_in_promise_methods.rs, crates/biome_js_analyze/src/lint/nursery/no_subtraction_comparison.rs, crates/biome_js_analyze/src/lint/nursery/no_svelte_useless_derived_by.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/biome_js_analyze/src/lint/nursery/no_single_promise_in_promise_methods.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4e889acc14d3d08e739c4ba5971af98a89ff9cc66421076466671eca677b008"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(is_cjk_segment_break_character(before) \u0026\u0026 is_cjk_segment_break_character(after)) || is_cjk_punctuation(before) || is_cjk_punctuation(after)\u0060 appears character-identically in 2 files \u2014 crates/biome_html_formatter/src/utils/children.rs, crates/biome_markdown_formatter/src/words.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/biome_html_formatter/src/utils/children.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"c340c5bb6d92a231692022ba95d045f60eed96382ffc72ad04297357355bae6c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(self.allow_empty() || !first) \u0026\u0026 (p.at(\u003CSelf::Parser\u003C\u0027_\u003E as Parser\u003E::Kind::EOF) || self.is_at_list_end(p))\u0060 appears character-identically in 2 files \u2014 crates/biome_parser/src/parse_lists.rs, crates/biome_tailwind_parser/src/syntax/variant.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/biome_parser/src/parse_lists.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"d417b108aaad8f2ac382b8b87200cbee0e8a016e743fafdd6947ad5fbb076a94"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060AnyCssPseudoClassFunctionSelector::cast(node) \u0026\u0026 pseudo_fn.is_global_pseudo()\u0060 appears character-identically in 2 files \u2014 crates/biome_module_graph/src/css_module_info/visitor.rs, crates/biome_module_graph/src/html_module_info/visitor.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/biome_module_graph/src/css_module_info/visitor.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd40ca9423102f6d14db357c04edfcf9379752f13e0830b87904ffcb4e13790"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060CssSyntaxFeatures::Scss.is_supported(p) \u0026\u0026 is_at_scss_nesting_declaration(p)\u0060 appears character-identically in 2 files \u2014 crates/biome_css_parser/src/syntax/block/declaration_or_rule_list_block.rs, crates/biome_css_parser/src/syntax/declaration.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/biome_css_parser/src/syntax/block/declaration_or_rule_list_block.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc5bb289d4d60acba027a8bbe8349d228fcdc2b121d1d0c81e3b79d8109b075"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060CssSyntaxFeatures::Scss.is_supported(p) \u0026\u0026 is_custom_property\u0060 appears character-identically in 2 files \u2014 crates/biome_css_parser/src/syntax/at_rule/supports/mod.rs, crates/biome_css_parser/src/syntax/property/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_parser/src/syntax/at_rule/supports/mod.rs"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"11376573c04cb9e462f82424b6c3c0a5db08093e3e01c81afaa28065cee1677e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Self::can_merge(self, other) || Self::can_merge(other, self)\u0060 appears character-identically in 2 files \u2014 crates/biome_js_parser/src/state.rs, crates/biome_js_syntax/src/binding_ext.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/biome_js_parser/src/state.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8131615cbf96ba78500387ee123dd9389d59d666314032446136a816d7dfd1c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060autocompletes.len() == 1 \u0026\u0026 autocompletes[0] == \u0022none\u0022\u0060 appears character-identically in 2 files \u2014 crates/biome_html_analyze/src/lint/a11y/use_valid_autocomplete.rs, crates/biome_js_analyze/src/lint/a11y/use_valid_autocomplete.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/biome_html_analyze/src/lint/a11y/use_valid_autocomplete.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"de9a9f4e65cd9fdb7c80e8967f057df457d606b5b15ca9c4cd731ddda15e8a5f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060block.is_newline() || block.is_continuation_indent()\u0060 appears character-identically in 2 files \u2014 crates/biome_markdown_analyze/src/lint/suspicious/no_empty_source.rs, crates/biome_markdown_formatter/src/bullet_list.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/biome_markdown_analyze/src/lint/suspicious/no_empty_source.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"297cf9de27b06c4fd0fe49e62134df8496110a0e2d4cfc7f17ebdf19c665e4e5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060byte.is_ascii_alphabetic() || byte == b\u0027_\u0027\u0060 appears character-identically in 3 files \u2014 crates/biome_graphql_parser/src/lexer/mod.rs, crates/biome_grit_parser/src/lexer/mod.rs, crates/biome_html_parser/src/lexer/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_graphql_parser/src/lexer/mod.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"8690299e10ff16fc632d0141ada2857ae7f43f321caa5213f14899c93a5c57a8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060byte.is_ascii_alphanumeric() || byte == b\u0027_\u0027\u0060 appears character-identically in 3 files \u2014 crates/biome_graphql_parser/src/lexer/mod.rs, crates/biome_grit_parser/src/lexer/mod.rs, crates/biome_html_parser/src/lexer/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_graphql_parser/src/lexer/mod.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"977594a1bbc9db428f68d5473dae44fad67a12de5fc4386102f3e9c94fa15785"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060call.is_optional_chain() || call.type_arguments().is_some()\u0060 appears character-identically in 2 files \u2014 crates/biome_js_analyze/src/lint/nursery/no_negated_array_predicate.rs, crates/biome_module_graph/src/js_module_info/flow/guards.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/biome_js_analyze/src/lint/nursery/no_negated_array_predicate.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2e9eb45c1164cea8af1bd04d5efa9552a242f6f187b75cd98ae7c2d135a6b4e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060callee.operator_token().ok()?.kind() != T![.] || callee .member() .ok()\u0060 appears character-identically in 2 files \u2014 crates/biome_js_analyze/src/lint/nursery/use_iterator_zip.rs, crates/biome_js_analyze/src/lint/nursery/use_set_size.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/biome_js_analyze/src/lint/nursery/use_iterator_zip.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"213d39ba8e028e2d0a33be96430cee1ff4faf2aed261467af0390d7a9477a444"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060comment_start \u003E= colon.text_trimmed_range().end() \u0026\u0026 comment_start \u003C value_start\u0060 appears character-identically in 2 files \u2014 crates/biome_css_formatter/src/comments.rs, crates/biome_css_formatter/src/scss/auxiliary/variable_declaration.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/biome_css_formatter/src/comments.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d028294bf29699db6773026932b33f6a0e4dfda1eeb7774f95d78d60192d4e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060conditional != ConditionalType::Unknown \u0026\u0026 !conditional.is_mergeable()\u0060 appears character-identically in 2 files \u2014 crates/biome_js_type_info/src/inferred_type.rs, crates/biome_module_graph/src/db/type_inference/expressions.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/biome_js_type_info/src/inferred_type.rs"},"region":{"startLine":1631}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e464535fddf76e17e315050019b88303eece00fbb1cec73dbbcf2f4c2a2136c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ctx.is_dependency(module_name_text) || ctx.is_dev_dependency(module_name_text) || ctx.is_peer_dependency(module_name_text) || ctx.is_optiona\u2026\u0060 appears character-identically in 2 files \u2014 crates/biome_js_analyze/src/lint/correctness/no_nodejs_modules.rs, crates/biome_js_analyze/src/lint/nursery/no_bun_modules.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/biome_js_analyze/src/lint/correctness/no_nodejs_modules.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"006668b72e6bba8a6ef0a1ff6392ad4bcd7c7062b0632d206f44a889fc86f21b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ctx.jsx_factory() \u0026\u0026 is_jsx_factory_import(binding, jsx_factory)\u0060 appears character-identically in 2 files \u2014 crates/biome_js_analyze/src/lint/correctness/no_unused_imports.rs, crates/biome_js_analyze/src/lint/style/use_import_type.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/biome_js_analyze/src/lint/correctness/no_unused_imports.rs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"de5321b2a6fafb5cc8c536cc7c12e20e5609a1ba23a1d25a9573bf5a661985d9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ctx.jsx_fragment_factory() \u0026\u0026 is_jsx_factory_import(binding, jsx_fragment_factory)\u0060 appears character-identically in 2 files \u2014 crates/biome_js_analyze/src/lint/correctness/no_unused_imports.rs, crates/biome_js_analyze/src/lint/style/use_import_type.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/biome_js_analyze/src/lint/correctness/no_unused_imports.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b3ba4a17c61501d3ffa5867d549bb6530ce03cbe47a6fdd54630ef3c821a56"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ctx.options().allow_comments() \u0026\u0026 (node.syntax().has_comments_direct() || node.eof_token().ok()?.has_leading_comments())\u0060 appears character-identically in 3 files \u2014 crates/biome_css_analyze/src/lint/suspicious/no_empty_source.rs, crates/biome_graphql_analyze/src/lint/suspicious/no_empty_source.rs, crates/biome_js_analyze/src/lint/suspicious/no_empty_source.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/biome_css_analyze/src/lint/suspicious/no_empty_source.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"a313789e79a0b4b5218030a949ba64fc581855d210cdfeff2c6b21bb9653b063"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060diagnostic.tags().is_verbose() \u0026\u0026 verbose\u0060 appears character-identically in 2 files \u2014 crates/biome_cli/src/commands/mod.rs, crates/biome_cli/src/reporter/terminal.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/biome_cli/src/commands/mod.rs"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b0cf8e11ac147a2709e9a05baf922a08afda661b538ad93cf36b44cfc28d05"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060directive.is_binding() \u0026\u0026 !has_static_name\u0060 appears character-identically in 2 files \u2014 crates/biome_html_analyze/src/lint/nursery/no_disabled_attribute.rs, crates/biome_html_analyze/src/lint/nursery/no_invalid_file_input_accept.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/biome_html_analyze/src/lint/nursery/no_disabled_attribute.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"031042468324b05b25d71629666ae7d3d9c080951b915d18937b2f39095da67f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060directive_empty \u0026\u0026 implements_interface_empty \u0026\u0026 fields_definition_empty\u0060 appears character-identically in 2 files \u2014 crates/biome_graphql_parser/src/parser/definitions/interface.rs, crates/biome_graphql_parser/src/parser/definitions/object.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/biome_graphql_parser/src/parser/definitions/interface.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"824ff288549e113c8c4a90a0641d938cd8450c0f59363e8e86169f107c70fc6d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060dispatched == MIN || is_delimiter(dispatched)\u0060 appears character-identically in 2 files \u2014 crates/biome_tailwind_parser/src/lexer/base_name_store.rs, crates/biome_tailwind_parser/src/lexer/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_tailwind_parser/src/lexer/base_name_store.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e86ece330b6b1fe1eea3359a1fc5aca7dd11e467b8040a38a9f58077bf5a94"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060eat_or_recover_selector_function_close_token(p, list, expected_selector) \u0026\u0026 !list_range.is_empty()\u0060 appears character-identically in 2 files \u2014 crates/biome_css_parser/src/syntax/selector/pseudo_class/function_selector.rs, crates/biome_css_parser/src/syntax/selector/pseudo_class/function_selector_list.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/biome_css_parser/src/syntax/selector/pseudo_class/function_selector.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"63925c66b9343496943d59c0a61e692fa463eb0987fc58ab3643fc6edf80df47"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060entry_key.is_flow_collection() || f.comments().has_trailing_comments(entry_key.syntax())\u0060 appears character-identically in 2 files \u2014 crates/biome_yaml_formatter/src/yaml/auxiliary/flow_map_explicit_entry.rs, crates/biome_yaml_formatter/src/yaml/auxiliary/flow_map_implicit_entry.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/biome_yaml_formatter/src/yaml/auxiliary/flow_map_explicit_entry.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf018978626ff0e9af00988c8f2345e8c6445cd534d4c0db399b4838d0099a34"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060execution.is_check() \u0026\u0026 summary.suggested_fixes_skipped \u003E 0\u0060 appears character-identically in 2 files \u2014 crates/biome_cli/src/reporter/summary.rs, crates/biome_cli/src/reporter/terminal.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/biome_cli/src/reporter/summary.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe9daefa776b6efc068f40a4fc49c936912ad8d903e6baa3e289a751204b137"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060existing.source_kind.is_inspired() \u0026\u0026 !kind.is_inspired()\u0060 appears character-identically in 2 files \u2014 xtask/codegen/src/generate_migrate_eslint.rs, xtask/codegen/src/generate_migrate_stylelint.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":"xtask/codegen/src/generate_migrate_eslint.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f6ec3619191604ce29158aaaa2fedb60b9d3d392fc269a79b5a765ccad03798"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060f.comments().has_comments(argument.syntax()) \u0026\u0026 !f.comments().is_suppressed(argument.syntax())\u0060 appears character-identically in 2 files \u2014 crates/biome_js_formatter/src/js/expressions/unary_expression.rs, crates/biome_js_formatter/src/jsx/attribute/spread_attribute.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/biome_js_formatter/src/js/expressions/unary_expression.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff4dae7b4f2346cd1c1ae0718d97636c2093a9bdb5bd8fe8f36951c79360378d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060features.supports_lint() || features.supports_assist() || features.supports_format()\u0060 appears character-identically in 2 files \u2014 crates/biome_cli/src/commands/check.rs, crates/biome_cli/src/commands/ci.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/biome_cli/src/commands/check.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"6953f9450092f5fa723aaa78a6a7efb575e3288f59b304784ad2c31febb0b6ed"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fence_char != \u0027\u0060\u0027 || !info_string_has_backtick(rest, fence_len)\u0060 appears character-identically in 2 files \u2014 crates/biome_markdown_parser/src/syntax/fenced_code_block.rs, crates/biome_markdown_parser/src/syntax/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/fenced_code_block.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"96945e0565d3ed192779653630045c39ab7b99606b75c66f67b70aee038ad701"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060file_name == ConfigName::biome_json() || file_name == ConfigName::biome_jsonc()\u0060 appears character-identically in 3 files \u2014 crates/biome_fs/src/path.rs, crates/biome_service/src/projects.rs, crates/biome_service/src/workspace/server.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/biome_fs/src/path.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"995747df8c9c9bfbfe9fc0d33787606eeee37acc0856ff8391d853f95416c283"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060function.async_token().is_some() || function.star_token().is_some()\u0060 appears character-identically in 4 files \u2014 crates/biome_js_analyze/src/lint/complexity/use_index_of.rs, crates/biome_js_analyze/src/lint/nursery/no_array_sort_for_min_max.rs, crates/biome_js_analyze/src/lint/suspicious/no_loop_func.rs, crates/biome_js_analyze/src/lint/suspicious/use_iterable_callback_return.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/biome_js_analyze/src/lint/complexity/use_index_of.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb620e8a4cc23531a84c60e7782fe92680e255a4fed86fb9cedda927eb2ff773"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060function.is_async() || function.is_generator()\u0060 appears character-identically in 2 files \u2014 crates/biome_js_analyze/src/lint/nursery/no_boolean_sort_comparator.rs, crates/biome_js_analyze/src/lint/nursery/no_vue_ref_object_reactivity_loss.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/biome_js_analyze/src/lint/nursery/no_boolean_sort_comparator.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"1535219665991691c9e6a0d6df1de7d0bb91caa3fb4968a53e757ca8b70b9bcf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060has_text_content \u0026\u0026 has_control_association\u0060 appears character-identically in 2 files \u2014 crates/biome_html_analyze/src/lint/a11y/no_label_without_control.rs, crates/biome_js_analyze/src/lint/a11y/no_label_without_control.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/biome_html_analyze/src/lint/a11y/no_label_without_control.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7788f96698d8683916630ae4d66b3ab653a8ee8c87264160802ba4023456a35"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060input_type.contains(\u0027\u0026\u0027) || !input_type.eq_ignore_ascii_case(\u0022file\u0022)\u0060 appears character-identically in 2 files \u2014 crates/biome_html_analyze/src/lint/nursery/no_invalid_file_input_accept.rs, crates/biome_js_analyze/src/lint/nursery/no_invalid_file_input_accept.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/biome_html_analyze/src/lint/nursery/no_invalid_file_input_accept.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3601158c39d52ce89eca01b971057759a3f629980d068da8f076b0781058738"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060instance.ty(db) \u0026\u0026 !declaration.type_parameters(db).is_empty()\u0060 appears character-identically in 2 files \u2014 crates/biome_js_type_info/src/type_relation.rs, crates/biome_js_type_info/src/type_transform.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/biome_js_type_info/src/type_relation.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ddbbce251a322351a8ed4e21588171d690a6762b3ddfd9de998dbf4b0ee79ab"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_at_flow_yaml_node(p) || !property_empty\u0060 appears character-identically in 2 files \u2014 crates/biome_yaml_parser/src/parser/block.rs, crates/biome_yaml_parser/src/parser/flow.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/biome_yaml_parser/src/parser/block.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbbfe7e8b74ebc477a731040c79fae3c0a41fe61c4240ae584bfb3ed6d6bef55"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_at_scss_interpolation(p) || is_at_identifier(p) \u0026\u0026 is_nth_at_scss_interpolation(p, 1) \u0026\u0026 !p.has_nth_preceding_whitespace(1)\u0060 appears character-identically in 3 files \u2014 crates/biome_css_parser/src/syntax/at_rule/feature.rs, crates/biome_css_parser/src/syntax/scss/selector/attribute.rs, crates/biome_css_parser/src/syntax/selector/pseudo_class/function_value_list.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/biome_css_parser/src/syntax/at_rule/feature.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c28f129d965c292fabdd8fe802dfe6c1df419036741081082cb9fb80cd3f9ea"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_at_url_function(p) || is_at_string(p)\u0060 appears character-identically in 2 files \u2014 crates/biome_css_parser/src/syntax/at_rule/import.rs, crates/biome_css_parser/src/syntax/at_rule/namespace.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/biome_css_parser/src/syntax/at_rule/import.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"861fbc04fbfeb7b999e2bd186d7a4638bf08a5f6d40fe1f08d5fe1e3f7471b45"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_describe_call(call) || is_unit_test(call) || LifecycleHook::from_call_expression(call).is_some()\u0060 appears character-identically in 2 files \u2014 crates/biome_js_analyze/src/lint/style/use_test_hooks_in_order.rs, crates/biome_js_analyze/src/lint/style/use_test_hooks_on_top.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/biome_js_analyze/src/lint/style/use_test_hooks_in_order.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aac55e33ce563ac3b95d2c16dd1e31eed7f3eef852198df81afbbe497231a56"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_hidden_from_screen_reader(element) || aria_roles.is_presentation_role(element)\u0060 appears character-identically in 2 files \u2014 crates/biome_html_analyze/src/lint/a11y/use_key_with_click_events.rs, crates/biome_js_analyze/src/lint/a11y/use_key_with_click_events.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/biome_html_analyze/src/lint/a11y/use_key_with_click_events.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"572d8236e42ae8d0ef9afa5775356208cb8d8f1a0cd540318975bd548c8b5183"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_language_global(name) || is_web_global(name) || is_node_global(name)\u0060 appears character-identically in 2 files \u2014 crates/biome_js_analyze/src/globals/javascript/mod.rs, crates/biome_js_analyze/src/globals/typescript/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/globals/javascript/mod.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"8640b745b226494647d3f734f3699e9209d33a37fa91b8176380af17c98e9168"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_nth_at_identifier(p, 0) \u0026\u0026 is_nth_at_scss_interpolation(p, 1) \u0026\u0026 !p.has_nth_preceding_whitespace(1)\u0060 appears character-identically in 2 files \u2014 crates/biome_css_parser/src/syntax/scss/at_rule/keyframes.rs, crates/biome_css_parser/src/syntax/scss/value/interpolated_value.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/biome_css_parser/src/syntax/scss/at_rule/keyframes.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e714eff0b372bf0ebd8fb7db48a8b69a87f4dc0340b0823fc14e82aa2556eea"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_partial_combinator_nesting_allowed \u0026\u0026 is_at_scss_partial_combinator_selector(p)\u0060 appears character-identically in 2 files \u2014 crates/biome_css_parser/src/syntax/selector/mod.rs, crates/biome_css_parser/src/syntax/selector/relative_selector.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/biome_css_parser/src/syntax/selector/mod.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5296f4905ada6d0c4a39e11e8d7482fba00369ea308e2ce9458ceedd63ffe51"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_type_assertion(syntax) || is_variable_declarator_with_type_annotation(syntax) || is_default_function_parameter_with_type_annotation(synta\u2026\u0060 appears character-identically in 2 files \u2014 crates/biome_js_analyze/src/lint/nursery/use_explicit_return_type.rs, crates/biome_js_analyze/src/lint/nursery/use_explicit_type.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/biome_js_analyze/src/lint/nursery/use_explicit_return_type.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"057fab458484ea3c2e6ab5d69ed7719ce036c99f78e703af107ae0ff7d6ce51e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060label == \u0022$\u0022 \u0026\u0026 ctx .source_type::\u003CJsFileSource\u003E() .as_embedding_kind() .is_svelte()\u0060 appears character-identically in 2 files \u2014 crates/biome_js_analyze/src/lint/correctness/no_unused_labels.rs, crates/biome_js_analyze/src/lint/suspicious/no_confusing_labels.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/biome_js_analyze/src/lint/correctness/no_unused_labels.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d20f87abc2cc81152953a7f962ab846838e43e66e7c02174ed71152650a0887"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060matches!(block_start_dispatch, Some(IDT)) \u0026\u0026 block_start_byte == Some(b\u0027_\u0027)\u0060 appears character-identically in 2 files \u2014 crates/biome_markdown_parser/src/syntax/list.rs, crates/biome_markdown_parser/src/syntax/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":2220}}}],"partialFingerprints":{"codehealthFindingId/v1":"864d9048995e1e5abbbdba7cb2cab15326a69734c9ef9771e6d60f5f5d008b21"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060member.is_optional() || member .member() .ok()\u0060 appears character-identically in 3 files \u2014 crates/biome_js_analyze/src/lint/nursery/no_array_sort_for_min_max.rs, crates/biome_js_analyze/src/lint/nursery/no_useless_splice.rs, crates/biome_js_analyze/src/lint/nursery/use_object_from_entries.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/biome_js_analyze/src/lint/nursery/no_array_sort_for_min_max.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc618b8b73e1aff2e9eabab732743d9f9d35a2478eb75e97264a81eb89cbd79"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060member.is_optional_chain() || member .member() .ok()\u0060 appears character-identically in 2 files \u2014 crates/biome_js_analyze/src/lint/nursery/no_useless_date_get_time.rs, crates/biome_js_analyze/src/lint/nursery/no_useless_length_check.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/biome_js_analyze/src/lint/nursery/no_useless_date_get_time.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee81edc2a96d50d56457db425ecd5363bdd67292ba4d582a61310d78c346a07"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060n != node || !separator_matches_trailing\u0060 appears character-identically in 2 files \u2014 crates/biome_syntax_codegen/src/ast.rs, xtask/codegen/src/ast.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/biome_syntax_codegen/src/ast.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b2df881af60344bca96ff18777bb2900851f3174b6fadcc14ce0a755e828fb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060name.starts_with(\u0022AnyCss\u0022) \u0026\u0026 name.ends_with(\u0022PropertyValue\u0022)\u0060 appears character-identically in 2 files \u2014 crates/biome_syntax_codegen/src/ast.rs, xtask/codegen/src/ast.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/biome_syntax_codegen/src/ast.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ed510b738ec023f70ebd19bbba4ba600f66c61c9a9a216065b81fd2af4e010"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060name.trim().starts_with(\u0022AnyCss\u0022) \u0026\u0026 name.trim().ends_with(\u0022PropertyValue\u0022)\u0060 appears character-identically in 2 files \u2014 crates/biome_syntax_codegen/src/ast.rs, xtask/codegen/src/ast.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/biome_syntax_codegen/src/ast.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1b758598c332791cb9199863bfe4046b5a588563eb1c5d32fe6e3395882626f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060name.value_token() \u0026\u0026 token.text_trimmed() == \u0022expect\u0022\u0060 appears character-identically in 3 files \u2014 crates/biome_js_analyze/src/frameworks/playwright.rs, crates/biome_js_analyze/src/lint/complexity/no_playwright_useless_await.rs, crates/biome_js_analyze/src/lint/correctness/no_playwright_missing_await.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/biome_js_analyze/src/frameworks/playwright.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"d25cedb5c2853ab5b8209dc6a3202b31822277447c16fe395e2f86d4e4f64a76"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060name_text != \u0022className\u0022 \u0026\u0026 name_text != \u0022class\u0022\u0060 appears character-identically in 2 files \u2014 crates/biome_js_analyze/src/lint/nursery/no_undeclared_classes.rs, crates/biome_service/src/file_handlers/javascript/go_to.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/biome_js_analyze/src/lint/nursery/no_undeclared_classes.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"c442599eea3eb472e509c79b5b77a4692f415b3892ce23468f4b590200a9e47a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.is_custom_component() || node.is_custom_element()\u0060 appears character-identically in 2 files \u2014 crates/biome_js_analyze/src/lint/a11y/no_static_element_interactions.rs, crates/biome_js_analyze/src/lint/a11y/use_semantic_elements.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/biome_js_analyze/src/lint/a11y/no_static_element_interactions.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c3cc46dd6d3042973c487d68171fb28f065b4341b93176ec5f7cd2cd09b604"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060object.has_unknown_members(db) || object.prototype(db).is_some()\u0060 appears character-identically in 2 files \u2014 crates/biome_js_type_info/src/builders.rs, crates/biome_js_type_info/src/type_operations.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/biome_js_type_info/src/builders.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"320c99a7891ec4e448395545537467c9797e5642c5cf69ecf7ceb12218d21c80"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060offset \u003C range.start() || offset \u003E range.end()\u0060 appears character-identically in 5 files \u2014 crates/biome_service/src/file_handlers/css.rs, crates/biome_service/src/file_handlers/graphql.rs, crates/biome_service/src/file_handlers/grit.rs, crates/biome_service/src/file_handlers/javascript.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/biome_service/src/file_handlers/css.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"23424e4f7bc278f249616be4201590a2e86b60f039a592b0c669174bb501550d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060opts.rename.is_none() \u0026\u0026 path.is_ident(\u0022rename\u0022)\u0060 appears character-identically in 2 files \u2014 crates/biome_deserialize_macros/src/deserializable_derive/enum_variant_attrs.rs, crates/biome_deserialize_macros/src/deserializable_derive/struct_field_attrs.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/biome_deserialize_macros/src/deserializable_derive/enum_variant_attrs.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"45998816ff92c72a9588a36885789455bb4384a7541f199e7a6e16eeb6775b57"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060p.at(DOUBLE_STAR) || p.at(DOUBLE_UNDERSCORE)\u0060 appears character-identically in 2 files \u2014 crates/biome_markdown_parser/src/syntax/inline/emphasis.rs, crates/biome_markdown_parser/src/syntax/inline/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/inline/emphasis.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9212d09ebf44a321dce88738360ee01a2c057818075d9b2cb63f32d34ffdb29"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060p.at(MD_TEXTUAL_LITERAL) \u0026\u0026 is_whitespace_only(p.cur_text())\u0060 appears character-identically in 4 files \u2014 crates/biome_markdown_parser/src/syntax/fenced_code_block.rs, crates/biome_markdown_parser/src/syntax/list.rs, crates/biome_markdown_parser/src/syntax/mod.rs, crates/biome_markdown_parser/src/syntax/quote.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/biome_markdown_parser/src/syntax/fenced_code_block.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"0051328d4c7e6828367d4fcbf9e3912c29d9c193530b8b665451848163cc4b19"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060p.at(MD_TEXTUAL_LITERAL) \u0026\u0026 p.cur_text() == \u0022\u003E\u0022\u0060 appears character-identically in 2 files \u2014 crates/biome_markdown_parser/src/syntax/list.rs, crates/biome_markdown_parser/src/syntax/quote.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/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":2675}}}],"partialFingerprints":{"codehealthFindingId/v1":"4004120f48cd0382deab212d2936f9e54c04f4e14b539a11149f3947f3496249"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060p.at(MD_TEXTUAL_LITERAL) \u0026\u0026 p.cur_text().starts_with(\u0027#\u0027)\u0060 appears character-identically in 2 files \u2014 crates/biome_markdown_parser/src/syntax/header.rs, crates/biome_markdown_parser/src/syntax/list.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/biome_markdown_parser/src/syntax/header.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b9ae7346b9ce253622da65739f0ce873bc2f73f29cf6c2ade4e3620c71b4c7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060p.at(MD_TEXTUAL_LITERAL) \u0026\u0026 textual_starts_with_ordered_marker(p.cur_text())\u0060 appears character-identically in 2 files \u2014 crates/biome_markdown_parser/src/syntax/list.rs, crates/biome_markdown_parser/src/syntax/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":2321}}}],"partialFingerprints":{"codehealthFindingId/v1":"2041172e2248b4ab9ce14e5256835d316f8ae44c34750b61f4796c0ebbb4443e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060p.at(T![\u0027{\u0027]) || p.has_preceding_line_break()\u0060 appears character-identically in 2 files \u2014 crates/biome_css_parser/src/syntax/at_rule/error.rs, crates/biome_css_parser/src/syntax/at_rule/supports/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_css_parser/src/syntax/at_rule/error.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ff0cea509920c4c9ae1d1b40f43fa1b450da7089f0cdcc168bda3ed22094ea"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060p.at(T![-]) || p.at(T![*]) || p.at(T![\u002B])\u0060 appears character-identically in 2 files \u2014 crates/biome_markdown_parser/src/syntax/inline/code_span.rs, crates/biome_markdown_parser/src/syntax/list.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/biome_markdown_parser/src/syntax/inline/code_span.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2c36a97d712828f5dccec11b05440e745c24fbb21828857a2829faa8c52690"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060p.at(T![\u003E]) || (p.at(MD_TEXTUAL_LITERAL) \u0026\u0026 p.cur_text() == \u0022\u003E\u0022)\u0060 appears character-identically in 2 files \u2014 crates/biome_markdown_parser/src/syntax/list.rs, crates/biome_markdown_parser/src/syntax/quote.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/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":2663}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a4ac7432ae1e6da8cdf501c9fee31b91faadfc74577b83e5492b53f38ab651"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060p.has_preceding_whitespace() || p.has_preceding_line_break()\u0060 appears character-identically in 2 files \u2014 crates/biome_css_parser/src/syntax/mod.rs, crates/biome_css_parser/src/syntax/scss/value/any.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/biome_css_parser/src/syntax/mod.rs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd13ae3e2b6178d6daf0ea9f3e564db22b5e53fb392a6ac56086fc7b5c9d844f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060p.is_at_line_start() \u0026\u0026 at_blank_line_start(p)\u0060 appears character-identically in 2 files \u2014 crates/biome_markdown_parser/src/syntax/list.rs, crates/biome_markdown_parser/src/syntax/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e90438d96f91bc2b64772b815214a83d52e8e398fed87ac06c9c8879fe2412"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060p.nth_at(n, NEWLINE) || p.nth_at(n, T![EOF])\u0060 appears character-identically in 2 files \u2014 crates/biome_markdown_parser/src/syntax/list.rs, crates/biome_markdown_parser/src/syntax/thematic_break_block.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/biome_markdown_parser/src/syntax/list.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"555581224b11620e6cc2a6c7490a14ea12b02f75469b489821648f4b89f4ddd8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060p.state().in_async() \u0026\u0026 (p.state().is_top_level() || p.state().in_function())\u0060 appears character-identically in 2 files \u2014 crates/biome_js_parser/src/syntax/expr.rs, crates/biome_js_parser/src/syntax/stmt.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/biome_js_parser/src/syntax/expr.rs"},"region":{"startLine":1892}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f794db3daefc2853f14540eee20ebf609e094eeb600c5ff2980ba9355e19a3e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parsed_element.is_absent() \u0026\u0026 self.is_recovery_disabled\u0060 appears character-identically in 2 files \u2014 crates/biome_css_parser/src/syntax/selector/mod.rs, crates/biome_css_parser/src/syntax/selector/relative_selector.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/biome_css_parser/src/syntax/selector/mod.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"17802b7713eb86f480c4c25257ddf31134b24317b8a072c4fef5460942d48566"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060piece.is_whitespace() || piece.is_newline()\u0060 appears character-identically in 2 files \u2014 crates/biome_formatter/src/lib.rs, crates/biome_html_formatter/src/utils/children.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/biome_formatter/src/lib.rs"},"region":{"startLine":1985}}}],"partialFingerprints":{"codehealthFindingId/v1":"112d647a871211a344d1dc38db676b9f55de7d67f353185215253abe87e0c58f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060preserve_source_gap_before_semicolon \u0026\u0026 has_block_comment_gap_before_token(semicolon)\u0060 appears character-identically in 2 files \u2014 crates/biome_css_formatter/src/css/auxiliary/declaration_with_semicolon.rs, crates/biome_css_formatter/src/scss/auxiliary/variable_declaration.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/biome_css_formatter/src/css/auxiliary/declaration_with_semicolon.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f78d74ca018603ba2f80b17a38dffbcf93c6d459483e6e3774a6fa08d8ee2d1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060previous.kind().is_keyword() \u0026\u0026 previous.text_trimmed_range().end() == first_token.text_trimmed_range().start()\u0060 appears character-identically in 2 files \u2014 crates/biome_js_analyze/src/lint/nursery/use_math_abs.rs, crates/biome_js_analyze/src/lint/nursery/use_set_size.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/biome_js_analyze/src/lint/nursery/use_math_abs.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d683f688aa500f8f63250c892bb735858ab92494ef7e027a9edf15690b2cd4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060property.trim().eq_ignore_ascii_case(\u0022user-scalable\u0022) \u0026\u0026 value.trim().eq_ignore_ascii_case(\u0022no\u0022)\u0060 appears character-identically in 2 files \u2014 crates/biome_html_analyze/src/lint/nursery/no_non_scalable_viewport.rs, crates/biome_js_analyze/src/lint/nursery/no_non_scalable_viewport.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/biome_html_analyze/src/lint/nursery/no_non_scalable_viewport.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"b56ef3ecca06d85de2461bff069989d998def16dd48c787f9bdab8064fb0c9b1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060recovery_result.is_err() \u0026\u0026 p.at(T![and])\u0060 appears character-identically in 4 files \u2014 crates/biome_css_parser/src/syntax/at_rule/container/mod.rs, crates/biome_css_parser/src/syntax/at_rule/media.rs, crates/biome_css_parser/src/syntax/at_rule/supports/mod.rs, crates/biome_css_parser/src/syntax/value/if.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/biome_css_parser/src/syntax/at_rule/container/mod.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"234f749769543989d72b56b83f14c38e2836164c73ac906c87a22f77cfbc8305"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060recovery_result.is_err() \u0026\u0026 p.at(T![or])\u0060 appears character-identically in 4 files \u2014 crates/biome_css_parser/src/syntax/at_rule/container/mod.rs, crates/biome_css_parser/src/syntax/at_rule/media.rs, crates/biome_css_parser/src/syntax/at_rule/supports/mod.rs, crates/biome_css_parser/src/syntax/value/if.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/biome_css_parser/src/syntax/at_rule/container/mod.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"8340c23ada5251ecb272e781ee4bf0e6d42ce47a795c6c73816d8cbf8da2b775"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060relative_offset \u003E= start \u0026\u0026 relative_offset \u003C end\u0060 appears character-identically in 2 files \u2014 crates/biome_service/src/file_handlers/html/go_to.rs, crates/biome_service/src/file_handlers/javascript/go_to.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/biome_service/src/file_handlers/html/go_to.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc5713ee5a087389be0df77c7cc24ffb3d1798997b872d87866b4985093d61f7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060result.parse_errors \u003E 0 \u0026\u0026 execution.should_skip_parse_errors()\u0060 appears character-identically in 3 files \u2014 crates/biome_cli/src/runner/impls/process_file/check.rs, crates/biome_cli/src/runner/impls/process_file/format.rs, crates/biome_cli/src/runner/impls/process_file/lint_and_assist.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/biome_cli/src/runner/impls/process_file/check.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"07b7f24dac0cebb61359ef46abe876aacc22651c3dec9a975adad7a579ab5873"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.cursor.is_at_scss_interpolation_at(offset) || self.cursor.is_ident_start_at(offset)\u0060 appears character-identically in 2 files \u2014 crates/biome_css_parser/src/lexer/scan_cursor.rs, crates/biome_css_parser/src/lexer/scan_cursor/url.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/biome_css_parser/src/lexer/scan_cursor.rs"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"123f2fc8cd4fbae6c34be492008e469815911bcbf856f78bb39967a2896239ce"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.is_keyword() \u0026\u0026 !self.is_contextual_keyword()\u0060 appears character-identically in 2 files \u2014 crates/biome_css_syntax/src/lib.rs, crates/biome_js_syntax/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/biome_css_syntax/src/lib.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2baf2b9c330bc55ab90aa2819eaaece6c34152018a68908870b44a6522b7a00"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.is_suppressed(node, f) || self.is_global_suppressed(node, f)\u0060 appears character-identically in 8 files \u2014 crates/biome_css_formatter/src/lib.rs, crates/biome_graphql_formatter/src/lib.rs, crates/biome_grit_formatter/src/lib.rs, crates/biome_html_formatter/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/biome_css_formatter/src/lib.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"45eac075f765fe360584fddebdfb0edcbb52c146f3fb51d7a89d4296742c9012"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.vcs_targeted.changed || self.vcs_targeted.staged\u0060 appears character-identically in 4 files \u2014 crates/biome_cli/src/commands/check.rs, crates/biome_cli/src/commands/ci.rs, crates/biome_cli/src/commands/format.rs, crates/biome_cli/src/commands/lint.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/biome_cli/src/commands/check.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"55fa211d2c69e5e394f648aaec3c001a5daa53b693acd44b92d97b1e6f49cb28"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060semantic_elements.is_empty() \u0026\u0026 related_elements.is_empty()\u0060 appears character-identically in 2 files \u2014 crates/biome_html_analyze/src/lint/a11y/use_semantic_elements.rs, crates/biome_js_analyze/src/lint/a11y/use_semantic_elements.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/biome_html_analyze/src/lint/a11y/use_semantic_elements.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e0a38771cc388d818e0db22d0184560ca74022621ca5bfb68d849ec7e00fad"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060sorted_value.is_empty() || value.text() == sorted_value\u0060 appears character-identically in 2 files \u2014 crates/biome_html_analyze/src/lint/nursery/use_tailwind_sorted_classes.rs, crates/biome_js_analyze/src/lint/nursery/use_tailwind_sorted_classes.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/biome_html_analyze/src/lint/nursery/use_tailwind_sorted_classes.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff9b148e69060a5b62d7c40c6392ffbbe8d644946cb6870700f9ee0d4297f57"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060store_name.is_empty() || store_name.starts_with(\u0027$\u0027)\u0060 appears character-identically in 2 files \u2014 crates/biome_embeds/src/references.rs, crates/biome_js_semantic/src/semantic_model/flavor.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/biome_embeds/src/references.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"1207d9835285eca3a56337912e461db24732b8958bcd282f65779552739b781d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060style == Style::InlineType \u0026\u0026 type_token.is_some()\u0060 appears character-identically in 2 files \u2014 crates/biome_js_analyze/src/lint/style/use_export_type.rs, crates/biome_js_analyze/src/lint/style/use_import_type.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/biome_js_analyze/src/lint/style/use_export_type.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"4303a0863a0046f799003de3e23c4b9546692727282c5a3b6ffe55f10154d73f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060text == \u0022-\u0022 || text == \u0022*\u0022 || text == \u0022\u002B\u0022\u0060 appears character-identically in 3 files \u2014 crates/biome_markdown_parser/src/syntax/inline/code_span.rs, crates/biome_markdown_parser/src/syntax/list.rs, crates/biome_markdown_parser/src/syntax/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/syntax/inline/code_span.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa67ea57a2ecdb8c5f8f019b4dd64422b820b54e1b84019f807a0ec6888fe28"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060text.starts_with(\u0027 \u0027) || text.starts_with(\u0027\\t\u0027)\u0060 appears character-identically in 3 files \u2014 crates/biome_markdown_parser/src/syntax/header.rs, crates/biome_markdown_parser/src/syntax/inline/code_span.rs, crates/biome_markdown_parser/src/syntax/list.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/biome_markdown_parser/src/syntax/header.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2dc3286ff52c9c2c3d66371724d040d50ec8bd375ee1525969141d3303d249"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060token.has_leading_comments() || token.has_trailing_comments()\u0060 appears character-identically in 3 files \u2014 crates/biome_js_analyze/src/lint/nursery/no_confusing_array_splice.rs, crates/biome_js_analyze/src/lint/nursery/no_useless_spread.rs, crates/biome_markdown_analyze/src/suppression.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/biome_js_analyze/src/lint/nursery/no_confusing_array_splice.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3bea575fb4c39b798cc151707e60c3e06e511b3a262e4bbd3bc8a1a539c0ff7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060trim_range.start \u003E 0 \u0026\u0026 !trim_range.is_empty()\u0060 appears character-identically in 2 files \u2014 crates/biome_markdown_formatter/src/markdown/auxiliary/quote.rs, crates/biome_markdown_formatter/src/quote.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/biome_markdown_formatter/src/markdown/auxiliary/quote.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"e100287d4131e4674c2991f6e6c7b62395b47cbe47ad47a9b5c371f353d3c538"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 245 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/workspace.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b6cfbb95fe4eb7c7ae164cab8055bb63311417cd42c5b0714746f59f745eb8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 163 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/scanner/watcher.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b54ceed2ba59a438e3b639bf5dcf69f606bf3972fba36adff2e0faedd33455"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 218 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/scanner/watcher.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dfe1b01beeeb822d4db8376a8627af9553d09de334cb7b08514df2a59297c85"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 223 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/scanner/watcher.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"e56d6ded5580ba84d6f7f3e0d7a814fbee3be9fae15c3caea3af1dd8a8d05cc1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 309 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/scanner/watcher.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"37e9a8ddf5b4f78c17353838d552ab9b1e9442989811ac3862a4c9670a262823"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 448 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/scanner/watcher.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed30a736d5945db68f92f91cd2b261bc949869bbf1dcc6d30e7d5507f54f6a2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 467 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/scanner/watcher.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"06bff3dadbde85a6ef506719e5b5c53dc50e4f040f1fbd52d22ebe58323285b4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 473 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/scanner/watcher.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2c944d72a24a0bdcb931ccfb3e9fc5747228f492cd6d035c9c75f50b9e43d1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 485 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/scanner/watcher.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f686ff32945ed5cf0cc994065fa76959626a0ff42025f7502ec39da311c45c5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 495 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/scanner/watcher.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"1485c0efe4419c0b248a8088584ff503aefedefae916a847df39afe2fef30fe7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1535 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/javascript.rs"},"region":{"startLine":1535}}}],"partialFingerprints":{"codehealthFindingId/v1":"d32f344f01277d02272f6f9950ba9986b74b4f5397d99204663f33f9c7b9b66c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1745 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/javascript.rs"},"region":{"startLine":1745}}}],"partialFingerprints":{"codehealthFindingId/v1":"127c9e502231316942840dd8861c1c033897bf1afe6e619b5376be196d2724fc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1751 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/javascript.rs"},"region":{"startLine":1751}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e98c987dde4907e88c1b47ca131130957c8353b7f7dd12bb8aef740a7e2b6f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1770 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/javascript.rs"},"region":{"startLine":1770}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b74905459b2a96d1d5ee7a2c614ccbc86e497a4719fd6084cc307ad21f6b81"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1789 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/javascript.rs"},"region":{"startLine":1789}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc7b14923ea38e060645e8c7fa677fb79a250056c3b5954032b059ae747ccf88"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 536 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/md.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ce024a41532eb19b85ba0b1f38598a1ca236bb6941278a4d0f4ac3b389ce3d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 542 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/md.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b1418dc1a7e15887d7385b874a385bf686d6df2e8160426ebd4bd4aecdbcb9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 162 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/svelte.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"eefef57ce2c21a4e522441b5d756cab9135608ff1bec96aa83b83a07e09563cf"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 203 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/svelte.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff44ed53aa31bb522f63d283a0242208b0c6a0d29d107ddd737b824e05142f7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 158 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/vue.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"997a20272ce567a1255f5a02cc0d1f1819e34c0a14df69dfb55c97c1f10d1873"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 194 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/vue.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"d967fbc071d1243ec03f4c05c18a1004c16fde791c4b98309812e12e14fed684"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 446 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/yaml.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ce76a2bb00f2c90b6bf326ea5144efe0484eb1f0a8b07ebb34cc118247e197"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 452 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/file_handlers/yaml.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"200dccf104d6ed7eec4eb83de7852a67d1723e343dfe164d83d925734dc343f3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1224 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/db/mod.rs"},"region":{"startLine":1224}}}],"partialFingerprints":{"codehealthFindingId/v1":"299efec6112b6240cf7aee50cf348cef2a885dc20eba527f4129b98ba7a21713"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1286 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_service/src/db/mod.rs"},"region":{"startLine":1286}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d92b6c2557335bfc309123bddd1517c0d7df2063b8b670215217406b663aca6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 64 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/extension_settings.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f569ada1693a26ededb2f4d93d54c961051d44a2f45df3b9f8eab5ceae000a3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 119 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/server.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"588e89566178b21877cc6090aa4f711f90c92a52d86e33084a14e6a780eb3ae8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 123 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/server.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5cc363b9d561cf7b2e15c459c52febdf3f01e78413070428d23936343af41d5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 218 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/server.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb7adb6d78ee1a820d1fa83e692295b701aa5ade29bf7629b118f0c0eeef14c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 514 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/server.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a03fad77065c4ad413354b42ba2302d962411cfc525016fea90bb89e0a6ac3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 365 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/session.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"35404108c9d1f0abce930da92b0e9ac0125fa85c469adc3749f77a70cb5d2da1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 390 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/session.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"130f1061be51699f028633f8f4251427d7c8ffd5361ceb08718863192f6ffc7e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 465 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/session.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca27722b97a8c8603c168c302ba433a364fd47cab3e56a110f5ccadd930e988"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 492 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/session.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"3607abe1ecbdb3fc047ec82655780a4af2bb451aec2d8b0c9aa6c11ea08195b4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 624 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/session.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"46aface9349c27c44dd320b5fe1b1fa022bcc46d97eaa4607061d69062a61708"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 791 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/session.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a52280aba7acf895f2b4ccd68e9aed7cc9fb1fcb1329039e991e3f1d49260cc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 837 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/session.rs"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba7241d6868502c1a9e89e9379c579373e2183246be36ef4d2f0f64f69a56e4f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 853 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/session.rs"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3aeb19722fbf5c763b268c0c40fc359690fab10024f0ff177ae5b9b42e5bf3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 867 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/session.rs"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b91e5aa377d8ccffb3b9308a206f978a9657df44101c90455c3db1f3e085d3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 881 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/session.rs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"825b8a1af8a3957bf09aed95b50946cfa342f10b0712d41a2b0eae6c09938757"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 895 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/session.rs"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"d535a779ac334ff902259bda58cff9498628ed92ffd79a44f9fb30f53920fa65"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 909 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/session.rs"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e0717075df02ce27e0291d78ec4d193d94ad392f9871fe4ca7c254e96a5e4a1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 946 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/session.rs"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"afcd6f2efdbe9a03d8863148f7a0a0ca9df130d11e4df9acd9e3aff57a807fb7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 963 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/session.rs"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a21768067d0b9e084315a771a732d0c6aa8d641dbe0e789bd197a5aecfeb7e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1009 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/session.rs"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f449f9ba4a80fa634b9e0ecb08ce30ea0c81d0afe27a5ed69dfa71f48d8d43"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1132 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/session.rs"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf6fed90ba9ff97ae0259adeb59dadc198df7e027ba85a5798645f7666b24a7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1137 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/session.rs"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"813ce1e0612c58d5929c890a03e67573c7ec5d188ba16f2e5064d472b777fdfc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1149 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/session.rs"},"region":{"startLine":1149}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ecf72282614e084bf52a6baf58513a757b8633ff44f6caae60fe594d6d31436"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1153 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/session.rs"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"79583660c24344d3505b70a55be93e8a99103704654c1a2d47b38a2e98dbfe47"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1276 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/session.rs"},"region":{"startLine":1276}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a1437f86b27659eee8572fc2a2dfc94edf248a5a9e4a4a6b21860646216723"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1284 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/session.rs"},"region":{"startLine":1284}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b18a5bda064e60149ee4c79bbfb6227f7c77432945c1a24b42ded681f7c611"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1334 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/session.rs"},"region":{"startLine":1334}}}],"partialFingerprints":{"codehealthFindingId/v1":"d27c8b2caaf06ff6672e9e95bfbaed29f080278ea43bb9d28efaf8aeaff754eb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1401 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/session.rs"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d99e6e681507dc7eac8dc2bedc3cb19987f835afda142f6b195fc6e3311a0d8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1426 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/session.rs"},"region":{"startLine":1426}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e51484cfd90a73838f9fa87627c6fd1f1c16bc20c0839821de7abf4d78524e5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1472 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/session.rs"},"region":{"startLine":1472}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb21df75747983667e3f8dac281df1418b79cb50532ca71d28b88a7e764940b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1508 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/session.rs"},"region":{"startLine":1508}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca14decab117a1326ff44f4bbecfbb103d4a245c278c98cb743d6e1a2be42da7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1514 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/session.rs"},"region":{"startLine":1514}}}],"partialFingerprints":{"codehealthFindingId/v1":"89623598fffff6d0161da3bfaa8eece71b114f413d51f3a000f018b7150e8a80"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1539 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/session.rs"},"region":{"startLine":1539}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a6e88d27b78414e878e73cc4bcb487b6031348eadeecdf5675dea661ba48e2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1547 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/session.rs"},"region":{"startLine":1547}}}],"partialFingerprints":{"codehealthFindingId/v1":"270047f1ed2b2c896b7f2c556729295d10df92bf18257730182d076478118e9b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1551 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/session.rs"},"region":{"startLine":1551}}}],"partialFingerprints":{"codehealthFindingId/v1":"c01d0046ab03c6a93e0c298c0b508ee8d3956b92203826bb100affd1e89a0820"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1564 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/session.rs"},"region":{"startLine":1564}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d350454b891fa2d6734480259352ecf514f41b1eef13fddc5939b0108974aa2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 393 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/utils.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2a07acf98d4554cfad85e850399ac1e2af52d874b975b62ca7096de85c7a126"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 187 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/handlers/analysis.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e024b4430707bb2f15bcbd5eb8acc8d9fca7da13b037f8948a2d950e396dfe"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 221 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/handlers/analysis.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eee05d44ec0b524fa47184ab0b5fbd3e6a022192f2ba09369866b7c77eae04e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 222 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/handlers/analysis.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"2794e075c54f2a479ccb6c29a67f6ea9cdad44b88dbf58cadbb8ac2b642da77b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 263 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/handlers/analysis.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4642b3097557ff53b54fa0e6f8ac9cc7cd1926062e365d6731e6b0e3e6125a8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 269 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/handlers/analysis.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f4249000856cd0548b8b366140aa3b34f13e33096027e02b7020f81e386db0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 369 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/handlers/analysis.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"9632fd4349ae9d5440b44e7fc3a70269363b9c13547ffd6e96f574faac6000aa"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 372 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/handlers/analysis.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a922f2f53341a6bd3f809e337cbe372f0dd661a27abbe9d8dd5ba8e15fb2179"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 110 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/handlers/text_document.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc2e19f77a1f0b79e4329ecf65983ae462151b2e9be342908b65057c4fcf436"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 129 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/handlers/text_document.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15cc3979d9966b71719352c123efaf5692a2066361a53abb7d4e1e333005254"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 133 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/handlers/text_document.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"799f179d5d530207fbd9703585498d920f8cd041258366ae230dd1d1f1e781fb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 149 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/handlers/text_document.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"851ffe60c4cb60371de28238a4e41233719f94e66ab2e3285b3e686e0e2f0969"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 156 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/handlers/text_document.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f443ae0d4978db92aaa5e4efbd845bc81dc8a787d5dbea61af47f2d272eba3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 218 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/handlers/text_document.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"36cadd815b733a05414ec7cf2ca6d927bae9d1352b4a86cf2013bfe349a82ac4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 254 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/handlers/text_document.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"9722140d112da90005b6f6faf654adb434889510995d0f18b9395c0ef07d50f6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 274 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/handlers/text_document.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af78b21ec51a77579f6f23f6e042ecfacea5f6f90f45655b855f5c690c8ab86"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 291 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_lsp/src/handlers/text_document.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c3ead00da6048715297cdc588488df71d184a0550f62e3efb5b1ff896912fe"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 202 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_fs/src/fs.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc1750893a62b044e3fc2d1e5ca88f0f74319523925f5ebd704d4314a026c19"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 214 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_fs/src/fs.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"34c5f4d823cc5cc8e78d0b3c5a89176613c7a6a45cf296d283e2b38dda8d44b6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 258 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_fs/src/fs.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3aa027780e16c966f16fa914bb31e923373ebdc5443c939d4becb510f2bfd5c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 26 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_fs/src/utils.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ddfc24dbde439e986945641fac9d1c65cc5926ea8b8a1eeff174afe754f1f6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 25 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/panic.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c13d5d7f04ee21cd365ad47ffd0895aaa96ab6b50edfc6e0d61a710e2ad192"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 107 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/service/unix.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"d98c413d3e780f9dc7e3e12ac60b801777d3f8bf5436b005155476362ed43b62"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 125 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/service/unix.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ded670396ec1509897ed2bafdd0424ea2478b02d07cad9a4b305cab3f3f7500"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 140 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/service/unix.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"4831c14d4e184edb9d85ab96ee0d42df0e3a45cfab28ad07af18e7d9480c66ab"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 142 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/service/unix.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c7891e2dbe1ed8e624ba2a492f3eca73dc70ecc5a401545f68601e794e1f5a2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 146 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/service/unix.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"2229d461ff91af6b71eb1106d6e2dbef78cd4bf15b92e1e72ebe2fd9f7155ab2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 147 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/service/unix.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e3ae545f1a175f1bcf6802d0f65bdb4c22edcd36fcd6141175a19b35e1079f1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 162 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/service/unix.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e3825d7b85592a9daa71b80dee8c7633cb3ad9fb25729b93b2894cdaa37ff02"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 179 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/service/unix.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b82f1aafdbc8a3daf950408712c92beb638ff19ad400f17b10dfd7d5b67bfb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 324 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/service/unix.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e6cdc5ce783ed3163700608a2fb1d1df09e4b15bed7f46c83c4c976d6d8904"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 330 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/service/unix.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d909ec4c5c6170690321ef1984c0e434abc91134c868395da3b5d3b084e6b7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 432 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/runner/mod.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"6639185b2002248747e15ba8fb6974bcee43eb03b83442bb3c156dc57206f0bd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 32 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/runner/impls/watchers/default.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c9f10ad557c68036cf69273652efb0977e3e78819ffec2c7b7fc444013c9c3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 36 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/runner/impls/watchers/default.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"efbccd459c583003516f8414ab06a228a6cc4e112a5c37b5b786d29efcfc298f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 62 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/runner/impls/process_file/check.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a9a7b4a82cba4e629fd9f35234b7d3e439d7b9e0cdaedc9403f08e54cef351"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 98 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/runner/impls/process_file/format.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"adbbc0d42606021b8ffbbafd428ac71fb79797f0bd6ce3fbf188bef74526ef90"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 77 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_cli/src/runner/impls/process_file/lint_and_assist.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a0694af7e62133f68304e49241f9ec99adfe4a3a3e6237c7d8da49829f867f"}},{"ruleId":"X5","level":"note","message":{"text":"Strict null checking is not enabled everywhere the repository type-checks: 6/17 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":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060run\u0060 turns every \u0060Err\u0060 into \u0060Box::default()\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/biome_css_analyze/src/lint/nursery/no_scss_null_comparison.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0802ae266d29bf405f423a198623d0c482b47af4c5607110de73f166adc2a58"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060run\u0060 turns every \u0060Err\u0060 into \u0060Box::default()\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/biome_css_analyze/src/lint/nursery/use_logical_properties.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"d81b447ab4b98dba0c078b45297679b99bffcb452e711c9d1f9953a6835dd9e8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060load_ignored_tests\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/biome_formatter_test/src/test_prettier_snapshot.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c753b18ba1cd33c9e1ab0ce292062ca1a1972ab4a042df858aa0e91d2f1e6f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060all_reference_nodes\u0060 turns every \u0060Err\u0060 into \u0060vec![]\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_graphql_semantic/src/semantic_model/binding.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b697f0911c81db0b179c966356aaebfaf382d45ca5659d661d4bc4b7dc6a19"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060all_reference_nodes\u0060 turns every \u0060Err\u0060 into \u0060vec![]\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_graphql_semantic/src/semantic_model/binding.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc23392d94a79d2ecf3be7d3a3d71d1f1222e280eed8c75c7f00b28378ed027"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060run\u0060 turns every \u0060Err\u0060 into \u0060Box::default()\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/biome_html_analyze/src/lint/nursery/no_vue_textarea_mustache.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"8841cf2f2e0013973b39349b8bd808e769ede97c747bbee097412ff467b803d7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060get_accessible_child_text\u0060 turns every \u0060Err\u0060 into \u0060String::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_html_analyze/src/lint/a11y/no_ambiguous_anchor_text.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"118febb5e3461e5b2321be3f90a5bee0169c90d15f52407ad1bc55c0688fc364"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060run\u0060 turns every \u0060Err\u0060 into \u0060Box::default()\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/biome_js_analyze/src/lint/correctness/no_invalid_use_before_declaration.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc707b684f46ad4224ae48fe55f1e8559ff94242c389d879c82f0aafc9b8c7b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060run\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/biome_js_analyze/src/lint/correctness/no_vue_import_compiler_macros.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"6841de1286b13965f3a88afaa3c900c5d31d0e9fa5b6d15a423b9a278ba756a3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060run\u0060 turns every \u0060Err\u0060 into \u0060Box::default()\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/biome_js_analyze/src/lint/nursery/no_console_spaces.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"629392facf85e527af4b69b19cf2e1f710742b82d6fe60eebf99c59d1e8ce779"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060run\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/biome_js_analyze/src/lint/suspicious/no_comment_text.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a6beb6b5673919337f74dab8c9f335618e810034064f5e09eab3d7d7153919c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060run\u0060 turns every \u0060Err\u0060 into \u0060Default::default()\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/biome_js_analyze/src/lint/suspicious/no_control_characters_in_regex.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2f68e6d9dbba1b72bf5011d66acddc254be9a80be7f475394b3d9d9aaf3c9ce"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060get_accessible_child_text\u0060 turns every \u0060Err\u0060 into \u0060String::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/a11y/no_ambiguous_anchor_text.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"2744033813b3d9af6b56de69864be218d8f595ac66a93f1358ea7e446e4845f2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060get_relevant_capture_nodes\u0060 turns every \u0060Err\u0060 into \u0060vec![]\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/src/lint/correctness/use_exhaustive_dependencies.rs"},"region":{"startLine":1694}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d90c10c8cb5a58f04d50a30fdd091ae29d4095f447f3eacba571d7b63f93dac"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060collect_require_destructured_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/biome_js_analyze/src/lint/correctness/use_react_native_platform_components.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"170f2ea078c52fc5c74871bc9c7492e5b7477299b96ee286414cf152867cd063"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060get_sanitized_parent_node\u0060 turns every \u0060Err\u0060 into \u0060true\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/biome_js_analyze/src/lint/style/no_magic_numbers.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b3493d8e000a26b11d6edd1e138b5c252cbf21340fa50d1697bb96ec228a73"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060run_regex_literal\u0060 turns every \u0060Err\u0060 into \u0060Default::default()\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/biome_js_analyze/src/lint/style/use_named_capture_group.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"4942906b584c17b232a61105bef671148c1a6b4d3c527622875a4c88dbda5889"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060format_inferred_type\u0060 turns every \u0060Err\u0060 into \u0060\u0022unknown\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_type_info/src/format_inferred_type_info.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"c933fc4c27a0e6fa67e724ff2704ddb015849a7bb31be24bcee24a70186bfa3c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060run\u0060 turns every \u0060Err\u0060 into \u0060Box::default()\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/biome_json_analyze/src/lint/nursery/use_package_json_valid_cpu.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8029aacdd4890c07cb4adf7aaa674e80d6a6e9c25b1466b3413246541554ba9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060run\u0060 turns every \u0060Err\u0060 into \u0060Box::default()\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/biome_json_analyze/src/lint/nursery/use_package_json_valid_license.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"7638e6f55afeac8ef1fa4b226b958661a04f30933d21fdc41aab5f31ae913376"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060enter\u0060 turns every \u0060Err\u0060 into \u00601\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/biome_markdown_parser/src/to_html.rs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"3835f98a34dd4125d9d3d84ec4080bd16cfe3de672949bc05e38ff086b914c9e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060render_table_with_limit\u0060 turns every \u0060Err\u0060 into \u0060String::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_markdown_parser/src/to_html.rs"},"region":{"startLine":1301}}}],"partialFingerprints":{"codehealthFindingId/v1":"421c7ad301fb89697345ad3ba08cae02d570cd121704be7642b3a07fa1c97ced"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060run\u0060 turns every \u0060Err\u0060 into \u0060Vec::default()\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/biome_migrate/src/analyzers/includes.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"c91b2bbda227ab97df0f8de5b09e8d4a596f7710b587a3891808d1f878517b7b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060run\u0060 turns every \u0060Err\u0060 into \u0060Box::default()\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/biome_migrate/src/analyzers/organize_imports.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffb9d62831b661631044209a7c394bb25500593f940a90a3acd89467c385773c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060run\u0060 turns every \u0060Err\u0060 into \u0060Box::default()\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/biome_migrate/src/analyzers/rule_mover.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0dc00aaa0b36d9c7f475b58206b156fe0c5bc557dc74791fcca888e0b6846a9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060validate_globs\u0060 turns every \u0060Err\u0060 into \u0060Default::default()\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/biome_migrate/src/analyzers/includes.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a310fcf405ae52f97182a2e7a9822b424b62dbbecc86d5692312067c06441c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060build_svelte_directive_candidates\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/biome_service/src/file_handlers/html/parse_embedded_nodes.rs"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"180d56b92940cf8d8237a2f6d2e9abc52dbad776c1e7d555026a817d8b91816a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060v_for_bindings\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/biome_vue_semantic/src/semantic_model/layout.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c28c72dff3d530916da6d2bc32429e310e20aea9023502a2f65ed3cda3b029"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060p.finally()\u0060 swallows every exception into \u0060return 1\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/tests/specs/nursery/noReturnInFinally/invalid_nested_blocks.js"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee2623fd038f46c24b0ff262a3e3b505da6b1c82cf56360384fab155c7c345a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060f\u0060 swallows every exception into \u0060return 0\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/tests/specs/style/noUselessElse/missed.js"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"a205827f7299116bb3df5d02c0d3881767f39ca9bc510ed8311aff3f42c892fd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060f\u0060 swallows every exception into \u0060return 0\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/tests/specs/suspicious/noFallthroughSwitchClause/valid.js"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8904369591c4eeb0d05031e34f7c17614646612306ad028e49ebe8602349543"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060bar\u0060 swallows every exception into \u0060return 0\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_js_analyze/tests/specs/suspicious/useGetterReturn/valid.js"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c44f34c66b3852e2fd6f6229844ad21d1c3d5785309c3a374ae4f50f5a03e5"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060base.starts_with(\u0022./\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060base.starts_with(\u0022./\u0022)\u0060 also satisfies \u0060base.starts_with(\u0022.\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/biome_fs/src/fs/memory.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a8fe0e03454caf88932c0f9a6af4f117424ed980dbdc7da7990d22ae6d63e25"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-214","guid":"b10ad120-fb22-1351-9348-aa23b453e815","name":"CWE-214","shortDescription":{"text":"CWE-214"},"helpUri":"https://cwe.mitre.org/data/definitions/214.html"},{"id":"CWE-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-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-532","guid":"1cd8877a-76e8-ce54-b40b-779af23364a0","name":"Insertion of Sensitive Information into Log File","shortDescription":{"text":"Insertion of Sensitive Information into Log File"},"helpUri":"https://cwe.mitre.org/data/definitions/532.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"},{"id":"A09:2025","guid":"78892bc9-3c98-495d-881c-8af1390d643c","name":"Security Logging \u0026 Alerting Failures","shortDescription":{"text":"Security Logging \u0026 Alerting Failures"},"helpUri":"https://top10.owasp.org/2025/A09_2025-Security_Logging_and_Alerting_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"id":"CICD-SEC-5","guid":"cc7f4610-8859-e654-9029-d5f97d992220","name":"Insufficient PBAC (Pipeline-Based Access Controls)","shortDescription":{"text":"Insufficient PBAC (Pipeline-Based Access Controls)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-05-Insufficient-PBAC"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":50,"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."]}]}