argui-accessibility 0.1.0

Native and web accessibility bridges for Argui interfaces
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

use std::collections::{HashMap, HashSet};

use argui_core::Rect;

use crate::Semantics;

#[derive(Clone, Copy, Debug, Eq, Hash, Ord, PartialEq, PartialOrd)]
pub struct SemanticNodeId(u64);

impl SemanticNodeId {
    #[must_use]
    pub const fn new(value: u64) -> Self {
        Self(value)
    }

    #[must_use]
    pub const fn get(self) -> u64 {
        self.0
    }
}

#[derive(Clone, Debug, PartialEq)]
pub struct SemanticNode {
    pub id: SemanticNodeId,
    pub bounds: Rect,
    pub semantics: Semantics,
    pub children: Vec<SemanticNodeId>,
}

#[derive(Clone, Debug, PartialEq)]
pub struct SemanticTree {
    pub root: SemanticNodeId,
    pub focus: SemanticNodeId,
    pub nodes: Vec<SemanticNode>,
}

impl SemanticTree {
    /// Converts surface-relative bounds for hosts whose accessible nodes are
    /// positioned relative to their semantic parent (for example nested DOM).
    /// Root and unattached nodes retain surface coordinates. Recompute after
    /// parent movement/reparenting even when a child's surface bounds are unchanged.
    #[must_use]
    pub fn parent_relative_bounds(&self) -> HashMap<SemanticNodeId, Rect> {
        let mut bounds = self
            .nodes
            .iter()
            .map(|node| (node.id, node.bounds))
            .collect::<HashMap<_, _>>();
        for parent in &self.nodes {
            for child in &parent.children {
                if let Some(bounds) = bounds.get_mut(child) {
                    bounds.origin.x -= parent.bounds.origin.x;
                    bounds.origin.y -= parent.bounds.origin.y;
                }
            }
        }
        bounds
    }

    #[must_use]
    pub fn node(&self, id: SemanticNodeId) -> Option<&SemanticNode> {
        self.nodes.iter().find(|node| node.id == id)
    }

    #[must_use]
    pub fn diff(&self, next: &Self) -> SemanticPatch {
        let old = self
            .nodes
            .iter()
            .map(|node| (node.id, node))
            .collect::<HashMap<_, _>>();
        let next_ids = next
            .nodes
            .iter()
            .map(|node| node.id)
            .collect::<HashSet<_>>();
        SemanticPatch {
            root: (self.root != next.root).then_some(next.root),
            focus: (self.focus != next.focus).then_some(next.focus),
            upserts: next
                .nodes
                .iter()
                .filter(|node| old.get(&node.id).copied() != Some(*node))
                .cloned()
                .collect(),
            removed: self
                .nodes
                .iter()
                .filter(|node| !next_ids.contains(&node.id))
                .map(|node| node.id)
                .collect(),
        }
    }
}

#[derive(Clone, Debug, Default, PartialEq)]
pub struct SemanticPatch {
    pub root: Option<SemanticNodeId>,
    pub focus: Option<SemanticNodeId>,
    pub upserts: Vec<SemanticNode>,
    pub removed: Vec<SemanticNodeId>,
}

impl SemanticPatch {
    #[must_use]
    pub fn is_empty(&self) -> bool {
        self.root.is_none()
            && self.focus.is_none()
            && self.upserts.is_empty()
            && self.removed.is_empty()
    }
}