hiro/bspwm
1
0
Fork 0
mirror of https://github.com/vale981/bspwm synced 2025-03-06 02:01:42 -05:00
Code Issues Projects Releases Packages Wiki Activity Actions

Don't try to skip nodes in query_node_ids_in

Browse source 
Trying to return non-overlapping sub-trees in query_node_ids_in isn't a
good idea after all, because some modifiers aren't compatible with the
idea: if *b* is a descendant of *a*, `a.hidden => b.hidden` is true,
but `a.!automatic => b.!automatic` is false.
This commit is contained in:
Bastien Dejean 2016-05-08 10:21:55 +02:00
parent 28df617346
commit cdc20bbe2a
1 changed files with 0 additions and 3 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

3
query.c
View file

@ -241,9 +241,6 @@ int query_node_ids_in(node_t *n, desktop_t *d, monitor_t *m, coordinates_t loc,
(sel == NULL || node_matches(&trg, &ref, *sel))) {
fprintf(rsp, "0x%08X\n", n->id);
count++;
if (sel != NULL) {
return count;
}
}
count += query_node_ids_in(n->first_child, d, m, loc, sel, rsp);
count += query_node_ids_in(n->second_child, d, m, loc, sel, rsp);