Re: Tree-sitter navigation time grows as sqrt(line-number)

[Eli Zaretskii]

> Date: Thu, 17 Aug 2023 13:56:46 +0300
> From: Dmitry Gutov <dmitry@gutov.dev>
> 
> On 17/08/2023 07:01, JD Smith wrote:
> > It 
> > does vaguely remind me of similar scaling with an old line-numbering 
> > algorithm, where lines were always being counted from the beginning of 
> > the buffer, so very fast at the front, and very slow near the end.

Why on earth would someone need to count lines far from the beginning
of the buffer?  Or have a computer with more than 640KB of memory?