From a86ccb5f9dd4a5fe8e6af974d7f577e7b5d0a8d4 Mon Sep 17 00:00:00 2001 From: Eli Zaretskii Date: Thu, 1 Dec 2022 17:25:28 +0200 Subject: ; Fix recently added treesit documentation * lisp/treesit.el (treesit-defun-prefer-top-level): * doc/lispref/positions.texi (List Motion): Fix wording. --- lisp/treesit.el | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) (limited to 'lisp') diff --git a/lisp/treesit.el b/lisp/treesit.el index dd7895683ff..0de0e283c3b 100644 --- a/lisp/treesit.el +++ b/lisp/treesit.el @@ -1561,11 +1561,11 @@ Normally Emacs stops at the first defun it encounters. If this variable's value is t, Emacs tries to find the top-level defun, and ignores nested ones. -This variable can also be a list of cons cells of the form (FROM -. TO), where FROM and TO are tree-sitter node type regexps. When -Emacs finds a defun node whose type matches any of the FROM -regexp in the list, Emacs then tries to find the top-level node -matching the corresponding TO regexp.") +This variable can also be a list of cons cells of the +form (FROM . TO), where FROM and TO are tree-sitter node type +regexps. When Emacs finds a defun node whose type matches any of +the FROM regexps in the list, it then tries to find a +higher-level node matching the corresponding TO regexp.") (defun treesit--defun-maybe-top-level (node) "Maybe return the top-level equivalent of NODE. -- cgit v1.2.3