GNU bug report logs - #61231
30.0.50; treesit-induce-sparse-tree: rename LIMIT to DEPTH

Previous Next

Full log

View this message in rfc822 format

From: help-debbugs <at> gnu.org (GNU bug Tracking System)
To: Mickey Petersen <mickey <at> masteringemacs.org>
Subject: bug#61231: closed (Re: bug#61231: 30.0.50; treesit-induce-sparse-tree:
 rename LIMIT to  DEPTH)
Date: Fri, 10 Feb 2023 07:30:02 +0000

[Message part 1 (text/plain, inline)]

Your bug report

#61231: 30.0.50; treesit-induce-sparse-tree: rename LIMIT to DEPTH

which was filed against the emacs package, has been closed.

The explanation is attached below, along with your original report.
If you require more details, please reply to 61231 <at> debbugs.gnu.org.

-- 
61231: https://debbugs.gnu.org/cgi/bugreport.cgi?bug=61231
GNU Bug Tracking System
Contact help-debbugs <at> gnu.org with problems

[Message part 2 (message/rfc822, inline)]

From: Yuan Fu <casouri <at> gmail.com>
To: Mickey Petersen <mickey <at> masteringemacs.org>
Cc: 61231-done <at> debbugs.gnu.org
Subject: Re: bug#61231: 30.0.50; treesit-induce-sparse-tree: rename LIMIT to 
 DEPTH
Date: Thu, 9 Feb 2023 23:29:21 -0800

Yuan Fu <casouri <at> gmail.com> writes:

> Mickey Petersen <mickey <at> masteringemacs.org> writes:
>
>> Minor thing, really, but I think we should rename LIMIT to DEPTH.
>>
>> LIMIT has a rather specific meaning to me when it comes to graph
>> theory. It implies a stop search after a certain number is reached.
>
> I’ll take your word for it ;-)
>
>> Here, it really means *depth*; that is, the tree will cease to scan
>> once it has reached a certain depth in the node tree, as opposed to
>> having reached its limit on matches.
>
> Sure, I can change LIMIT to DEPTH.
>
> Yuan

Done.

[Message part 3 (message/rfc822, inline)]

From: Mickey Petersen <mickey <at> masteringemacs.org>
To: bug-gnu-emacs <at> gnu.org
Subject: 30.0.50; treesit-induce-sparse-tree: rename LIMIT to DEPTH
Date: Thu, 02 Feb 2023 16:02:48 +0000

Minor thing, really, but I think we should rename LIMIT to DEPTH.

LIMIT has a rather specific meaning to me when it comes to graph
theory. It implies a stop search after a certain number is reached.

Here, it really means *depth*; that is, the tree will cease to scan
once it has reached a certain depth in the node tree, as opposed to
having reached its limit on matches.




In GNU Emacs 30.0.50 (build 3, x86_64-pc-linux-gnu, GTK+ Version
 3.24.20, cairo version 1.16.0) of 2023-01-25 built on mickey-work
Repository revision: 8b87d095acfb23b527f955873a59dd9c13ffc9b4
Repository branch: master
Windowing system distributor 'The X.Org Foundation', version 11.0.12013000
System Description: Ubuntu 20.04.3 LTS

Configured using:
 'configure --with-native-compilation --with-json --with-mailutils
 --without-compress-install --with-imagemagick CC=gcc-10'

Configured features:
ACL CAIRO DBUS FREETYPE GIF GLIB GMP GNUTLS GPM GSETTINGS HARFBUZZ
IMAGEMAGICK JPEG JSON LCMS2 LIBOTF LIBSELINUX LIBSYSTEMD LIBXML2
M17N_FLT MODULES NATIVE_COMP NOTIFY INOTIFY PDUMPER PNG RSVG SECCOMP
SOUND SQLITE3 THREADS TIFF TOOLKIT_SCROLL_BARS TREE_SITTER X11 XDBE
XIM XINPUT2 XPM GTK3 ZLIB

Previous Next

GNU bug tracking system
Copyright (C) 1999 Darren O. Benham, 1997,2003 nCipher Corporation Ltd, 1994-97 Ian Jackson.