mtk-rs 0.1.0-beta.3

Muse Toolkit
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

//! View memoization utilities for caching layout subtrees based on value equality.
//!
//! Memoization prevents unnecessary view rebuilds and layout tree diffing when input parameters
//! (`data`) remain unchanged between render passes.

use crate::{
    Context,
    ui::{Event, View, event::EventResult},
};

/// A memoized view wrapper that caches sub-view layout trees based on key equality (`T: PartialEq`).
pub struct Memoize<T, F> {
    pub(crate) data: T,
    pub(crate) builder: F,
}

/// Memoizes a view construction function.
///
/// The returned [`Memoize`] component will only rebuild its inner view if `data` compares unequal (`!=`)
/// to the key stored during the previous frame.
///
/// # Requirements
/// - `T` must implement [`PartialEq`] and [`Clone`].
///
/// # Examples
/// ```rust,ignore
/// use mtk::ui::memoize::memoize;
/// use mtk::ui::widgets::text;
///
/// let name = "Alice".to_string();
/// let view = memoize(name, |data| text(format!("Hello, {data}")));
/// ```
pub fn memoize<T, V, F>(data: T, builder: F) -> Memoize<T, F>
where
    T: PartialEq + Clone,
    F: Fn(&T) -> V,
{
    Memoize { data, builder }
}

impl<State, T, V, F> View<State> for Memoize<T, F>
where
    T: PartialEq + Clone,
    V: View<State>,
    F: Fn(&T) -> V,
{
    /// Element state tuple holding:
    /// 1 - The cached key `T` diffed against new frames.
    /// 2 - The constructed view `V`.
    /// 3 - The persistent element node state `V::Element`.
    type Element = (T, V, V::Element);
    type Message = V::Message;

    fn build(&self, ctx: &mut Context) -> Self::Element {
        let view = (self.builder)(&self.data);
        let element = view.build(ctx);
        (self.data.clone(), view, element)
    }

    fn rebuild(&self, _prev: &Self, ctx: &mut Context, element: &mut Self::Element) {
        if self.data != element.0 {
            let new_view = (self.builder)(&self.data);
            new_view.rebuild(&element.1, ctx, &mut element.2);
            element.0 = self.data.clone();
            element.1 = new_view;
        }
    }

    fn rebuild_with_parent(
        &self,
        _prev: &Self,
        ctx: &mut Context,
        element: &mut Self::Element,
        parent: crate::Node,
        next_sibling: Option<crate::Node>,
    ) {
        if self.data != element.0 {
            let new_view = (self.builder)(&self.data);
            new_view.rebuild_with_parent(&element.1, ctx, &mut element.2, parent, next_sibling);
            element.0 = self.data.clone();
            element.1 = new_view;
        }
    }

    fn teardown(&self, ctx: &mut Context, element: &mut Self::Element) {
        element.1.teardown(ctx, &mut element.2);
    }

    fn get_node(&self, element: &Self::Element) -> crate::Node {
        element.1.get_node(&element.2)
    }

    fn handle_event(
        &self,
        element: &mut Self::Element,
        state: &State,
        event: Event,
        ctx: &mut Context,
    ) -> (EventResult, Option<Self::Message>) {
        // routing the event to the cached view
        element.1.handle_event(&mut element.2, state, event, ctx)
    }
}