perf: avoid monomorphizing <[BNode]>::reverse in non-hydration path

Use into_iter().rev() (pointer arithmetic on DoubleEndedIterator)
instead of in-place slice reverse (element-sized swap loops).

Author: Madoshakalaka

packages/yew/src/dom_bundle/blist.rs

@@ -176,18 +176,17 @@ impl BList {
         let mut lefts_rev = lefts.into_iter().rev();
 
         // Add excess new nodes at the tail of render order (rightmost first
-        // for the NodeWriter).
-        let excess_start = rights.len();
+        // for the NodeWriter, then extended in render order).
+        let mut excess: Vec<BNode> = Vec::new();
         for l in lefts_rev
             .by_ref()
             .take(left_len.saturating_sub(paired_count))
         {
             let (next_writer, el) = writer.add(l);
-            rights.push(el);
+            excess.push(el);
             writer = next_writer;
         }
-        // Items were pushed right-to-left; flip to render order.
-        rights[excess_start..].reverse();
+        rights.extend(excess.into_iter().rev());
 
         // Patch paired nodes right-to-left.
         for (l, r) in lefts_rev.zip(rights[..paired_count].iter_mut().rev()) {
@@ -410,11 +409,13 @@ impl BList {
             };
             replacements.push(bundle);
         }
-        // drop the splice iterator and immediately replace the range with the reordered elements
+        // drop the splice iterator and immediately replace the range with the reordered elements.
+        // replacements was built right-to-left; iterate in reverse for render order.
         drop(spliced_middle);
-        // replacements was built right-to-left; reverse to render order
-        replacements.reverse();
-        bundles.splice(matching_len_start..matching_len_start, replacements);
+        bundles.splice(
+            matching_len_start..matching_len_start,
+            replacements.into_iter().rev(),
+        );
 
         // Step 2.3. Remove any extra rights
         for KeyedEntry(_, r) in spare_bundles.drain() {