Akira Komamura

> Looking at that idea again, I really don't like it, because it would mean that queries would no longer be predicate sexps. That makes sense. The feature probably don't...

> To be clear, what I meant that I don't like is this syntax I suggested > I'm still interested in a way to skip subtrees in queries. Yes, I...

Rather than extending `org-ql-select` or the query language to support subtree skipping, how about supporting the feature in `org-ql-search` and dynamic blocks for now? Because those interfaces don't accept the...

@yantar92 I didn't look into `org-defpred` well. Your code example apparently doesn't work, but using `org-defpred` seems to be a solution. Thank you for your information.

@yantar92 No, it doesn't work. It doesn't produce what I expect. Instead, the following worked: ```emacs-lisp (org-ql-defpred skip-subtrees (query) "Run QUERY skipping the whole subtree when it fails." :normalizers ((`(root...

That is another feature I wanted to request, but what I meant was skipping to the next heading of the same or upper level when you reach a matching heading....

Please reopen this issue.

I just wondered if org-ql could be used to scan project as defined in [this article](http://doc.norang.ca/org-mode.html#Projects). Actually, doing such scanning can be both complex and slow, so not supporting it...

> I think that might do it. What do you think? It seems to work. Thank you. I thought of adding an option like `:skip-children` as an analogy to the...

I personally prefer a query API that conforms to set theory (and SQL), so using `and` and `or` looks more natural than `when`. However, Lisp hackers may have a different...