1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
use crate::*;
/// Implementation of the virtual DOM renderer.
impl Renderer {
/// Renders the given virtual DOM tree into the real DOM.
///
/// If a previous tree exists, patches the existing DOM to match the new tree.
/// Otherwise, creates new DOM nodes from scratch and appends them to the root.
///
/// # Arguments
///
/// - `VirtualNode`: The new virtual DOM tree to render.
pub fn render(&mut self, vnode: VirtualNode) {
let new_unwrapped: VirtualNode = self.unwrap_component(&vnode);
let old_tree: Option<VirtualNode> = self.try_get_current_tree().clone();
if let Some(old_vnode) = old_tree {
self.patch_root(&old_vnode, &new_unwrapped);
} else {
while let Some(child) = self.get_root().first_child() {
if let Some(element) = child.dyn_ref::<Element>() {
self.cleanup_dom_subtree(element);
}
self.get_root().remove_child(&child).unwrap();
}
let dom_node: Node = self.create_dom_node(&new_unwrapped);
self.get_root().append_child(&dom_node).unwrap();
}
self.set_current_tree(Some(new_unwrapped));
}
/// Renders the given virtual DOM tree into the real DOM by fully replacing
/// all existing content. Used when a match arm switch occurs (e.g. route
/// change) where incremental patching would incorrectly align unrelated
/// child nodes from the previous arm.
///
/// # Arguments
///
/// - `VirtualNode`: The new virtual DOM tree to render.
pub fn render_full_replace(&mut self, vnode: VirtualNode) {
let new_unwrapped: VirtualNode = self.unwrap_component(&vnode);
while let Some(child) = self.get_root().first_child() {
if let Some(element) = child.dyn_ref::<Element>() {
self.cleanup_dom_subtree(element);
}
self.get_root().remove_child(&child).unwrap();
}
let dom_node: Node = self.create_dom_node(&new_unwrapped);
self.get_root().append_child(&dom_node).unwrap();
self.set_current_tree(Some(new_unwrapped));
}
/// Patches the root DOM tree by replacing the single child of `self.root`.
///
/// # Arguments
///
/// - `&VirtualNode`: The old virtual node to patch from.
/// - `&VirtualNode`: The new virtual node to patch to.
fn patch_root(&mut self, old_node: &VirtualNode, new_node: &VirtualNode) {
let dom_child: Option<Node> = self.get_root().first_child();
let is_element: bool = if let Some(ref dom_child) = dom_child {
dom_child.dyn_ref::<Element>().is_some()
} else {
false
};
if is_element {
let element: Element = dom_child.unwrap().dyn_into::<Element>().unwrap();
self.patch_node(old_node, new_node, &element);
} else if let Some(dom_child) = dom_child {
if let Some(element) = dom_child.dyn_ref::<Element>() {
self.cleanup_dom_subtree(element);
}
let new_dom: Node = self.create_dom_node(new_node);
self.get_root().replace_child(&new_dom, &dom_child).unwrap();
} else {
let new_dom: Node = self.create_dom_node(new_node);
self.get_root().append_child(&new_dom).unwrap();
}
}
/// Patches an existing DOM node to match the new virtual node.
///
/// # Arguments
///
/// - `&VirtualNode`: The old virtual node.
/// - `&VirtualNode`: The new virtual node.
/// - `&Element`: The real DOM element to patch.
fn patch_node(
&mut self,
old_node: &VirtualNode,
new_node: &VirtualNode,
dom_element: &Element,
) {
match (old_node, new_node) {
(VirtualNode::Text(old_text), VirtualNode::Text(new_text)) => {
if old_text != new_text {
dom_element.set_text_content(Some(new_text.get_content()));
}
}
(
VirtualNode::Element {
tag: old_tag,
attributes: old_attrs,
children: old_children,
key: _old_key,
},
VirtualNode::Element {
tag: new_tag,
attributes: new_attrs,
children: new_children,
key: _new_key,
},
) => {
if old_tag != new_tag {
let new_dom: Node = self.create_dom_node(new_node);
if let Some(parent) = dom_element.parent_node() {
self.cleanup_dom_subtree(dom_element);
parent.replace_child(&new_dom, dom_element).unwrap();
}
return;
}
self.patch_attributes(dom_element, old_attrs, new_attrs);
self.patch_children(dom_element, old_children, new_children);
}
(VirtualNode::Fragment(old_children), VirtualNode::Fragment(new_children)) => {
self.patch_children(dom_element, old_children, new_children);
}
(VirtualNode::Dynamic(_), VirtualNode::Dynamic(_)) => {}
(VirtualNode::Dynamic(_), _) => {
let new_dom: Node = self.create_dom_node(new_node);
if let Some(parent) = dom_element.parent_node() {
self.cleanup_dom_subtree(dom_element);
parent.replace_child(&new_dom, dom_element).unwrap();
}
}
(_, VirtualNode::Dynamic(_)) => {
let new_dom: Node = self.create_dom_node(new_node);
if let Some(parent) = dom_element.parent_node() {
self.cleanup_dom_subtree(dom_element);
parent.replace_child(&new_dom, dom_element).unwrap();
}
}
_ => {
let new_dom: Node = self.create_dom_node(new_node);
if let Some(parent) = dom_element.parent_node() {
self.cleanup_dom_subtree(dom_element);
parent.replace_child(&new_dom, dom_element).unwrap();
}
}
}
}
/// Patches attributes of an element, adding, removing, or updating as needed.
///
/// # Arguments
///
/// - `&Element`: The DOM element whose attributes to patch.
/// - `&[AttributeEntry]`: The old attribute list.
/// - `&[AttributeEntry]`: The new attribute list.
fn patch_attributes(
&mut self,
element: &Element,
old_attrs: &[AttributeEntry],
new_attrs: &[AttributeEntry],
) {
let old_map: HashMap<&str, &AttributeValue> = old_attrs
.iter()
.map(|attr: &AttributeEntry| (attr.get_name().as_str(), attr.get_value()))
.collect();
let new_map: HashMap<&str, ()> = new_attrs
.iter()
.map(|attr: &AttributeEntry| (attr.get_name().as_str(), ()))
.collect();
for old_attr in old_attrs {
if !new_map.contains_key(old_attr.get_name().as_str()) {
if let AttributeValue::Event(_) = old_attr.get_value()
&& let Some(euv_id_str) = element.get_attribute(DATA_EUV_ID)
&& let Ok(euv_id) = euv_id_str.parse::<usize>()
{
cleanup_event_handler(euv_id, old_attr.get_name());
}
remove_dom_attribute_or_property(element, old_attr.get_name());
}
}
for new_attr in new_attrs {
let old_value: Option<&AttributeValue> =
old_map.get(new_attr.get_name().as_str()).copied();
let should_set: bool = match old_value {
Some(old_val) => old_val != new_attr.get_value(),
None => true,
};
if should_set {
match new_attr.get_value() {
AttributeValue::Text(value) => {
if value.is_empty() {
remove_dom_attribute_or_property(element, new_attr.get_name());
} else {
set_dom_attribute_or_property(element, new_attr.get_name(), value);
}
}
AttributeValue::Signal(signal) => {
let value: String = signal.get();
if value.is_empty() && !is_boolean_property(new_attr.get_name()) {
remove_dom_attribute_or_property(element, new_attr.get_name());
} else {
set_dom_attribute_or_property(element, new_attr.get_name(), &value);
}
}
AttributeValue::Event(handler) => {
self.attach_event_listener(element, handler);
}
AttributeValue::Dynamic(_) => {}
AttributeValue::Css(css_class) => {
css_class.inject_style();
set_dom_attribute_or_property(
element,
new_attr.get_name(),
css_class.get_name(),
);
}
}
}
}
}
/// Gets a child node at the given index.
///
/// # Arguments
///
/// - `&Element`: The parent element.
/// - `u32`: The child index.
///
/// # Returns
///
/// - `Option<Node>`: The child node at the given index, if it exists.
fn get_child_node(parent: &Element, index: u32) -> Option<Node> {
parent.child_nodes().get(index)
}
/// Patches children of an element using a keyed diff algorithm when keys
/// are available, falling back to positional diff when no keys exist.
///
/// When all children in both old and new lists have keys, this method
/// builds a key-to-index map and applies a minimal set of DOM moves,
/// insertions, and removals. This avoids the O(N) per-child re-patch
/// that the naive positional algorithm incurs when items are reordered.
///
/// # Arguments
///
/// - `&Element`: The parent DOM element.
/// - `&[VirtualNode]`: The old children list.
/// - `&[VirtualNode]`: The new children list.
fn patch_children(
&mut self,
parent: &Element,
old_children: &[VirtualNode],
new_children: &[VirtualNode],
) {
let old_has_keys: bool =
!old_children.is_empty() && old_children.iter().all(Self::node_has_key);
let new_has_keys: bool =
!new_children.is_empty() && new_children.iter().all(Self::node_has_key);
if old_has_keys && new_has_keys {
self.patch_children_keyed(parent, old_children, new_children);
} else {
self.patch_children_positional(parent, old_children, new_children);
}
}
/// Returns `true` if the virtual node has a non-empty key.
///
/// # Arguments
///
/// - `&VirtualNode`: The node to check.
///
/// # Returns
///
/// - `bool`: Whether the node has a key.
fn node_has_key(node: &VirtualNode) -> bool {
match node {
VirtualNode::Element { key, .. } => key.is_some(),
_ => false,
}
}
/// Extracts the key from a virtual node.
///
/// # Arguments
///
/// - `&VirtualNode`: The node to extract the key from.
///
/// # Returns
///
/// - `Option<&str>`: The key string, if present.
fn get_node_key(node: &VirtualNode) -> Option<&str> {
match node {
VirtualNode::Element { key, .. } => key.as_deref(),
_ => None,
}
}
/// Keyed diffing algorithm that minimizes DOM operations.
///
/// Builds a mapping from old keys to their DOM indices, then walks the
/// new children list. For each new child:
///
/// - If its key existed in the old list, patches the existing DOM node.
/// - Otherwise, creates a new DOM node.
///
/// After processing all new children, removes any old DOM nodes whose
/// keys are no longer present in the new list.
///
/// # Arguments
///
/// - `&Element`: The parent DOM element.
/// - `&[VirtualNode]`: The old children list.
/// - `&[VirtualNode]`: The new children list.
fn patch_children_keyed(
&mut self,
parent: &Element,
old_children: &[VirtualNode],
new_children: &[VirtualNode],
) {
let mut old_key_map: HashMap<&str, usize> = HashMap::with_capacity(old_children.len());
for (index, old_child) in old_children.iter().enumerate() {
if let Some(key) = Self::get_node_key(old_child) {
old_key_map.insert(key, index);
}
}
let mut reused_indices: HashSet<usize> = HashSet::with_capacity(new_children.len());
let child_nodes: NodeList = parent.child_nodes();
let dom_child_count: u32 = child_nodes.length();
for (new_index, new_child) in new_children.iter().enumerate() {
let new_key: &str = Self::get_node_key(new_child).unwrap_or("");
if let Some(&old_index) = old_key_map.get(new_key) {
reused_indices.insert(old_index);
let old_child: &VirtualNode = &old_children[old_index];
let mapped_dom_index: u32 = old_index as u32;
if mapped_dom_index < dom_child_count
&& let Some(dom_node) = child_nodes.get(mapped_dom_index)
&& let Some(element) = dom_node.dyn_ref::<Element>()
{
self.patch_node(old_child, new_child, element);
}
let current_dom_index: u32 = new_index as u32;
if mapped_dom_index != current_dom_index
&& current_dom_index < dom_child_count
&& let Some(dom_node) = child_nodes.get(mapped_dom_index)
{
if let Some(reference_node) = child_nodes.get(current_dom_index) {
let _ = parent.insert_before(&dom_node, Some(&reference_node));
} else {
let _ = parent.append_child(&dom_node);
}
}
} else {
let new_dom: Node = self.create_dom_node(new_child);
if (new_index as u32) < dom_child_count
&& let Some(reference_node) = child_nodes.get(new_index as u32)
{
let _ = parent.insert_before(&new_dom, Some(&reference_node));
} else {
let _ = parent.append_child(&new_dom);
}
}
}
let mut indices_to_remove: Vec<usize> = Vec::new();
for (index, old_child) in old_children.iter().enumerate() {
if !reused_indices.contains(&index) {
indices_to_remove.push(index);
}
let _ = old_child;
}
indices_to_remove.sort_unstable_by(|a: &usize, b: &usize| b.cmp(a));
for old_index in indices_to_remove {
let mapped_dom_index: u32 = old_index as u32;
if mapped_dom_index < parent.child_nodes().length()
&& let Some(dom_node) = parent.child_nodes().get(mapped_dom_index)
{
if let Some(element) = dom_node.dyn_ref::<Element>() {
self.cleanup_dom_subtree(element);
}
let _ = parent.remove_child(&dom_node);
}
}
}
/// Positional diffing algorithm (original behavior).
///
/// Patches children by index position. Used as a fallback when keys
/// are not available on all children.
///
/// # Arguments
///
/// - `&Element`: The parent DOM element.
/// - `&[VirtualNode]`: The old children list.
/// - `&[VirtualNode]`: The new children list.
fn patch_children_positional(
&mut self,
parent: &Element,
old_children: &[VirtualNode],
new_children: &[VirtualNode],
) {
let old_len: usize = old_children.len();
let new_len: usize = new_children.len();
let common_len: usize = old_len.min(new_len);
for index in 0..common_len {
let old_child: &VirtualNode = &old_children[index];
let new_child: &VirtualNode = &new_children[index];
if let Some(dom_child) = Self::get_child_node(parent, index as u32) {
if let Some(element) = dom_child.dyn_ref::<Element>() {
self.patch_node(old_child, new_child, element);
} else if let (VirtualNode::Text(old_text), VirtualNode::Text(new_text)) =
(old_child, new_child)
{
if old_text != new_text {
dom_child.set_text_content(Some(new_text.get_content()));
}
} else {
let new_dom: Node = self.create_dom_node(new_child);
if let Some(parent_node) = dom_child.parent_node() {
if let Some(child_element) = dom_child.dyn_ref::<Element>() {
self.cleanup_dom_subtree(child_element);
}
let _ = parent_node.replace_child(&new_dom, &dom_child);
}
}
}
}
if new_len > old_len {
for new_child in new_children.iter().skip(common_len) {
let new_dom: Node = self.create_dom_node(new_child);
parent.append_child(&new_dom).unwrap();
}
} else if old_len > new_len {
for _ in common_len..old_len {
if let Some(last_child) = parent.last_child()
&& let Some(element) = last_child.dyn_ref::<Element>()
{
self.cleanup_dom_subtree(element);
}
if let Some(last_child) = parent.last_child() {
parent.remove_child(&last_child).unwrap();
}
}
}
}
/// Creates a real DOM node from a virtual node.
///
/// # Arguments
///
/// - `&VirtualNode`: The virtual node to materialize.
///
/// # Returns
///
/// - `Node`: The created DOM node.
///
/// # Panics
///
/// Panics if `window()` or `document()` is unavailable.
fn create_dom_node(&mut self, node: &VirtualNode) -> Node {
let document: Document = window().unwrap().document().unwrap();
self.create_dom_node_with_document(node, &document)
}
/// Creates a real DOM node using a pre-acquired document reference.
///
/// # Arguments
///
/// - `&VirtualNode`: The virtual node to materialize.
/// - `&Document`: The document reference for creating DOM elements.
///
/// # Returns
///
/// - `Node`: The created DOM node.
fn create_dom_node_with_document(&mut self, node: &VirtualNode, document: &Document) -> Node {
match node {
VirtualNode::Element {
tag,
attributes,
children,
..
} => {
let element: Element = match tag {
Tag::Element(name) => document.create_element(name).unwrap(),
Tag::Component(_) => {
let unwrapped: VirtualNode = self.unwrap_component(node);
return self.create_dom_node_with_document(&unwrapped, document);
}
};
for attr in attributes {
match attr.get_value() {
AttributeValue::Text(value) => {
if !value.is_empty() || is_boolean_property(attr.get_name()) {
set_dom_attribute_or_property(&element, attr.get_name(), value);
}
}
AttributeValue::Signal(signal) => {
let initial_value: String = signal.get();
if !initial_value.is_empty() || is_boolean_property(attr.get_name()) {
set_dom_attribute_or_property(
&element,
attr.get_name(),
&initial_value,
);
}
let signal_addr: usize = signal.get_inner_addr();
let existing_addrs: String = element
.get_attribute("data-euv-signal-addrs")
.unwrap_or_default();
let updated_addrs: String = if existing_addrs.is_empty() {
signal_addr.to_string()
} else {
format!("{},{}", existing_addrs, signal_addr)
};
let _ = element.set_attribute("data-euv-signal-addrs", &updated_addrs);
let attr_name: String = attr.get_name().clone();
let element_clone: Element = element.clone();
let signal_for_sub: Signal<String> = *signal;
let sub_signal: Signal<String> = signal_for_sub;
signal_for_sub.replace_subscribe(move || {
if !is_node_connected(&element_clone) {
sub_signal.clear_listeners();
return;
}
let new_value: String = sub_signal.get();
if new_value.is_empty() && !is_boolean_property(&attr_name) {
remove_dom_attribute_or_property(&element_clone, &attr_name);
} else {
set_dom_attribute_or_property(
&element_clone,
&attr_name,
&new_value,
);
}
});
}
AttributeValue::Event(handler) => {
self.attach_event_listener(&element, handler);
}
AttributeValue::Dynamic(_) => {}
AttributeValue::Css(css_class) => {
css_class.inject_style();
set_dom_attribute_or_property(
&element,
attr.get_name(),
css_class.get_name(),
);
}
}
}
for child in children {
let child_node: Node = self.create_dom_node_with_document(child, document);
element.append_child(&child_node).unwrap();
}
element.into()
}
VirtualNode::Text(text_node) => {
let text: Text = document.create_text_node(text_node.get_content());
if let Some(signal) = text_node.try_get_signal() {
let text_clone: Text = text.clone();
let signal_clone: Signal<String> = *signal;
let sub_signal: Signal<String> = signal_clone;
signal_clone.replace_subscribe({
move || {
if !is_node_connected(&text_clone) {
sub_signal.clear_listeners();
return;
}
let new_value: String = sub_signal.get();
text_clone.set_text_content(Some(&new_value));
}
});
}
text.into()
}
VirtualNode::Fragment(children) => {
let fragment: Element = document.create_element("slot").unwrap();
let _ = fragment.set_attribute("style", "display:contents");
for child in children {
let child_node: Node = self.create_dom_node_with_document(child, document);
fragment.append_child(&child_node).unwrap();
}
fragment.into()
}
VirtualNode::Dynamic(dynamic_node) => {
let placeholder: Element = document.create_element("div").unwrap();
let style: &str = "display: contents;";
let _ = placeholder.set_attribute("style", style);
let dynamic_id: usize = Self::assign_dynamic_id(&placeholder);
let initial_dom: Node =
self.setup_dynamic_node(dynamic_node, dynamic_id, &placeholder, true);
placeholder.append_child(&initial_dom).unwrap();
placeholder.into()
}
VirtualNode::Empty => document.create_text_node("").into(),
}
}
/// Initializes a DynamicNode: runs the initial render, creates a sub-renderer,
/// and registers the re-render callback in the signal update registry.
///
/// # Arguments
///
/// - `&DynamicNode`: The dynamic node to set up.
/// - `usize`: The unique dynamic ID assigned to the placeholder.
/// - `&Element`: The placeholder DOM element.
/// - `bool`: Whether to skip rendering if the output is unchanged.
///
/// # Returns
///
/// - `Node`: The initial rendered DOM node.
fn setup_dynamic_node(
&mut self,
dynamic_node: &DynamicNode,
dynamic_id: usize,
placeholder: &Element,
skip_equal: bool,
) -> Node {
let mut hook_context: HookContext = dynamic_node.get_hook_context_value();
hook_context.reset_hook_index();
let initial_vnode: VirtualNode =
with_hook_context(hook_context.clone(), || dynamic_node.render());
let initial_unwrapped: VirtualNode = self.unwrap_component(&initial_vnode);
let initial_dom: Node = self.create_dom_node(&initial_unwrapped);
let render_fn: Rc<RefCell<RenderFnInner>> = dynamic_node.get_render_fn().clone();
let placeholder_clone: Element = placeholder.clone();
let mut renderer_for_sub: Renderer = Renderer::new(placeholder_clone.clone());
renderer_for_sub.set_current_tree(Some(initial_unwrapped));
let renderer_rc: Rc<RefCell<Renderer>> = Rc::new(RefCell::new(renderer_for_sub));
let initial_arm: usize = hook_context.get_inner().borrow().get_arm_changed();
let last_arm: Rc<RefCell<usize>> = Rc::new(RefCell::new(initial_arm));
let callback: Box<dyn FnMut()> = Box::new(move || {
if placeholder_clone.parent_node().is_none() {
return;
}
hook_context.reset_hook_index();
let prev_arm: usize = *last_arm.borrow();
let new_vnode: VirtualNode = with_hook_context(hook_context.clone(), || {
let mut inner: RefMut<RenderFnInner> = render_fn.borrow_mut();
(inner.get_mut_render_fn())()
});
let current_arm: usize = hook_context.get_inner().borrow().get_arm_changed();
let arm_switched: bool = prev_arm != current_arm;
*last_arm.borrow_mut() = current_arm;
if skip_equal && !arm_switched {
let renderer_ref: Ref<Renderer> = renderer_rc.borrow();
if let Some(old_vnode) = renderer_ref.try_get_current_tree() {
let new_unwrapped: VirtualNode = Renderer::unwrap_component_static(&new_vnode);
if Renderer::visual_eq(old_vnode, &new_unwrapped) {
return;
}
}
}
let mut renderer_mut: RefMut<Renderer> = renderer_rc.borrow_mut();
if arm_switched {
renderer_mut.render_full_replace(new_vnode);
} else {
renderer_mut.render(new_vnode);
}
});
register_dynamic_listener(dynamic_id, callback);
initial_dom
}
/// Recursively unwraps component nodes into their rendered output.
///
/// # Arguments
///
/// - `&VirtualNode`: The virtual node to unwrap.
///
/// # Returns
///
/// - `VirtualNode`: The unwrapped virtual node with all components expanded.
fn unwrap_component(&self, node: &VirtualNode) -> VirtualNode {
match node {
VirtualNode::Element {
tag: Tag::Component(_),
children,
..
} => {
if children.len() == 1 {
self.unwrap_component(&children[0])
} else {
VirtualNode::Fragment(children.clone())
}
}
VirtualNode::Element {
tag,
attributes,
children,
key,
} => {
if !children.iter().any(Self::subtree_has_component) {
return node.clone();
}
let unwrapped_children: Vec<VirtualNode> = children
.iter()
.map(|child| self.unwrap_component(child))
.collect();
VirtualNode::Element {
tag: tag.clone(),
attributes: attributes.clone(),
children: unwrapped_children,
key: key.clone(),
}
}
VirtualNode::Fragment(children) => {
if !children.iter().any(Self::subtree_has_component) {
return node.clone();
}
let unwrapped_children: Vec<VirtualNode> = children
.iter()
.map(|child| self.unwrap_component(child))
.collect();
VirtualNode::Fragment(unwrapped_children)
}
other => other.clone(),
}
}
/// Static version of `unwrap_component`.
///
/// # Arguments
///
/// - `&VirtualNode`: The virtual node to unwrap.
///
/// # Returns
///
/// - `VirtualNode`: The unwrapped virtual node with all components expanded.
fn unwrap_component_static(node: &VirtualNode) -> VirtualNode {
match node {
VirtualNode::Element {
tag: Tag::Component(_),
children,
..
} => {
if children.len() == 1 {
Self::unwrap_component_static(&children[0])
} else {
VirtualNode::Fragment(children.clone())
}
}
VirtualNode::Element {
tag,
attributes,
children,
key,
} => {
if !children.iter().any(Self::subtree_has_component) {
return node.clone();
}
let unwrapped_children: Vec<VirtualNode> =
children.iter().map(Self::unwrap_component_static).collect();
VirtualNode::Element {
tag: tag.clone(),
attributes: attributes.clone(),
children: unwrapped_children,
key: key.clone(),
}
}
VirtualNode::Fragment(children) => {
if !children.iter().any(Self::subtree_has_component) {
return node.clone();
}
let unwrapped_children: Vec<VirtualNode> =
children.iter().map(Self::unwrap_component_static).collect();
VirtualNode::Fragment(unwrapped_children)
}
other => other.clone(),
}
}
/// Returns `true` if the given subtree contains any `Tag::Component` nodes
/// that need unwrapping.
///
/// # Arguments
///
/// - `&VirtualNode`: The virtual node to check.
///
/// # Returns
///
/// - `bool`: `true` if the subtree contains a component node.
fn subtree_has_component(node: &VirtualNode) -> bool {
match node {
VirtualNode::Element {
tag: Tag::Component(_),
..
} => true,
VirtualNode::Element { children, .. } => {
children.iter().any(Self::subtree_has_component)
}
VirtualNode::Fragment(children) => children.iter().any(Self::subtree_has_component),
_ => false,
}
}
/// Performs a visual equality comparison between two virtual node trees.
///
/// Unlike `PartialEq`, this method recursively unwraps `VirtualNode::Dynamic`
/// nodes by rendering their inner content and comparing the visual output.
/// This is used by the `skip_equal` optimization in `setup_dynamic_node`
/// to avoid unnecessary DOM patches when the rendered output is unchanged.
///
/// # Arguments
///
/// - `&VirtualNode`: The old virtual node.
/// - `&VirtualNode`: The new virtual node.
///
/// # Returns
///
/// - `bool`: `true` if the two nodes produce the same visual output.
fn visual_eq(old_node: &VirtualNode, new_node: &VirtualNode) -> bool {
match (old_node, new_node) {
(VirtualNode::Text(old_text), VirtualNode::Text(new_text)) => old_text == new_text,
(
VirtualNode::Element {
tag: old_tag,
attributes: old_attrs,
children: old_children,
..
},
VirtualNode::Element {
tag: new_tag,
attributes: new_attrs,
children: new_children,
..
},
) => {
old_tag == new_tag
&& old_attrs.len() == new_attrs.len()
&& old_attrs
.iter()
.zip(new_attrs.iter())
.all(|(old_attr, new_attr)| old_attr == new_attr)
&& old_children.len() == new_children.len()
&& old_children
.iter()
.zip(new_children.iter())
.all(|(old_child, new_child)| Self::visual_eq(old_child, new_child))
}
(VirtualNode::Fragment(old_children), VirtualNode::Fragment(new_children)) => {
old_children.len() == new_children.len()
&& old_children
.iter()
.zip(new_children.iter())
.all(|(old_child, new_child)| Self::visual_eq(old_child, new_child))
}
(VirtualNode::Dynamic(_), VirtualNode::Dynamic(_)) => true,
(VirtualNode::Empty, VirtualNode::Empty) => true,
_ => false,
}
}
/// Assigns a new `data-euv-dynamic-id` to a newly created DynamicNode placeholder.
///
/// # Arguments
///
/// - `&Element`: The placeholder DOM element.
///
/// # Returns
///
/// - `usize`: The assigned dynamic ID.
fn assign_dynamic_id(placeholder: &Element) -> usize {
let dynamic_id: usize = NEXT_EUV_DYNAMIC_ID.fetch_add(1, Ordering::Relaxed);
let _ = placeholder.set_attribute("data-euv-dynamic-id", &dynamic_id.to_string());
dynamic_id
}
/// Recursively cleans up framework resources associated with a DOM subtree.
///
/// Removes event handlers, dynamic node listeners, and signal listeners
/// for the given element and all of its descendants.
///
/// # Arguments
///
/// - `&Element`: The DOM element to clean up.
fn cleanup_dom_subtree(&self, element: &Element) {
if let Some(euv_id_str) = element.get_attribute(DATA_EUV_ID)
&& let Ok(euv_id) = euv_id_str.parse::<usize>()
{
cleanup_element_handlers(euv_id);
}
if let Some(dynamic_id_str) = element.get_attribute("data-euv-dynamic-id")
&& let Ok(dynamic_id) = dynamic_id_str.parse::<usize>()
{
cleanup_dynamic_node(dynamic_id);
}
if let Some(signal_addrs_str) = element.get_attribute("data-euv-signal-addrs") {
for addr_str in signal_addrs_str.split(',') {
if let Ok(addr) = addr_str.parse::<usize>() {
clear_signal_listeners_by_addr(addr);
}
}
}
let child_nodes: NodeList = element.child_nodes();
let length: u32 = child_nodes.length();
for i in 0..length {
if let Some(child) = child_nodes.get(i) {
if let Some(child_element) = child.dyn_ref::<Element>() {
self.cleanup_dom_subtree(child_element);
} else if let Some(text) = child.dyn_ref::<Text>() {
cleanup_text_signal_listeners(text);
}
}
}
}
/// Registers an event handler for a DOM element using global event delegation.
///
/// # Arguments
///
/// - `&Element`: The DOM element to attach the handler to.
/// - `&NativeEventHandler`: The event handler to register.
fn attach_event_listener(&self, element: &Element, handler: &NativeEventHandler) {
let euv_id: usize = match element.get_attribute(DATA_EUV_ID) {
Some(id_str) => id_str.parse::<usize>().unwrap_or_else(|_| {
let new_id: usize = NEXT_EUV_ID.fetch_add(1, Ordering::Relaxed);
let _ = element.set_attribute(DATA_EUV_ID, &new_id.to_string());
new_id
}),
None => {
let new_id: usize = NEXT_EUV_ID.fetch_add(1, Ordering::Relaxed);
let _ = element.set_attribute(DATA_EUV_ID, &new_id.to_string());
new_id
}
};
let event_name: Cow<'static, str> = handler.get_event_name().clone();
if !NativeEventName::DELEGATABLE_EVENT_NAMES.contains(&&*event_name) {
ensure_delegated_listener(event_name.clone());
}
let key: (usize, Cow<'static, str>) = (euv_id, event_name);
let registry_ref: &mut HashMap<(usize, Cow<'static, str>), HandlerEntry> =
ensure_handler_registry_mut();
if let Some(existing_entry) = registry_ref.get(&key) {
let mut slot: RefMut<HandlerSlot> = existing_entry.borrow_mut();
slot.set_handler(Some(handler.clone()));
} else {
let handler_slot: HandlerEntry =
Rc::new(RefCell::new(HandlerSlot::new(Some(handler.clone()))));
registry_ref.insert(key, handler_slot);
}
}
}