diffing.rs 8.1 KB

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