pub struct AccessibilityTree {
nodes: FxHashMap<NodeId, ArcRefCell<AccessibilityNode>>,
opaque_node_to_id: FxHashMap<OpaqueNode, NodeId>,
tree_id: TreeId,
epoch: Epoch,
}Expand description
A retained, internal representation of the accessibility tree for a document.
accesskit only provides interchange types for tree updates and action requests, so we need
to define our own representation for incremental tree building.
Fields§
§nodes: FxHashMap<NodeId, ArcRefCell<AccessibilityNode>>§opaque_node_to_id: FxHashMap<OpaqueNode, NodeId>§tree_id: TreeId§epoch: EpochImplementations§
Source§impl AccessibilityTree
impl AccessibilityTree
pub(crate) fn new(tree_id: TreeId, epoch: Epoch) -> Self
Sourcepub(crate) fn update_tree(
&mut self,
root_dom_node: &ServoLayoutNode<'_>,
) -> Option<TreeUpdate>
pub(crate) fn update_tree( &mut self, root_dom_node: &ServoLayoutNode<'_>, ) -> Option<TreeUpdate>
Update this tree based on the current state of the given DOM tree, and if anything changed,
return an accesskit::TreeUpdate representing what changed.
Sourcefn update_node_and_descendants(
&mut self,
dom_node: &ServoLayoutNode<'_>,
tree_update: &mut AccessibilityUpdate,
) -> bool
fn update_node_and_descendants( &mut self, dom_node: &ServoLayoutNode<'_>, tree_update: &mut AccessibilityUpdate, ) -> bool
Update this tree starting at the given DOM node, adding any changed nodes to the given
AccessibilityUpdate.
fn get_or_create_node( &mut self, dom_node: &ServoLayoutNode<'_>, ) -> ArcRefCell<AccessibilityNode>
fn assert_node_by_dom_node( &mut self, dom_node: &ServoLayoutNode<'_>, ) -> ArcRefCell<AccessibilityNode>
fn assert_node_by_id(&self, id: NodeId) -> ArcRefCell<AccessibilityNode>
fn id_for_opaque(&mut self, opaque: OpaqueNode) -> NodeId
pub(crate) fn epoch(&self) -> Epoch
Trait Implementations§
Auto Trait Implementations§
impl Freeze for AccessibilityTree
impl !RefUnwindSafe for AccessibilityTree
impl Send for AccessibilityTree
impl Sync for AccessibilityTree
impl Unpin for AccessibilityTree
impl UnsafeUnpin for AccessibilityTree
impl !UnwindSafe for AccessibilityTree
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> Filterable for T
impl<T> Filterable for T
Source§fn filterable(
self,
filter_name: &'static str,
) -> RequestFilterDataProvider<T, fn(DataRequest<'_>) -> bool>
fn filterable( self, filter_name: &'static str, ) -> RequestFilterDataProvider<T, fn(DataRequest<'_>) -> bool>
Creates a filterable data provider with the given name for debugging. Read more
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> MaybeBoxed<Box<T>> for T
impl<T> MaybeBoxed<Box<T>> for T
Source§fn maybe_boxed(self) -> Box<T>
fn maybe_boxed(self) -> Box<T>
Convert
Source§impl<T> MaybeBoxed<T> for T
impl<T> MaybeBoxed<T> for T
Source§fn maybe_boxed(self) -> T
fn maybe_boxed(self) -> T
Convert