GNU bug report logs -
#60531
29.0.50; Some fixes and suggestions for the docstrings of treesit-parent-while and treesit-parent-until
Previous Next
Reported by: Daniel Martín <mardani29 <at> yahoo.es>
Date: Tue, 3 Jan 2023 22:46:02 UTC
Severity: normal
Found in version 29.0.50
Done: Eli Zaretskii <eliz <at> gnu.org>
Bug is archived. No further changes may be made.
To add a comment to this bug, you must first unarchive it, by sending
a message to control AT debbugs.gnu.org, with unarchive 60531 in the body.
You can then email your comments to 60531 AT debbugs.gnu.org in the normal way.
Toggle the display of automated, internal messages from the tracker.
Report forwarded
to
bug-gnu-emacs <at> gnu.org
:
bug#60531
; Package
emacs
.
(Tue, 03 Jan 2023 22:46:02 GMT)
Full text and
rfc822 format available.
Acknowledgement sent
to
Daniel Martín <mardani29 <at> yahoo.es>
:
New bug report received and forwarded. Copy sent to
bug-gnu-emacs <at> gnu.org
.
(Tue, 03 Jan 2023 22:46:02 GMT)
Full text and
rfc822 format available.
Message #5 received at submit <at> debbugs.gnu.org (full text, mbox):
The docstring of treesit-parent-while says:
Return the furthest parent of NODE that satisfies PRED.
Return nil if none was found. PRED should be a function that
takes one argument, the parent node.
But, according to the source code, the first invocation of NODE passes
NODE itself, not its parent:
(let ((last nil))
(while (and node (funcall pred node))
The same happens with the docstring of treesit-parent-until.
Another suggestion I have is that "the furthest parent of NODE" is a bit
ambiguous (furthest from NODE or from the root?). I think it would be
more clear to say it will return the highest (ie. least deep) *ancestor*
of NODE. In 37.3 Retrieving Nodes, we introduce the concepts of
"higher" and "lower" when explaining Tree-sitter nodes, so using this
terminology consistently would avoid confusion.
Reply sent
to
Eli Zaretskii <eliz <at> gnu.org>
:
You have taken responsibility.
(Thu, 05 Jan 2023 07:36:02 GMT)
Full text and
rfc822 format available.
Notification sent
to
Daniel Martín <mardani29 <at> yahoo.es>
:
bug acknowledged by developer.
(Thu, 05 Jan 2023 07:36:02 GMT)
Full text and
rfc822 format available.
Message #10 received at 60531-done <at> debbugs.gnu.org (full text, mbox):
> Date: Tue, 03 Jan 2023 23:45:35 +0100
> From: Daniel Martín via "Bug reports for GNU Emacs,
> the Swiss army knife of text editors" <bug-gnu-emacs <at> gnu.org>
>
>
> The docstring of treesit-parent-while says:
>
> Return the furthest parent of NODE that satisfies PRED.
> Return nil if none was found. PRED should be a function that
> takes one argument, the parent node.
>
> But, according to the source code, the first invocation of NODE passes
> NODE itself, not its parent:
>
> (let ((last nil))
> (while (and node (funcall pred node))
>
> The same happens with the docstring of treesit-parent-until.
This is clearly a case of unnecessary details. I made the doc string
say just "node".
> Another suggestion I have is that "the furthest parent of NODE" is a bit
> ambiguous (furthest from NODE or from the root?). I think it would be
> more clear to say it will return the highest (ie. least deep) *ancestor*
> of NODE. In 37.3 Retrieving Nodes, we introduce the concepts of
> "higher" and "lower" when explaining Tree-sitter nodes, so using this
> terminology consistently would avoid confusion.
Instead of changing a potentially confusing word to another
potentially confusing word, I decided to describe in more detail what
the functions do.
bug archived.
Request was from
Debbugs Internal Request <help-debbugs <at> gnu.org>
to
internal_control <at> debbugs.gnu.org
.
(Thu, 02 Feb 2023 12:24:05 GMT)
Full text and
rfc822 format available.
This bug report was last modified 2 years and 137 days ago.
Previous Next
GNU bug tracking system
Copyright (C) 1999 Darren O. Benham,
1997,2003 nCipher Corporation Ltd,
1994-97 Ian Jackson.