; * src/treesit.c (Ftreesit_node_parent): Improve commentary.

diff --git a/src/treesit.c b/src/treesit.c
index 705ef6af39f776ae7be0da33eeec05b3fc06cb9d..e359f903f2809a710f4049df362ec22e0fbaf53f 100644 (file)
--- a/src/treesit.c
+++ b/src/treesit.c
@@ -1886,6 +1886,10 @@ Return nil if NODE has no parent.  If NODE is nil, return nil.  */)
   TSNode treesit_node = XTS_NODE (node)->node;
   Lisp_Object parser = XTS_NODE (node)->parser;
   TSTreeCursor cursor;
+  /* See the comments to treesit_cursor_helper about the algorithm for
+     finding the parent node.  The complexity is roughly proportional
+     to the square root of the current node's depth in the parse tree,
+     and we punt if the tree is too deep.  */
   if (!treesit_cursor_helper (&cursor, treesit_node, parser))
     return return_value;