Struct SemanticsTree 

pub struct SemanticsTree { /* private fields */ }

Retained semantic arena. IDs are generational, so stale platform actions cannot address a node that later reuses the same storage slot.

Implementations

impl SemanticsTree

pub fn new() -> Self

pub const fn root(&self) -> Option<SemanticNodeId>

pub fn set_root(&mut self, root: Option<SemanticNodeId>)

pub fn node(&self, id: SemanticNodeId) -> Option<&SemanticNode>

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub const fn diagnostics(&self) -> SemanticsDiagnostics

pub const fn revision(&self) -> u64

Revision of the retained semantic graph.

This is deliberately independent from paint and compositor state. A platform bridge can use it as a cheap dirty signal before performing any projection work.

pub fn insert(&mut self, node: SemanticNode) -> SemanticNodeId

pub fn update(&mut self, id: SemanticNodeId, node: SemanticNode) -> bool

pub fn update_geometry( &mut self, id: SemanticNodeId, bounds: Rect, children: &[SemanticNodeId], ) -> bool

Updates only bounds and children of a retained node, leaving its role, text, state and actions untouched and uncopied. Reports the same revision and diagnostics changes as Self::update would for a node whose other properties are unchanged. Returns false for a stale id.

pub fn remove(&mut self, id: SemanticNodeId) -> Option<SemanticNode>

pub fn note_action(&mut self)

pub fn note_native_update(&mut self)

pub fn iter(&self) -> impl Iterator<Item = (SemanticNodeId, &SemanticNode)>

pub fn changed_since( &self, revision: u64, ) -> impl Iterator<Item = (SemanticNodeId, &SemanticNode)>

Nodes inserted or changed after graph revision revision, in arena order. A projection last synchronized at revision reads these instead of copying and comparing the whole tree. Removals are not listed; SemanticsDiagnostics::nodes_removed tells whether any happened.

pub fn debug_dump(&self) -> String

pub fn debug_dump_bounded(&self, max_nodes: usize) -> String

Produces a deterministic diagnostic dump with hard node, depth, and text limits. Accessibility trees can be application-sized, so debug tooling must not recurse or allocate in proportion to an unbounded subtree. A truncation marker is included in the returned text when a limit is reached.

pub fn debug_dump_limited( &self, max_nodes: usize, max_depth: usize, max_text_chars: usize, ) -> String

Lower-level bounded dump used by retained diagnostics and visual debuggers that need a tighter label/depth budget.

Trait Implementations

impl Default for SemanticsTree

fn default() -> Self

Returns the “default value” for a type.