Subject: Re: bug#22090: Isearch is sluggish and eventually refuses further service with "[Too many words]".

From: Artur Malabarba <[email-masked]>
Date: Fri, 4 Dec 2015 16:21:04 +0000

On 4 Dec 2015 3:49 pm, "Random832" <[email-masked]> wrote:
> So has any thought been given to implementing folding searches
> via matching a simple regexp against a projected version of the
> buffer rather than the current mechanism of creating a regexp
> that will always match when it should?

There were suggestions of projecting both the buffer and the search string
(which is what case folding does) but nobody has offered to do it.
What do you mean by "simple regexp"?