summaryrefslogtreecommitdiffstats
path: root/pure/src/widget/tree.rs
blob: 75f50a2fc8c6c30d272b1940c8a263d5dcede56d (plain) (blame)
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
use crate::widget::Element;

use std::any::Any;
use std::marker::PhantomData;

pub struct Tree<Message, Renderer> {
    pub state: Box<dyn Any>,
    pub children: Vec<Tree<Message, Renderer>>,
    types_: PhantomData<(Message, Renderer)>,
}

impl<Message, Renderer> Tree<Message, Renderer> {
    pub fn new(element: &Element<Message, Renderer>) -> Self {
        Self {
            state: element.as_widget().state(),
            children: element
                .as_widget()
                .children()
                .iter()
                .map(Self::new)
                .collect(),
            types_: PhantomData,
        }
    }

    pub fn diff(
        &mut self,
        current: &Element<Message, Renderer>,
        new: &Element<Message, Renderer>,
    ) {
        if current.as_widget().tag() == new.as_widget().tag() {
            let current_children = current.as_widget().children();
            let new_children = new.as_widget().children();

            if current_children.len() > new_children.len() {
                self.children.truncate(new_children.len());
            }

            for (child_state, (current, new)) in self
                .children
                .iter_mut()
                .zip(current_children.iter().zip(new_children.iter()))
            {
                child_state.diff(current, new);
            }

            if current_children.len() < new_children.len() {
                self.children.extend(
                    new_children[current_children.len()..]
                        .iter()
                        .map(Self::new),
                );
            }
        } else {
            *self = Self::new(new);
        }
    }
}