Rename treesit-traverse-forward-depth-first

* lisp/treesit.el (treesit-traverse-forward): Rename to
'treesit-traverse-forward'.
(treesit-traverse-forward, treesit-search-forward): Use
the new name.

diff --git a/lisp/treesit.el b/lisp/treesit.el
index 761c7147a0e94bc7652cde8f804558d6d1280ec5..98fcf84355097d400f1412d1c05736a6e413de67 100644 (file)
--- a/lisp/treesit.el
+++ b/lisp/treesit.el
@@ -296,7 +296,7 @@ Return either ('sibling node) or ('parent node)."
     (when (treesit-node-parent node)
       (list 'parent (treesit-node-parent node)))))
 
-(defun treesit-traverse-forward-depth-first (node pred &optional step)
+(defun treesit-traverse-forward (node pred &optional step)
   "Traverse the whole tree forward from NODE depth-first.
 
 Traverse starting from NODE (i.e., NODE is passed to PRED).  For
@@ -331,7 +331,7 @@ where NODE is marked 1, traverse as numbered:
               (throw 'match (cadr next))))
           (when next
             ;; If NEXT is non-nil, it must be ('sibling node).
-            (treesit-traverse-forward-depth-first
+            (treesit-traverse-forward
              (cadr next) pred step))))))
 
 (defun treesit-node-children (node &optional named)
@@ -859,7 +859,7 @@ return the matched node.  Return nil if search failed."
            for node =
            (if-let ((starting-point (point))
                     (node (treesit-node-at (point) parser t)))
-               (treesit-traverse-forward-depth-first
+               (treesit-traverse-forward
                 node
                 (lambda (node)
                   (and (not (eq (funcall pos-fn node)