|
From: | Dmitry Gutov |
Subject: | Re: Tree-sitter navigation time grows as sqrt(line-number) |
Date: | Thu, 31 Aug 2023 20:32:30 +0300 |
User-agent: | Mozilla/5.0 (X11; Linux x86_64; rv:102.0) Gecko/20100101 Thunderbird/102.13.0 |
On 31/08/2023 14:42, Po Lu wrote:
Dmitry Gutov<dmitry@gutov.dev> writes:Depending on the POV, O(N^2) performance for certain buffer interactions can be considered a bug.But is fixing it is worth the risk? Is the change innocuous enough for the release branch?
It seems so, yes.The change doesn't increase code complexity, and rather fixes an omission where many nodes weren't outright filtered out during the search.
Also, as JD said, packages using tree-sitter are going to be constrained by the lower common denominator of the primitives' performance characteristics. At least some of those will be able to recommend 29.2 (or put it as a dependency).
[Prev in Thread] | Current Thread | [Next in Thread] |