ferroui-base 0.1.0

The base library of FerroUI: the property system, layout, input, styling, media, text, animation, data binding and the compositor
Documentation 
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

use super::ServerCompositionVisual;
use crate::platform::LtrbRect;
use crate::rendering::composition::server::CompositorPools;
use crate::Matrix;
use std::rc::Rc;

pub(super) trait IServerTreeVisitor {
    /// Returns whether the children are to be visited.
    fn pre_subgraph(&mut self, visual: &Rc<ServerCompositionVisual>) -> bool;
    fn post_subgraph(&mut self, visual: &Rc<ServerCompositionVisual>);
}

/// A position of the tree walk: a container and the index of its child to
/// visit next.
pub struct TreeWalkerFrame {
    visual: Rc<ServerCompositionVisual>,
    children: Rc<Vec<Rc<ServerCompositionVisual>>>,
    current_index: usize,
}

/// The children of a visual, `None` for a visual without a children
/// collection (the original reads `Children.List.Count` of both alike, and
/// nothing is allocated for such a visual).
fn children_of(visual: &ServerCompositionVisual) -> Option<Rc<Vec<Rc<ServerCompositionVisual>>>> {
    visual.children().map(|children| children.list())
}

pub(super) fn walk<V: IServerTreeVisitor>(visitor: &mut V, root: &Rc<ServerCompositionVisual>, pools: &CompositorPools) {
    let mut frames = pools.tree_walker_frame_stack_pool.rent();

    let visit_children = visitor.pre_subgraph(root);
    let mut container = root.clone();
    let mut children = match children_of(&container) {
        Some(children) if visit_children && !children.is_empty() => children,
        _ => {
            visitor.post_subgraph(root);
            pools.tree_walker_frame_stack_pool.return_stack(frames);
            return;
        }
    };

    let mut current_index = 0usize;

    loop {
        if current_index >= children.len() {
            // Exiting "recursion"
            visitor.post_subgraph(&container);
            let Some(frame) = frames.pop() else { break };
            container = frame.visual;
            children = frame.children;
            current_index = frame.current_index;
            continue;
        }

        let child = children[current_index].clone();
        let visit_children = visitor.pre_subgraph(&child);
        if visit_children {
            if let Some(child_children) = children_of(&child).filter(|children| !children.is_empty()) {
                // Go deeper
                frames.push(TreeWalkerFrame { visual: container, children, current_index: current_index + 1 });
                container = child;
                children = child_children;
                current_index = 0;
                continue; // Enter "recursion"
            }
        }

        // Haven't entered recursion, still call PostSubgraph and go to the next sibling
        visitor.post_subgraph(&child);
        current_index += 1;
    }

    pools.tree_walker_frame_stack_pool.return_stack(frames);
}

pub(super) struct TreeWalkContext {
    pub(super) transform: Matrix,
    pub(super) clip: LtrbRect,
    transform_stack: Vec<Matrix>,
    clip_stack: Vec<LtrbRect>,
}

impl TreeWalkContext {
    pub(super) fn new(pools: &CompositorPools, transform: Matrix, clip: LtrbRect) -> Self {
        Self {
            transform,
            clip,
            transform_stack: pools.matrix_stack_pool.rent(),
            clip_stack: pools.ltrb_rect_stack_pool.rent(),
        }
    }

    pub(super) fn push_transform(&mut self, m: Matrix) {
        self.transform_stack.push(self.transform);
        self.transform = m * self.transform;
    }

    pub(super) fn push_set_transform(&mut self, m: Matrix) {
        self.transform_stack.push(self.transform);
        self.transform = m;
    }

    pub(super) fn push_clip(&mut self, rect: LtrbRect) {
        self.clip_stack.push(self.clip);
        self.clip = self.clip.intersect_or_empty(rect);
    }

    pub(super) fn reset_clip(&mut self, rect: LtrbRect) {
        self.clip_stack.push(self.clip);
        self.clip = rect;
    }

    pub(super) fn pop_transform(&mut self) {
        self.transform = self.transform_stack.pop().expect("a transform was pushed");
    }

    pub(super) fn pop_clip(&mut self) {
        self.clip = self.clip_stack.pop().expect("a clip was pushed");
    }

    pub(super) fn dispose(self, pools: &CompositorPools) {
        pools.matrix_stack_pool.return_stack(self.transform_stack);
        pools.ltrb_rect_stack_pool.return_stack(self.clip_stack);
    }
}