Fix clippy

Author: noib3

src/rope/gap_buffer.rs

@@ -1446,8 +1446,8 @@ impl<'a, const CHUNKS: usize, const MAX_BYTES: usize>
     }
 }
 
-impl<'a, const CHUNKS: usize, const MAX_BYTES: usize> Iterator
-    for Resegmenter<'a, CHUNKS, MAX_BYTES>
+impl<const CHUNKS: usize, const MAX_BYTES: usize> Iterator
+    for Resegmenter<'_, CHUNKS, MAX_BYTES>
 {
     type Item = GapBuffer<MAX_BYTES>;
 

src/rope/iterators.rs

@@ -277,7 +277,7 @@ impl<'a> From<&RopeSlice<'a>> for Chars<'a> {
     }
 }
 
-impl<'a> Iterator for Chars<'a> {
+impl Iterator for Chars<'_> {
     type Item = char;
 
     #[inline]

src/tree/leaves.rs

@@ -3,13 +3,10 @@ use alloc::vec::Vec;
 use super::{Arc, Inode, Leaf, Metric, Node, Tree, TreeSlice};
 
 /// An iterator over the leaves of `Tree`s and `TreeSlice`s.
+//
+// This iterator is implemented using two independent iterators advancing in
+// opposite directions.
 pub struct Leaves<'a, const ARITY: usize, L: Leaf> {
-    /*
-      This iterator is implemented using two independent iterators advancing in
-      opposite directions.
-    */
-    #[rustfmt::skip]
-
     /// Iterates over the leaves from front to back.
     forward: LeavesForward<'a, ARITY, L>,
 
@@ -395,7 +392,7 @@ struct LeavesBackward<'a, const N: usize, L: Leaf> {
     whole_total: usize,
 }
 
-impl<'a, const N: usize, L: Leaf> Clone for LeavesBackward<'a, N, L> {
+impl<const N: usize, L: Leaf> Clone for LeavesBackward<'_, N, L> {
     #[inline]
     fn clone(&self) -> Self {
         Self { path: self.path.clone(), ..*self }

src/tree/units.rs

@@ -5,25 +5,22 @@ use super::tree_slice;
 use super::{Arc, Lnode, Node, Tree, TreeSlice};
 
 /// An iterator over the units of a metric.
+//
+// Just like the `Leaves` iterator, this iterator is also implemented using two
+// separate iterators, one for iterating forward (used in the `Iterator` impl),
+// and the other for iterating backward (used in the `DoubleEndedIterator`
+// impl).
+//
+// These two iterators are completely independent and don't know about each
+// other, which could cause them to overlap if alternating between calling
+// `Units::next()` and `Units::next_back()`.
+//
+// To prevent this we also store the base measure of the unyielded iterating
+// range, which is decreased as new `TreeSliece`s are yielded (both forward and
+// backward). Once that reaches zero this iterator will stop yielding any more
+// items.
 #[derive(Clone)]
 pub struct Units<'a, const ARITY: usize, L: Leaf, M: Metric<L::Summary>> {
-    /*
-      Just like the `Leaves` iterator, this iterator is also implemented using
-      two separate iterators, one for iterating forward (used in the `Iterator`
-      impl), and the other for iterating backward (used in the
-      `DoubleEndedIterator` impl).
-
-      These two iterators are completely independent and don't know about each
-      other, which could cause them to overlap if alternating between calling
-      `Units::next()` and `Units::next_back()`.
-
-      To prevent this we also store the base measure of the unyielded iterating
-      range, which is decreased as new `TreeSliece`s are yielded (both forward
-      and backward). Once that reaches zero this iterator will stop yielding
-      any more items.
-    */
-    #[rustfmt::skip]
-
     /// Iterates over the `M`-units from front to back.
     forward: UnitsForward<'a, ARITY, L, M>,