cranpose-app-shell 0.1.168

Application orchestration shell for Cranpose
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

use std::collections::HashMap;

use cranpose_core::NodeId;

#[derive(Clone, Copy, PartialEq, Eq, Hash, Debug)]
pub struct PointerId(pub u32);

impl PointerId {
    pub const PRIMARY: PointerId = PointerId(0);
}

pub struct HitPathTracker {
    paths: HashMap<PointerId, Vec<Vec<NodeId>>>,
}

impl HitPathTracker {
    pub fn new() -> Self {
        Self {
            paths: HashMap::new(),
        }
    }

    pub fn add_hit_path(&mut self, pointer: PointerId, capture_paths: Vec<Vec<NodeId>>) {
        if capture_paths.is_empty() {
            self.paths.remove(&pointer);
        } else {
            self.paths.insert(pointer, capture_paths);
        }
    }

    pub fn get_path(&self, pointer: PointerId) -> Option<&[Vec<NodeId>]> {
        self.paths.get(&pointer).map(Vec::as_slice)
    }

    pub fn dispatch_order(&self, pointer: PointerId) -> Option<Vec<NodeId>> {
        self.get_path(pointer).map(dispatch_order_for_paths)
    }

    pub fn remove_path(&mut self, pointer: PointerId) -> Option<Vec<Vec<NodeId>>> {
        self.paths.remove(&pointer)
    }

    pub fn has_path(&self, pointer: PointerId) -> bool {
        self.paths.contains_key(&pointer)
    }

    pub fn clear(&mut self) {
        self.paths.clear();
    }

    #[cfg(test)]
    pub fn is_empty(&self) -> bool {
        self.paths.is_empty()
    }
}

impl Default for HitPathTracker {
    fn default() -> Self {
        Self::new()
    }
}

#[derive(Default)]
struct DispatchNode {
    children: Vec<NodeId>,
}

pub(crate) fn dispatch_order_for_paths(paths: &[Vec<NodeId>]) -> Vec<NodeId> {
    fn push_unique(nodes: &mut Vec<NodeId>, node_id: NodeId) {
        if !nodes.contains(&node_id) {
            nodes.push(node_id);
        }
    }

    fn visit(node_id: NodeId, tree: &HashMap<NodeId, DispatchNode>, ordered: &mut Vec<NodeId>) {
        if let Some(node) = tree.get(&node_id) {
            for &child in &node.children {
                visit(child, tree, ordered);
            }
        }
        ordered.push(node_id);
    }

    let mut roots = Vec::new();
    let mut tree: HashMap<NodeId, DispatchNode> = HashMap::new();

    for path in paths {
        let mut parent = None;
        for node_id in path.iter().rev().copied() {
            tree.entry(node_id).or_default();
            if let Some(parent_id) = parent {
                let parent_node = tree.entry(parent_id).or_default();
                push_unique(&mut parent_node.children, node_id);
            } else {
                push_unique(&mut roots, node_id);
            }
            parent = Some(node_id);
        }
    }

    let mut ordered = Vec::new();
    for root in roots {
        visit(root, &tree, &mut ordered);
    }
    ordered
}

#[cfg(test)]
#[path = "tests/hit_path_tracker_tests.rs"]
mod tests;