diffing.rs 8.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341
  1. //! Diffing Tests
  2. //! -------------
  3. //!
  4. //! These should always compile and run, but the result is not validated for each test.
  5. //! TODO: Validate the results beyond visual inspection.
  6. use bumpalo::Bump;
  7. use anyhow::{Context, Result};
  8. use dioxus::{
  9. arena::SharedResources,
  10. diff::{CreateMeta, DiffMachine},
  11. prelude::*,
  12. util::DebugDom,
  13. DomEdit,
  14. };
  15. use dioxus_core as dioxus;
  16. use dioxus_html as dioxus_elements;
  17. struct TestDom {
  18. bump: Bump,
  19. resources: SharedResources,
  20. }
  21. impl TestDom {
  22. fn new() -> TestDom {
  23. let bump = Bump::new();
  24. let resources = SharedResources::new();
  25. TestDom { bump, resources }
  26. }
  27. fn new_factory<'a>(&'a self) -> NodeFactory<'a> {
  28. NodeFactory::new(&self.bump)
  29. }
  30. fn render<'a, F>(&'a self, lazy_nodes: LazyNodes<'a, F>) -> VNode<'a>
  31. where
  32. F: FnOnce(NodeFactory<'a>) -> VNode<'a>,
  33. {
  34. use dioxus_core::nodes::{IntoVNode, IntoVNodeList};
  35. lazy_nodes.into_vnode(NodeFactory::new(&self.bump))
  36. }
  37. fn diff<'a>(&'a self, old: &'a VNode<'a>, new: &'a VNode<'a>) -> Vec<DomEdit<'a>> {
  38. let mut edits = Vec::new();
  39. let mut machine = DiffMachine::new_headless(&mut edits, &self.resources);
  40. machine.diff_node(old, new);
  41. edits
  42. }
  43. fn create<'a, F1>(&'a self, left: LazyNodes<'a, F1>) -> (CreateMeta, Vec<DomEdit<'a>>)
  44. where
  45. F1: FnOnce(NodeFactory<'a>) -> VNode<'a>,
  46. {
  47. let old = self.bump.alloc(self.render(left));
  48. let mut edits = Vec::new();
  49. let mut machine = DiffMachine::new_headless(&mut edits, &self.resources);
  50. let meta = machine.create_vnode(old);
  51. (meta, edits)
  52. }
  53. fn lazy_diff<'a, F1, F2>(
  54. &'a self,
  55. left: LazyNodes<'a, F1>,
  56. right: LazyNodes<'a, F2>,
  57. ) -> (Vec<DomEdit<'a>>, Vec<DomEdit<'a>>)
  58. where
  59. F1: FnOnce(NodeFactory<'a>) -> VNode<'a>,
  60. F2: FnOnce(NodeFactory<'a>) -> VNode<'a>,
  61. {
  62. let old = self.bump.alloc(self.render(left));
  63. let new = self.bump.alloc(self.render(right));
  64. let mut create_edits = Vec::new();
  65. let mut machine = DiffMachine::new_headless(&mut create_edits, &self.resources);
  66. machine.create_vnode(old);
  67. let mut edits = Vec::new();
  68. let mut machine = DiffMachine::new_headless(&mut edits, &self.resources);
  69. machine.diff_node(old, new);
  70. (create_edits, edits)
  71. }
  72. }
  73. #[test]
  74. fn diffing_works() {}
  75. /// Should push the text node onto the stack and modify it
  76. #[test]
  77. fn html_and_rsx_generate_the_same_output() {
  78. let dom = TestDom::new();
  79. let edits = dom.lazy_diff(
  80. rsx! ( div { "Hello world" } ),
  81. rsx! ( div { "Goodbye world" } ),
  82. );
  83. dbg!(edits);
  84. }
  85. /// Should result in 3 elements on the stack
  86. #[test]
  87. fn fragments_create_properly() {
  88. let dom = TestDom::new();
  89. let (meta, edits) = dom.create(rsx! {
  90. div { "Hello a" }
  91. div { "Hello b" }
  92. div { "Hello c" }
  93. });
  94. assert!(&edits[0].is("CreateElement"));
  95. assert!(&edits[3].is("CreateElement"));
  96. assert!(&edits[6].is("CreateElement"));
  97. assert_eq!(meta.added_to_stack, 3);
  98. dbg!(edits);
  99. }
  100. /// Should result in the creation of an anchor (placeholder) and then a replacewith
  101. #[test]
  102. fn empty_fragments_create_anchors() {
  103. let dom = TestDom::new();
  104. let left = rsx!({ (0..0).map(|f| rsx! { div {}}) });
  105. let right = rsx!({ (0..1).map(|f| rsx! { div {}}) });
  106. let edits = dom.lazy_diff(left, right);
  107. dbg!(edits);
  108. }
  109. /// Should result in the creation of an anchor (placeholder) and then a replacewith m=5
  110. #[test]
  111. fn empty_fragments_create_many_anchors() {
  112. let dom = TestDom::new();
  113. let left = rsx!({ (0..0).map(|f| rsx! { div {}}) });
  114. let right = rsx!({ (0..5).map(|f| rsx! { div {}}) });
  115. let edits = dom.lazy_diff(left, right);
  116. dbg!(edits);
  117. }
  118. /// Should result in the creation of an anchor (placeholder) and then a replacewith
  119. /// Includes child nodes inside the fragment
  120. #[test]
  121. fn empty_fragments_create_anchors_with_many_children() {
  122. let dom = TestDom::new();
  123. let left = rsx!({ (0..0).map(|f| rsx! { div {} }) });
  124. let right = rsx!({
  125. (0..5).map(|f| {
  126. rsx! { div { "hello" }}
  127. })
  128. });
  129. let edits = dom.lazy_diff(left, right);
  130. dbg!(&edits);
  131. let last_edit = edits.1.last().unwrap();
  132. assert!(last_edit.is("ReplaceWith"));
  133. }
  134. /// Should result in every node being pushed and then replaced with an anchor
  135. #[test]
  136. fn many_items_become_fragment() {
  137. let dom = TestDom::new();
  138. let left = rsx!({
  139. (0..2).map(|f| {
  140. rsx! { div { "hello" }}
  141. })
  142. });
  143. let right = rsx!({ (0..0).map(|f| rsx! { div {} }) });
  144. let edits = dom.lazy_diff(left, right);
  145. dbg!(&edits);
  146. }
  147. /// Should result in no edits
  148. #[test]
  149. fn two_equal_fragments_are_equal() {
  150. let dom = TestDom::new();
  151. let left = rsx!({
  152. (0..2).map(|f| {
  153. rsx! { div { "hello" }}
  154. })
  155. });
  156. let right = rsx!({
  157. (0..2).map(|f| {
  158. rsx! { div { "hello" }}
  159. })
  160. });
  161. let edits = dom.lazy_diff(left, right);
  162. dbg!(&edits);
  163. assert!(edits.1.is_empty());
  164. }
  165. /// Should result the creation of more nodes appended after the old last node
  166. #[test]
  167. fn two_fragments_with_differrent_elements_are_differet() {
  168. let dom = TestDom::new();
  169. let left = rsx!(
  170. {(0..2).map(|f| {rsx! { div { }}})}
  171. p {}
  172. );
  173. let right = rsx!(
  174. {(0..5).map(|f| {rsx! { h1 { }}})}
  175. p {}
  176. );
  177. let edits = dom.lazy_diff(left, right);
  178. dbg!(&edits);
  179. }
  180. /// Should result in multiple nodes destroyed - with changes to the first nodes
  181. #[test]
  182. fn two_fragments_with_differrent_elements_are_differet_shorter() {
  183. let dom = TestDom::new();
  184. let left = rsx!(
  185. {(0..5).map(|f| {rsx! { div { }}})}
  186. p {}
  187. );
  188. let right = rsx!(
  189. {(0..2).map(|f| {rsx! { h1 { }}})}
  190. p {}
  191. );
  192. let edits = dom.lazy_diff(left, right);
  193. dbg!(&edits);
  194. }
  195. /// Should result in multiple nodes destroyed - with no changes
  196. #[test]
  197. fn two_fragments_with_same_elements_are_differet() {
  198. let dom = TestDom::new();
  199. let left = rsx!(
  200. {(0..2).map(|f| {rsx! { div { }}})}
  201. p {}
  202. );
  203. let right = rsx!(
  204. {(0..5).map(|f| {rsx! { div { }}})}
  205. p {}
  206. );
  207. let edits = dom.lazy_diff(left, right);
  208. dbg!(&edits);
  209. }
  210. // Similar test from above, but with extra child nodes
  211. #[test]
  212. fn two_fragments_with_same_elements_are_differet_shorter() {
  213. let dom = TestDom::new();
  214. let left = rsx!(
  215. {(0..5).map(|f| {rsx! { div { }}})}
  216. p {"e"}
  217. );
  218. let right = rsx!(
  219. {(0..2).map(|f| {rsx! { div { }}})}
  220. p {"e"}
  221. );
  222. let edits = dom.lazy_diff(left, right);
  223. dbg!(&edits);
  224. }
  225. /// should result in the removal of elements
  226. #[test]
  227. fn keyed_diffing_order() {
  228. let dom = TestDom::new();
  229. let left = rsx!(
  230. {(0..5).map(|f| {rsx! { div { key: "{f}" }}})}
  231. p {"e"}
  232. );
  233. let right = rsx!(
  234. {(0..2).map(|f| {rsx! { div { key: "{f}" }}})}
  235. p {"e"}
  236. );
  237. let edits = dom.lazy_diff(left, right);
  238. dbg!(&edits);
  239. }
  240. #[test]
  241. fn fragment_keys() {
  242. let r = 1;
  243. let p = rsx! {
  244. Fragment { key: "asd {r}" }
  245. };
  246. }
  247. /// Should result in moves, but not removals or additions
  248. #[test]
  249. fn keyed_diffing_out_of_order() {
  250. let dom = TestDom::new();
  251. // 0, 1, 2, 3, 4, 5, 6, 7, 8,
  252. let left = rsx!({
  253. (0..3).chain(3..6).chain(6..9).map(|f| {
  254. rsx! { div { key: "{f}" }}
  255. })
  256. });
  257. // 0, 1, 2, 6, 5, 4, 3, 7, 8, 9
  258. let right = rsx!({
  259. (0..3).chain((3..7).rev()).chain(7..10).map(|f| {
  260. rsx! { div { key: "{f}" }}
  261. })
  262. });
  263. // LIS: 3, 7, 8,
  264. let edits = dom.lazy_diff(left, right);
  265. dbg!(&edits);
  266. }
  267. #[test]
  268. fn controlled_keyed_diffing_out_of_order() {
  269. let dom = TestDom::new();
  270. let left = [4, 5, 6, 7];
  271. let left = rsx!({
  272. left.iter().map(|f| {
  273. rsx! { div { key: "{f}" "{f}" }}
  274. })
  275. });
  276. // 0, 1, 2, 6, 5, 4, 3, 7, 8, 9
  277. let right = [0, 5, 9, 6, 4];
  278. let right = rsx!({
  279. right.iter().map(|f| {
  280. rsx! { div { key: "{f}" "{f}" }}
  281. })
  282. });
  283. // LIS: 3, 7, 8,
  284. let edits = dom.lazy_diff(left, right);
  285. dbg!(&edits);
  286. }