fix clippy

packages/native-core/src/passes.rs

@@ -151,10 +151,10 @@ pub trait Pass {
 }
 
 pub trait UpwardPass<T>: Pass {
-    fn pass<'a>(
+    fn pass(
         &self,
         node: &mut T,
-        children: &mut dyn Iterator<Item = &'a mut T>,
+        children: &mut dyn Iterator<Item = &mut T>,
         ctx: &SendAnyMap,
     ) -> PassReturn;
 }
@@ -764,10 +764,10 @@ fn up_pass() {
         }
     }
     impl UpwardPass<i32> for AddPass {
-        fn pass<'a>(
+        fn pass(
             &self,
             node: &mut i32,
-            children: &mut dyn Iterator<Item = &'a mut i32>,
+            children: &mut dyn Iterator<Item = &mut i32>,
             _: &SendAnyMap,
         ) -> PassReturn {
             *node += children.map(|i| *i).sum::<i32>();
@@ -830,10 +830,10 @@ fn dependant_up_pass() {
         }
     }
     impl UpwardPass<i32> for AddPass {
-        fn pass<'a>(
+        fn pass(
             &self,
             node: &mut i32,
-            children: &mut dyn Iterator<Item = &'a mut i32>,
+            children: &mut dyn Iterator<Item = &mut i32>,
             _: &SendAnyMap,
         ) -> PassReturn {
             *node += children.map(|i| *i).sum::<i32>();
@@ -863,10 +863,10 @@ fn dependant_up_pass() {
         }
     }
     impl UpwardPass<i32> for SubtractPass {
-        fn pass<'a>(
+        fn pass(
             &self,
             node: &mut i32,
-            children: &mut dyn Iterator<Item = &'a mut i32>,
+            children: &mut dyn Iterator<Item = &mut i32>,
             _: &SendAnyMap,
         ) -> PassReturn {
             *node -= children.map(|i| *i).sum::<i32>();

packages/native-core/src/state.rs

@@ -251,7 +251,7 @@ impl ChildDepState for () {
 impl ParentDepState for () {
     type Ctx = ();
     type DepState = ();
-    fn reduce<'a>(&mut self, _: NodeView<'a>, _: Option<()>, _: &Self::Ctx) -> bool {
+    fn reduce(&mut self, _: NodeView, _: Option<()>, _: &Self::Ctx) -> bool {
         false
     }
 }
@@ -259,7 +259,7 @@ impl ParentDepState for () {
 impl NodeDepState for () {
     type DepState = ();
     type Ctx = ();
-    fn reduce<'a>(&mut self, _: NodeView<'a>, _sibling: (), _: &Self::Ctx) -> bool {
+    fn reduce(&mut self, _: NodeView, _sibling: (), _: &Self::Ctx) -> bool {
         false
     }
 }

packages/native-core/src/tree.rs

@@ -426,7 +426,7 @@ fn creation() {
     let child = tree.create_node(0);
     tree.add_child(parent, child);
 
-    println!("Tree: {:#?}", tree);
+    println!("Tree: {tree:#?}");
     assert_eq!(tree.size(), 2);
     assert_eq!(tree.height(parent), Some(0));
     assert_eq!(tree.height(child), Some(1));
@@ -448,7 +448,7 @@ fn insertion() {
     let after = tree.create_node(3);
     tree.insert_after(child, after);
 
-    println!("Tree: {:#?}", tree);
+    println!("Tree: {tree:#?}");
     assert_eq!(tree.size(), 4);
     assert_eq!(tree.height(parent), Some(0));
     assert_eq!(tree.height(child), Some(1));
@@ -475,7 +475,7 @@ fn deletion() {
     let after = tree.create_node(3);
     tree.insert_after(child, after);
 
-    println!("Tree: {:#?}", tree);
+    println!("Tree: {tree:#?}");
     assert_eq!(tree.size(), 4);
     assert_eq!(tree.height(parent), Some(0));
     assert_eq!(tree.height(child), Some(1));
@@ -492,7 +492,7 @@ fn deletion() {
 
     tree.remove(child);
 
-    println!("Tree: {:#?}", tree);
+    println!("Tree: {tree:#?}");
     assert_eq!(tree.size(), 3);
     assert_eq!(tree.height(parent), Some(0));
     assert_eq!(tree.height(before), Some(1));
@@ -507,7 +507,7 @@ fn deletion() {
 
     tree.remove(before);
 
-    println!("Tree: {:#?}", tree);
+    println!("Tree: {tree:#?}");
     assert_eq!(tree.size(), 2);
     assert_eq!(tree.height(parent), Some(0));
     assert_eq!(tree.height(after), Some(1));
@@ -519,7 +519,7 @@ fn deletion() {
 
     tree.remove(after);
 
-    println!("Tree: {:#?}", tree);
+    println!("Tree: {tree:#?}");
     assert_eq!(tree.size(), 1);
     assert_eq!(tree.height(parent), Some(0));
     assert_eq!(*tree.get(parent).unwrap(), 0);
@@ -562,7 +562,7 @@ fn get_node_children_mut() {
     for (i, child) in children.enumerate() {
         assert_eq!(*child, i + 1);
     }
-    println!("Parent: {:#?}", parent);
+    println!("Parent: {parent:#?}");
 }
 
 #[test]
@@ -574,7 +574,7 @@ fn get_many_mut_unchecked() {
 
     let all =
         unsafe { slab.get_many_mut_unchecked([parent, child, grandchild].into_iter()) }.unwrap();
-    println!("All: {:#?}", all);
+    println!("All: {all:#?}");
 }
 
 #[derive(Debug)]

packages/native-core/src/utils/persistant_iterator.rs

@@ -368,7 +368,7 @@ fn persist_removes() {
     let mut rdom: RealDom<Empty> = RealDom::new();
 
     let build = vdom.rebuild();
-    println!("{:#?}", build);
+    println!("{build:#?}");
     let _to_update = rdom.apply_mutations(build);
 
     // this will end on the node that is removed
@@ -400,7 +400,7 @@ fn persist_removes() {
 
     vdom.mark_dirty(ScopeId(0));
     let update = vdom.render_immediate();
-    println!("{:#?}", update);
+    println!("{update:#?}");
     iter1.prune(&update, &rdom);
     iter2.prune(&update, &rdom);
     let _to_update = rdom.apply_mutations(update);