Skip to content

fix: Correctly handle recursive filtering #438

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Jun 29, 2024
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
6 changes: 6 additions & 0 deletions consumer/src/filters.rs
Original file line number Diff line number Diff line change
Expand Up @@ -23,6 +23,12 @@ pub fn common_filter(node: &Node) -> FilterResult {
return FilterResult::ExcludeSubtree;
}

if let Some(parent) = node.parent() {
if common_filter(&parent) == FilterResult::ExcludeSubtree {
return FilterResult::ExcludeSubtree;
}
}

let role = node.role();
if role == Role::GenericContainer || role == Role::InlineTextBox {
return FilterResult::ExcludeNode;
Expand Down
42 changes: 40 additions & 2 deletions platforms/atspi-common/src/adapter.rs
Original file line number Diff line number Diff line change
Expand Up @@ -29,18 +29,28 @@ use crate::{

struct AdapterChangeHandler<'a> {
adapter: &'a Adapter,
added_nodes: HashSet<NodeId>,
removed_nodes: HashSet<NodeId>,
checked_text_change: HashSet<NodeId>,
}

impl<'a> AdapterChangeHandler<'a> {
fn new(adapter: &'a Adapter) -> Self {
Self {
adapter,
added_nodes: HashSet::new(),
removed_nodes: HashSet::new(),
checked_text_change: HashSet::new(),
}
}

fn add_node(&mut self, node: &Node) {
let id = node.id();
if self.added_nodes.contains(&id) {
return;
}
self.added_nodes.insert(id);

let role = node.role();
let is_root = node.is_root();
let node = NodeWrapper(node);
Expand All @@ -65,7 +75,20 @@ impl<'a> AdapterChangeHandler<'a> {
}
}

fn add_subtree(&mut self, node: &Node) {
self.add_node(node);
for child in node.filtered_children(&filter) {
self.add_subtree(&child);
}
}

fn remove_node(&mut self, node: &Node) {
let id = node.id();
if self.removed_nodes.contains(&id) {
return;
}
self.removed_nodes.insert(id);

let role = node.role();
let is_root = node.is_root();
let node = NodeWrapper(node);
Expand All @@ -78,6 +101,13 @@ impl<'a> AdapterChangeHandler<'a> {
.unregister_interfaces(node.id(), node.interfaces());
}

fn remove_subtree(&mut self, node: &Node) {
for child in node.filtered_children(&filter) {
self.remove_subtree(&child);
}
self.remove_node(node);
}

fn emit_text_change_if_needed_parent(&mut self, old_node: &Node, new_node: &Node) {
if !new_node.supports_text_ranges() || !old_node.supports_text_ranges() {
return;
Expand Down Expand Up @@ -220,9 +250,17 @@ impl TreeChangeHandler for AdapterChangeHandler<'_> {
let filter_new = filter(new_node);
if filter_new != filter_old {
if filter_new == FilterResult::Include {
self.add_node(new_node);
if filter_old == FilterResult::ExcludeSubtree {
self.add_subtree(new_node);
} else {
self.add_node(new_node);
}
} else if filter_old == FilterResult::Include {
self.remove_node(old_node);
if filter_new == FilterResult::ExcludeSubtree {
self.remove_subtree(old_node);
} else {
self.remove_node(old_node);
}
}
} else if filter_new == FilterResult::Include {
let old_wrapper = NodeWrapper(old_node);
Expand Down
Loading