finishing touches and benchmarks

packages/native-core/tests/change_nodes.rs

@@ -2,7 +2,7 @@ use dioxus_core::VNode;
 use dioxus_core::*;
 use dioxus_core_macro::*;
 use dioxus_html as dioxus_elements;
-use dioxus_native_core::client_tree::ClientTree;
+use dioxus_native_core::real_dom::RealDom;
 use std::cell::Cell;
 
 #[test]
@@ -20,7 +20,7 @@ fn tree_remove_node() {
         }
     });
 
-    let mut tree: ClientTree<(), ()> = ClientTree::new();
+    let mut tree: RealDom<(), ()> = RealDom::new();
 
     let _to_update = tree.apply_mutations(vec![mutations]);
     let child_div = VElement {
@@ -92,7 +92,7 @@ fn tree_add_node() {
         div{}
     });
 
-    let mut tree: ClientTree<(), ()> = ClientTree::new();
+    let mut tree: RealDom<(), ()> = RealDom::new();
 
     let _to_update = tree.apply_mutations(vec![mutations]);
 

packages/native-core/tests/initial_build.rs

@@ -4,7 +4,7 @@ use dioxus_core::VNode;
 use dioxus_core::*;
 use dioxus_core_macro::*;
 use dioxus_html as dioxus_elements;
-use dioxus_native_core::client_tree::ClientTree;
+use dioxus_native_core::real_dom::RealDom;
 
 #[test]
 fn tree_initial_build_simple() {
@@ -21,7 +21,7 @@ fn tree_initial_build_simple() {
         div{}
     });
 
-    let mut tree: ClientTree<(), ()> = ClientTree::new();
+    let mut tree: RealDom<(), ()> = RealDom::new();
 
     let _to_update = tree.apply_mutations(vec![mutations]);
     let root_div = VElement {
@@ -60,7 +60,7 @@ fn tree_initial_build_with_children() {
         }
     });
 
-    let mut tree: ClientTree<(), ()> = ClientTree::new();
+    let mut tree: RealDom<(), ()> = RealDom::new();
 
     let _to_update = tree.apply_mutations(vec![mutations]);
     let first_text = VText {

packages/native-core/tests/state.rs

@@ -2,7 +2,7 @@ use dioxus_core::VNode;
 use dioxus_core::*;
 use dioxus_core_macro::*;
 use dioxus_html as dioxus_elements;
-use dioxus_native_core::client_tree::*;
+use dioxus_native_core::real_dom::*;
 
 #[derive(Debug, Clone, PartialEq, Default)]
 struct CallCounter(u32);
@@ -77,7 +77,7 @@ fn tree_state_initial() {
         }
     });
 
-    let mut tree: ClientTree<BubbledUpStateTester, PushedDownStateTester> = ClientTree::new();
+    let mut tree: RealDom<BubbledUpStateTester, PushedDownStateTester> = RealDom::new();
 
     let nodes_updated = tree.apply_mutations(vec![mutations]);
     let _to_rerender = tree.update_state(&vdom, nodes_updated, &mut 42, &mut 42);
@@ -178,12 +178,12 @@ fn tree_state_reduce_initally_called_minimally() {
         }
     });
 
-    let mut tree: ClientTree<CallCounter, CallCounter> = ClientTree::new();
+    let mut tree: RealDom<CallCounter, CallCounter> = RealDom::new();
 
     let nodes_updated = tree.apply_mutations(vec![mutations]);
     let _to_rerender = tree.update_state(&vdom, nodes_updated, &mut (), &mut ());
 
-    tree.traverse(|n| {
+    tree.traverse_depth_first(|n| {
         assert_eq!(n.up_state.0, 1);
         assert_eq!(n.down_state.0, 1);
     });
@@ -233,7 +233,7 @@ fn tree_state_reduce_down_called_minimally_on_update() {
         }
     });
 
-    let mut tree: ClientTree<CallCounter, CallCounter> = ClientTree::new();
+    let mut tree: RealDom<CallCounter, CallCounter> = RealDom::new();
 
     let nodes_updated = tree.apply_mutations(vec![mutations]);
     let _to_rerender = tree.update_state(&vdom, nodes_updated, &mut (), &mut ());
@@ -249,7 +249,7 @@ fn tree_state_reduce_down_called_minimally_on_update() {
     }]);
     let _to_rerender = tree.update_state(&vdom, nodes_updated, &mut (), &mut ());
 
-    tree.traverse(|n| {
+    tree.traverse_depth_first(|n| {
         assert_eq!(n.down_state.0, 2);
     });
 }
@@ -298,7 +298,7 @@ fn tree_state_reduce_up_called_minimally_on_update() {
         }
     });
 
-    let mut tree: ClientTree<CallCounter, CallCounter> = ClientTree::new();
+    let mut tree: RealDom<CallCounter, CallCounter> = RealDom::new();
 
     let nodes_updated = tree.apply_mutations(vec![mutations]);
     let _to_rerender = tree.update_state(&vdom, nodes_updated, &mut (), &mut ());
@@ -314,7 +314,7 @@ fn tree_state_reduce_up_called_minimally_on_update() {
     }]);
     let _to_rerender = tree.update_state(&vdom, nodes_updated, &mut (), &mut ());
 
-    tree.traverse(|n| {
+    tree.traverse_depth_first(|n| {
         assert_eq!(n.up_state.0, if n.id.0 > 4 { 1 } else { 2 });
     });
 }