Thanks Mark for the gory details which i found fascinating. Unicode is even
more complicated than I realized, and I thought I had a pretty good
understanding of it.
Actually I thought my test 2 demonstrated that matchchunk performed very well
on Unicode, rather than trying to show it was part
On 2024-06-29 08:53, Neville Smythe via use-livecode wrote:
Is it not the case that the processing time for looping over the number
of lines and getting the k-th line in each iteration, for some
arbitrary k, going to be
Order(N^2) * C * T
where
N = the number of lines in the text
C = the nu
Thanks Mark for pointing me (as ever) in the right direction, away from the red
herring but to the hidden inner loop entailed in evaluating
line k of fff
A bit embarrassing because I was party to the discussion some time ago about
the slowness of lineOffset when working with unicode text.
And
