@@ -4,7 +4,7 @@ use std::{
44} ;
55use crate :: {
66 id_tree:: { NodeId , NodeDataContainer } ,
7- dom:: { Dom , NodeData } ,
7+ dom:: { CompactDom , NodeData } ,
88} ;
99
1010#[ derive( Copy , Clone , PartialEq , Eq , PartialOrd , Ord , Hash ) ]
@@ -64,7 +64,7 @@ pub struct DomDiff {
6464}
6565
6666impl DomDiff {
67- pub fn new < T > ( old : & Dom < T > , new : & Dom < T > ) -> Self {
67+ pub fn new < T > ( old : & CompactDom < T > , new : & CompactDom < T > ) -> Self {
6868
6969 // TODO: Check if old root = new root, if not, change entire tree
7070
@@ -107,7 +107,7 @@ impl DomDiff {
107107 }
108108
109109 /// Formats the diff into a git-like `+ Node1 / - Node3` form
110- pub fn format_nicely < T > ( & self , old : & Dom < T > , new : & Dom < T > ) -> String {
110+ pub fn format_nicely < T > ( & self , old : & CompactDom < T > , new : & CompactDom < T > ) -> String {
111111 use self :: DomChange :: * ;
112112 self . changed_nodes . iter ( ) . map ( |change| {
113113 match change {
@@ -176,8 +176,8 @@ fn node_has_changed<T>(old: &NodeData<T>, new: &NodeData<T>) -> u8 {
176176
177177fn diff_tree_inner < T > (
178178 old_root_id : NodeId ,
179- old : & Dom < T > ,
180- new : & Dom < T > ,
179+ old : & CompactDom < T > ,
180+ new : & CompactDom < T > ,
181181 changes : & mut BTreeSet < DomChange > ,
182182 visited_nodes : & mut NodeDataContainer < bool > ,
183183) {
0 commit comments