diffing.rs 8.3 KB

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