Re: Possible problem with looking-back function

[Andreas Röhler]

Am 19.08.2010 04:43, schrieb Davis Herring:
> > Shouldn't it return 1?
> >      
> The algorithm searches backward until it finds a position from which there
> is a match that extends to point.  Doing more would be quadratic

Hi,

that surprises me.
Check must be done against the string already found.
So workload should grow lineary resp. slightly ascending.

AFAIK exists a bug, resp. missing implementation in re-search-backward.

Cheers

Andreas

--
https://code.launchpad.net/~a-roehler/python-mode
https://code.launchpad.net/s-x-emacs-werkstatt/



>   in the
> value of point (at least), so is considered too slow.
>
> Davis
>
>