by some other rule in the alist.
There are two pre-defined predicates: @code{named} and @code{anonymous},
-that qualifies named and anonymous nodes, respectively. They can be
+which qualify, respectively, named and anonymous nodes. They can be
combined with @code{and} to narrow down the match.
Here's an example @code{treesit-thing-settings} for C and C++:
return !NILP (calln (pred, lisp_node));
}
else if (SYMBOLP (pred) && BASE_EQ (pred, Qnamed))
- {
- return ts_node_is_named (node);
- }
+ return ts_node_is_named (node);
else if (SYMBOLP (pred) && BASE_EQ (pred, Qanonymous))
- {
- return !ts_node_is_named (node);
- }
+ return !ts_node_is_named (node);
else if (SYMBOLP (pred))
{
Lisp_Object language = XTS_PARSER (parser)->language_symbol;