I'm trying to define queries for sparse trees that combine different conditions, for instance.
SCHEDULEDcloser to one year), and
WAITING, or tagged as unplanned) and
This is in a normal buffer, not the agenda buffer. I do not need this in the agenda buffer.
This would be very easy to do if parenthesis were allowed in sparse tree queries, but they are not implemented.
I need to do this with many conditions. If I distribute conditions over, the number of combinations I'd need to write grows far too quickly and it becomes impractical.
A "solution" would be to apply an
org-match-sparse-tree on the result of another, somehow nesting conditions.
Is this possible? If not, are there alternatives to solve the problem I'm trying to solve?
How much effort would it take to implement parenthesis in search, or cummulative filtering and searching in sparse trees?
EDIT: bounty, hence changing the "goal" of the question.