pub struct AccessibilityTree {
nodes: FxHashMap<NodeId, ArcRefCell<AccessibilityNode>>,
opaque_node_to_id: FxHashMap<OpaqueNode, NodeId>,
id_to_opaque_node: FxHashMap<NodeId, OpaqueNode>,
tree_id: TreeId,
root_node: Option<ArcRefCell<AccessibilityNode>>,
embedder_epoch: Epoch,
debug: DiagnosticsLogging,
}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>>All nodes currently in the tree as of the most recent update. New nodes are added and stale
nodes are pruned during AccessibilityTree::update_tree().
opaque_node_to_id: FxHashMap<OpaqueNode, NodeId>A map to allow retrieving the AccessibilityNode which corresponds to a particular DOM
node, if any.
This must be kept in sync with Self::id_to_opaque_node.
id_to_opaque_node: FxHashMap<NodeId, OpaqueNode>A map to retrieve the OpaqueNode corresponding to a particular AccessibilityNode, if
any.
This must be kept in sync with Self::opaque_node_to_id.
tree_id: TreeIdSent with each accesskit::TreeUpdate. This allows this tree to be
grafted into
an application’s tree.
root_node: Option<ArcRefCell<AccessibilityNode>>This node’s ID is sent with each accesskit::TreeUpdate to identify the root node.
Also used for any complete tree walk, such as in Self::assert_integrity() and
Self::print().
embedder_epoch: EpochSent to the embedder alongside each accesskit::TreeUpdate, so that the embedder can
drop updates from documents which have been navigated away from.
debug: DiagnosticsLoggingDebug options, copied from configuration to this AccessibilityTree in order
to avoid having to constantly access the thread-safe global options.
Implementations§
Source§impl AccessibilityTree
impl AccessibilityTree
Sourcepub(crate) fn new(tree_id: TreeId, embedder_epoch: Epoch) -> Self
pub(crate) fn new(tree_id: TreeId, embedder_epoch: Epoch) -> Self
See Self::tree_id and Self::embedder_epoch for explanations of the parameters.
Sourcepub(crate) fn update_tree<'dom>(
&mut self,
root_dom_node: &ServoLayoutNode<'dom>,
damage_from_dom: VecDeque<(ServoLayoutNode<'dom>, AccessibilityDamage)>,
rooted_nodes: Option<FxHashSet<OpaqueNode>>,
) -> (Option<TreeUpdate>, UpdateCounters)
pub(crate) fn update_tree<'dom>( &mut self, root_dom_node: &ServoLayoutNode<'dom>, damage_from_dom: VecDeque<(ServoLayoutNode<'dom>, AccessibilityDamage)>, rooted_nodes: Option<FxHashSet<OpaqueNode>>, ) -> (Option<TreeUpdate>, UpdateCounters)
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 ensure_root_node<'dom>(
&mut self,
root_dom_node: &ServoLayoutNode<'dom>,
damage_from_dom: &mut VecDeque<(ServoLayoutNode<'dom>, AccessibilityDamage)>,
update: &mut AccessibilityUpdate,
)
fn ensure_root_node<'dom>( &mut self, root_dom_node: &ServoLayoutNode<'dom>, damage_from_dom: &mut VecDeque<(ServoLayoutNode<'dom>, AccessibilityDamage)>, update: &mut AccessibilityUpdate, )
Get the node corresponding to the root DOM node, and set it as this tree’s root. If the root
node is newly created, which probably means this accessibility tree is newly created, append
an AccessibilityDamage::REBUILD value for it to damage_from_dom.
Sourcefn apply_changes_from_dom_tree<'dom>(
&mut self,
damage_from_dom: VecDeque<(ServoLayoutNode<'dom>, AccessibilityDamage)>,
update: &mut AccessibilityUpdate,
)
fn apply_changes_from_dom_tree<'dom>( &mut self, damage_from_dom: VecDeque<(ServoLayoutNode<'dom>, AccessibilityDamage)>, update: &mut AccessibilityUpdate, )
For each DOM node in damage_from_dom, update the corresponding accessibility node based on
its AccessibilityDamage. If any LocalAccessibilityDamage results from the update,
propagate LocalAccessibilityDamage::SubtreeChanged to its ancestors.
Sourcefn mark_nodes_and_ancestors_dirty(
&mut self,
dirty_node_ids: impl Iterator<Item = NodeId>,
) -> Option<ArcRefCell<AccessibilityNode>>
fn mark_nodes_and_ancestors_dirty( &mut self, dirty_node_ids: impl Iterator<Item = NodeId>, ) -> Option<ArcRefCell<AccessibilityNode>>
Given an iterator of NodeIds corresponding to nodes which have received some damage from
the DOM:
- mark each node as
dirty; - mark all of each node’s ancestors as
has_dirty_descendants; - return the lowest common ancestor node of all the damaged nodes.
fn get_or_create_node( &mut self, dom_node: &ServoLayoutNode<'_>, update: &mut AccessibilityUpdate, ) -> (NodeId, ArcRefCell<AccessibilityNode>)
fn get_or_create_node_with_id( &mut self, id: NodeId, update: &mut AccessibilityUpdate, ) -> ArcRefCell<AccessibilityNode>
fn node_for_id(&self, id: NodeId) -> Option<ArcRefCell<AccessibilityNode>>
fn assert_node_for_id(&self, id: &NodeId) -> ArcRefCell<AccessibilityNode>
Sourcefn drop_removed_nodes(&mut self, update: AccessibilityUpdate)
fn drop_removed_nodes(&mut self, update: AccessibilityUpdate)
Consume the AccessibilityUpdate by deleting all nodes it detected as being removed from
the tree.
Sourcefn assert_removed_nodes_were_rooted(
&mut self,
update: &AccessibilityUpdate,
rooted_nodes: &mut FxHashSet<OpaqueNode>,
)
fn assert_removed_nodes_were_rooted( &mut self, update: &AccessibilityUpdate, rooted_nodes: &mut FxHashSet<OpaqueNode>, )
If we got rooted_nodes from the document’s AccessibilityData, assert that every node we
marked as TreeChange::Removed during this update was rooted.
Sourcefn assert_remaining_rooted_nodes_not_in_tree(
&self,
rooted_nodes: FxHashSet<OpaqueNode>,
)
fn assert_remaining_rooted_nodes_not_in_tree( &self, rooted_nodes: FxHashSet<OpaqueNode>, )
If we got rooted_nodes from the document’s AccessibilityData, assert that any nodes
which were rooted but not marked as TreeChange::Removed are no longer in the tree after
dropping all nodes which were removed from the tree. They may have been part of a subtree
which was marked TreeChange::Removed on an ancestor node, or may have never made it into
the accessibility tree to begin with.
fn get_or_create_id_for_opaque(&mut self, opaque: OpaqueNode) -> NodeId
fn existing_id_for_opaque(&self, opaque: OpaqueNode) -> Option<NodeId>
pub(crate) fn embedder_epoch(&self) -> Epoch
Sourcefn assert_integrity(&self)
fn assert_integrity(&self)
Assert that the tree is a tree without any dangling references or orphaned nodes.
For accessibility tests only, because it’s expensive.
fn print(&self)
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
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>
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>
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>
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 more