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

pub use euclid::Rect;
use rustc_hash::FxHashSet;

use crate::{
    geometry::{Area, Size2D},
    node::Node,
    prelude::{BoxModel, Gaps},
};

/// Cached layout results of a Node
#[derive(Debug, PartialEq, Clone, Default)]
pub struct NodeAreas {
    /// Area that ocuppies this node
    pub area: Area,

    /// Area inside this Node
    pub inner_area: Area,

    /// Ocuppied sizes from the inner children in this Node
    pub inner_sizes: Size2D,

    /// Outer margin
    pub margin: Gaps,
}

impl NodeAreas {
    // The area without any outer gap (e.g margin)
    pub fn box_area(&self) -> Area {
        self.area.box_area(&self.margin)
    }
}

pub trait NodeKey: Clone + PartialEq + Eq + std::hash::Hash + Copy + std::fmt::Debug {}

impl NodeKey for usize {}

#[cfg(feature = "dioxus")]
impl NodeKey for dioxus_native_core::NodeId {}

pub trait DOMAdapter<NodeKey> {
    /// Get the Node size
    fn get_node(&self, node_id: &NodeKey) -> Option<Node>;

    /// Get the height in the DOM of the given Node
    fn height(&self, node_id: &NodeKey) -> Option<u16>;

    /// Get the parent of a Node
    fn parent_of(&self, node_id: &NodeKey) -> Option<NodeKey>;

    /// Get the children of a Node
    fn children_of(&mut self, node_id: &NodeKey) -> Vec<NodeKey>;

    /// Check whether the given Node is valid (isn't a placeholder, unconnected node..)
    fn is_node_valid(&mut self, node_id: &NodeKey) -> bool;

    /// Get the closest common parent Node of two Nodes
    fn closest_common_parent(
        &self,
        node_id_a: &NodeKey,
        node_id_b: &NodeKey,
        root_track_patch: &mut FxHashSet<NodeKey>,
    ) -> Option<NodeKey>;
}