Struct A11yTree 

pub struct A11yTree { /* private fields */ }

An insertion-ordered tree of semantic nodes.

Implementations

impl A11yTree

pub fn new() -> Self

An empty tree.

pub fn insert(&mut self, node: A11yNode) -> NodeId

Insert a node; ids must be unique and ascending is conventional but not required. Returns the node’s id for chaining.

pub fn push(&mut self, node: A11yNode) -> NodeId

Insert with the next free id.

pub fn get(&self, id: NodeId) -> Option<&A11yNode>

Look up a node.

pub fn nodes(&self) -> &[A11yNode]

All nodes, in insertion order.

pub fn roots(&self) -> Vec<NodeId>

Roots (nodes without a parent).

pub fn focused(&self) -> Vec<NodeId>

The focused node, if exactly one claims focus.

pub fn audit(&self) -> Result<TreeAudit, AuditError>

Audit the tree. Every rule is a CI gate:

1. unique ids;
2. parents and relation targets exist;
3. no structural cycles;
4. interactive roles carry an accessible name;
5. at most one focused node, and it is reachable from a root.

pub fn reachable_from_roots(&self) -> Vec<NodeId>

Every node reachable by walking parents down from the roots.

pub fn children_of(&self, id: NodeId) -> Vec<NodeId>

Direct children of id.

pub fn descendants_of(&self, id: NodeId) -> Vec<NodeId>

id and every node beneath it (depth-first, parents first).

Trait Implementations

impl Clone for A11yTree

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for A11yTree

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for A11yTree

fn default() -> Self

Returns the “default value” for a type.